./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-collitem-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-collitem-symm.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 631177edb7ca950f3594c5b6eaac98148a00ee69e6a0cd62c1c95947fa56259c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:30:20,205 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:30:20,264 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:30:20,271 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:30:20,272 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:30:20,293 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:30:20,293 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:30:20,294 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:30:20,294 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:30:20,294 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:30:20,295 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:30:20,295 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:30:20,295 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:30:20,295 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:30:20,295 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:30:20,295 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:30:20,295 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:30:20,295 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:30:20,295 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:30:20,295 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:30:20,295 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:30:20,295 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:30:20,295 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:30:20,295 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:30:20,295 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:30:20,295 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:30:20,296 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:30:20,296 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:30:20,296 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:30:20,296 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:30:20,296 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:30:20,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:20,296 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:30:20,296 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:30:20,296 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:30:20,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:20,296 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:30:20,296 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:30:20,296 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:30:20,296 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:30:20,296 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:30:20,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:30:20,296 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:30:20,296 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:30:20,297 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:30:20,297 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:30:20,297 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 -> 631177edb7ca950f3594c5b6eaac98148a00ee69e6a0cd62c1c95947fa56259c [2025-01-09 21:30:20,563 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:30:20,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:30:20,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:30:20,570 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:30:20,570 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:30:20,571 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-collitem-symm.wvr.c [2025-01-09 21:30:21,743 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ab1cc34f/8e0ef105aa64432eb1d70ea21c07b53b/FLAG66c089bad [2025-01-09 21:30:21,944 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:30:21,945 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-collitem-symm.wvr.c [2025-01-09 21:30:21,959 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ab1cc34f/8e0ef105aa64432eb1d70ea21c07b53b/FLAG66c089bad [2025-01-09 21:30:22,318 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ab1cc34f/8e0ef105aa64432eb1d70ea21c07b53b [2025-01-09 21:30:22,321 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:30:22,323 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:30:22,324 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:30:22,325 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:30:22,329 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:30:22,330 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:30:22" (1/1) ... [2025-01-09 21:30:22,330 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72d820d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:22, skipping insertion in model container [2025-01-09 21:30:22,331 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:30:22" (1/1) ... [2025-01-09 21:30:22,346 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:30:22,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:30:22,520 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:30:22,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:30:22,563 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:30:22,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:22 WrapperNode [2025-01-09 21:30:22,564 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:30:22,564 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:30:22,566 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:30:22,566 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:30:22,571 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:22" (1/1) ... [2025-01-09 21:30:22,578 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:22" (1/1) ... [2025-01-09 21:30:22,605 INFO L138 Inliner]: procedures = 21, calls = 26, calls flagged for inlining = 16, calls inlined = 30, statements flattened = 405 [2025-01-09 21:30:22,608 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:30:22,608 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:30:22,608 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:30:22,609 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:30:22,616 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:22" (1/1) ... [2025-01-09 21:30:22,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:22" (1/1) ... [2025-01-09 21:30:22,624 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:22" (1/1) ... [2025-01-09 21:30:22,624 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:22" (1/1) ... [2025-01-09 21:30:22,637 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:22" (1/1) ... [2025-01-09 21:30:22,638 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:22" (1/1) ... [2025-01-09 21:30:22,640 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:22" (1/1) ... [2025-01-09 21:30:22,647 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:22" (1/1) ... [2025-01-09 21:30:22,648 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:22" (1/1) ... [2025-01-09 21:30:22,651 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:30:22,652 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:30:22,652 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:30:22,652 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:30:22,653 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:22" (1/1) ... [2025-01-09 21:30:22,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:22,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:30:22,686 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:30:22,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:30:22,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:30:22,709 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:30:22,709 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:30:22,709 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:30:22,709 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:30:22,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:30:22,709 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 21:30:22,709 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 21:30:22,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:30:22,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:30:22,711 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:30:22,828 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:30:22,829 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:30:23,264 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:30:23,265 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:30:23,785 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:30:23,786 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:30:23,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:30:23 BoogieIcfgContainer [2025-01-09 21:30:23,786 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:30:23,787 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:30:23,787 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:30:23,790 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:30:23,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:30:22" (1/3) ... [2025-01-09 21:30:23,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5617ac4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:30:23, skipping insertion in model container [2025-01-09 21:30:23,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:22" (2/3) ... [2025-01-09 21:30:23,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5617ac4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:30:23, skipping insertion in model container [2025-01-09 21:30:23,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:30:23" (3/3) ... [2025-01-09 21:30:23,792 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-collitem-symm.wvr.c [2025-01-09 21:30:23,804 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:30:23,805 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-collitem-symm.wvr.c that has 3 procedures, 230 locations, 1 initial locations, 0 loop locations, and 52 error locations. [2025-01-09 21:30:23,805 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:30:23,881 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:30:23,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 236 places, 235 transitions, 484 flow [2025-01-09 21:30:23,983 INFO L124 PetriNetUnfolderBase]: 6/233 cut-off events. [2025-01-09 21:30:23,985 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:30:23,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 233 events. 6/233 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 284 event pairs, 0 based on Foata normal form. 0/175 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2025-01-09 21:30:23,988 INFO L82 GeneralOperation]: Start removeDead. Operand has 236 places, 235 transitions, 484 flow [2025-01-09 21:30:23,992 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 216 places, 213 transitions, 438 flow [2025-01-09 21:30:24,002 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:30:24,012 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;@54a7b032, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:30:24,012 INFO L334 AbstractCegarLoop]: Starting to check reachability of 90 error locations. [2025-01-09 21:30:24,017 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:30:24,018 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-01-09 21:30:24,018 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:30:24,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:24,019 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] [2025-01-09 21:30:24,019 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2025-01-09 21:30:24,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:24,024 INFO L85 PathProgramCache]: Analyzing trace with hash 44131651, now seen corresponding path program 1 times [2025-01-09 21:30:24,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:24,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931963222] [2025-01-09 21:30:24,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:24,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:24,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 21:30:24,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 21:30:24,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:24,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:24,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:24,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:24,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931963222] [2025-01-09 21:30:24,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931963222] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:24,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:24,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:24,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164174799] [2025-01-09 21:30:24,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:24,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:24,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:24,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:24,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:24,176 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 235 [2025-01-09 21:30:24,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 213 transitions, 438 flow. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:24,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:24,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 235 [2025-01-09 21:30:24,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:24,274 INFO L124 PetriNetUnfolderBase]: 5/184 cut-off events. [2025-01-09 21:30:24,274 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-09 21:30:24,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 184 events. 5/184 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 3 based on Foata normal form. 2/167 useless extension candidates. Maximal degree in co-relation 48. Up to 16 conditions per place. [2025-01-09 21:30:24,276 INFO L140 encePairwiseOnDemand]: 194/235 looper letters, 9 selfloop transitions, 2 changer transitions 2/174 dead transitions. [2025-01-09 21:30:24,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 174 transitions, 382 flow [2025-01-09 21:30:24,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:24,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:24,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 596 transitions. [2025-01-09 21:30:24,288 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8453900709219858 [2025-01-09 21:30:24,289 INFO L175 Difference]: Start difference. First operand has 216 places, 213 transitions, 438 flow. Second operand 3 states and 596 transitions. [2025-01-09 21:30:24,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 174 transitions, 382 flow [2025-01-09 21:30:24,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 174 transitions, 374 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 21:30:24,295 INFO L231 Difference]: Finished difference. Result has 177 places, 172 transitions, 352 flow [2025-01-09 21:30:24,296 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=352, PETRI_PLACES=177, PETRI_TRANSITIONS=172} [2025-01-09 21:30:24,298 INFO L279 CegarLoopForPetriNet]: 216 programPoint places, -39 predicate places. [2025-01-09 21:30:24,298 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 172 transitions, 352 flow [2025-01-09 21:30:24,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:24,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:24,299 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] [2025-01-09 21:30:24,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:30:24,299 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2025-01-09 21:30:24,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:24,300 INFO L85 PathProgramCache]: Analyzing trace with hash -446966841, now seen corresponding path program 1 times [2025-01-09 21:30:24,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:24,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473008619] [2025-01-09 21:30:24,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:24,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:24,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 21:30:24,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 21:30:24,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:24,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:24,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:24,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:24,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473008619] [2025-01-09 21:30:24,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473008619] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:24,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:24,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:24,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024592079] [2025-01-09 21:30:24,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:24,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:24,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:24,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:24,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:24,348 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 235 [2025-01-09 21:30:24,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 172 transitions, 352 flow. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:24,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:24,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 235 [2025-01-09 21:30:24,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:24,396 INFO L124 PetriNetUnfolderBase]: 5/181 cut-off events. [2025-01-09 21:30:24,396 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:30:24,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 181 events. 5/181 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 3 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 172. Up to 16 conditions per place. [2025-01-09 21:30:24,397 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 9 selfloop transitions, 2 changer transitions 0/171 dead transitions. [2025-01-09 21:30:24,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 171 transitions, 372 flow [2025-01-09 21:30:24,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:24,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:24,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 558 transitions. [2025-01-09 21:30:24,401 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7914893617021277 [2025-01-09 21:30:24,401 INFO L175 Difference]: Start difference. First operand has 177 places, 172 transitions, 352 flow. Second operand 3 states and 558 transitions. [2025-01-09 21:30:24,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 171 transitions, 372 flow [2025-01-09 21:30:24,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 171 transitions, 368 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:24,406 INFO L231 Difference]: Finished difference. Result has 174 places, 171 transitions, 350 flow [2025-01-09 21:30:24,408 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=350, PETRI_PLACES=174, PETRI_TRANSITIONS=171} [2025-01-09 21:30:24,408 INFO L279 CegarLoopForPetriNet]: 216 programPoint places, -42 predicate places. [2025-01-09 21:30:24,408 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 171 transitions, 350 flow [2025-01-09 21:30:24,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:24,409 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:24,409 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] [2025-01-09 21:30:24,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:30:24,410 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2025-01-09 21:30:24,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:24,413 INFO L85 PathProgramCache]: Analyzing trace with hash 2087081793, now seen corresponding path program 1 times [2025-01-09 21:30:24,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:24,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631108885] [2025-01-09 21:30:24,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:24,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:24,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 21:30:24,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 21:30:24,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:24,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:24,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:24,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:24,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631108885] [2025-01-09 21:30:24,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631108885] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:24,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:24,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:24,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671371669] [2025-01-09 21:30:24,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:24,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:24,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:24,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:24,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:24,488 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 235 [2025-01-09 21:30:24,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 171 transitions, 350 flow. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:24,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:24,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 235 [2025-01-09 21:30:24,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:24,537 INFO L124 PetriNetUnfolderBase]: 5/180 cut-off events. [2025-01-09 21:30:24,537 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:30:24,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 180 events. 5/180 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 3 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 163. Up to 16 conditions per place. [2025-01-09 21:30:24,538 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 9 selfloop transitions, 2 changer transitions 0/170 dead transitions. [2025-01-09 21:30:24,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 170 transitions, 370 flow [2025-01-09 21:30:24,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:24,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:24,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 558 transitions. [2025-01-09 21:30:24,542 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7914893617021277 [2025-01-09 21:30:24,542 INFO L175 Difference]: Start difference. First operand has 174 places, 171 transitions, 350 flow. Second operand 3 states and 558 transitions. [2025-01-09 21:30:24,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 170 transitions, 370 flow [2025-01-09 21:30:24,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 170 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:24,547 INFO L231 Difference]: Finished difference. Result has 173 places, 170 transitions, 348 flow [2025-01-09 21:30:24,548 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=348, PETRI_PLACES=173, PETRI_TRANSITIONS=170} [2025-01-09 21:30:24,548 INFO L279 CegarLoopForPetriNet]: 216 programPoint places, -43 predicate places. [2025-01-09 21:30:24,549 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 170 transitions, 348 flow [2025-01-09 21:30:24,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:24,550 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:24,550 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:24,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:30:24,550 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2025-01-09 21:30:24,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:24,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1448159224, now seen corresponding path program 1 times [2025-01-09 21:30:24,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:24,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307686809] [2025-01-09 21:30:24,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:24,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:24,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:30:24,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:30:24,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:24,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:24,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:24,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:24,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307686809] [2025-01-09 21:30:24,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307686809] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:24,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:24,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:24,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036045497] [2025-01-09 21:30:24,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:24,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:24,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:24,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:24,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:24,645 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 235 [2025-01-09 21:30:24,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 170 transitions, 348 flow. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:24,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:24,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 235 [2025-01-09 21:30:24,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:24,716 INFO L124 PetriNetUnfolderBase]: 5/179 cut-off events. [2025-01-09 21:30:24,716 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:30:24,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 179 events. 5/179 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 3 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 154. Up to 16 conditions per place. [2025-01-09 21:30:24,717 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 9 selfloop transitions, 2 changer transitions 0/169 dead transitions. [2025-01-09 21:30:24,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 169 transitions, 368 flow [2025-01-09 21:30:24,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:24,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:24,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 558 transitions. [2025-01-09 21:30:24,719 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7914893617021277 [2025-01-09 21:30:24,719 INFO L175 Difference]: Start difference. First operand has 173 places, 170 transitions, 348 flow. Second operand 3 states and 558 transitions. [2025-01-09 21:30:24,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 169 transitions, 368 flow [2025-01-09 21:30:24,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 169 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:24,721 INFO L231 Difference]: Finished difference. Result has 172 places, 169 transitions, 346 flow [2025-01-09 21:30:24,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=346, PETRI_PLACES=172, PETRI_TRANSITIONS=169} [2025-01-09 21:30:24,722 INFO L279 CegarLoopForPetriNet]: 216 programPoint places, -44 predicate places. [2025-01-09 21:30:24,722 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 169 transitions, 346 flow [2025-01-09 21:30:24,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:24,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:24,723 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:24,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:30:24,723 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2025-01-09 21:30:24,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:24,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1683287176, now seen corresponding path program 1 times [2025-01-09 21:30:24,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:24,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240700811] [2025-01-09 21:30:24,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:24,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:24,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 21:30:24,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 21:30:24,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:24,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:24,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:24,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:24,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240700811] [2025-01-09 21:30:24,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240700811] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:24,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:24,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:24,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042497914] [2025-01-09 21:30:24,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:24,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:24,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:24,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:24,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:24,798 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 235 [2025-01-09 21:30:24,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 169 transitions, 346 flow. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:24,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:24,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 235 [2025-01-09 21:30:24,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:24,856 INFO L124 PetriNetUnfolderBase]: 5/178 cut-off events. [2025-01-09 21:30:24,857 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:30:24,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 178 events. 5/178 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 3 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 145. Up to 16 conditions per place. [2025-01-09 21:30:24,857 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 9 selfloop transitions, 2 changer transitions 0/168 dead transitions. [2025-01-09 21:30:24,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 168 transitions, 366 flow [2025-01-09 21:30:24,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:24,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:24,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 558 transitions. [2025-01-09 21:30:24,859 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7914893617021277 [2025-01-09 21:30:24,859 INFO L175 Difference]: Start difference. First operand has 172 places, 169 transitions, 346 flow. Second operand 3 states and 558 transitions. [2025-01-09 21:30:24,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 168 transitions, 366 flow [2025-01-09 21:30:24,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 168 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:24,861 INFO L231 Difference]: Finished difference. Result has 171 places, 168 transitions, 344 flow [2025-01-09 21:30:24,862 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=171, PETRI_TRANSITIONS=168} [2025-01-09 21:30:24,862 INFO L279 CegarLoopForPetriNet]: 216 programPoint places, -45 predicate places. [2025-01-09 21:30:24,862 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 168 transitions, 344 flow [2025-01-09 21:30:24,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:24,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:24,863 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:24,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:30:24,863 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2025-01-09 21:30:24,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:24,864 INFO L85 PathProgramCache]: Analyzing trace with hash -698085668, now seen corresponding path program 1 times [2025-01-09 21:30:24,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:24,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955224015] [2025-01-09 21:30:24,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:24,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:24,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 21:30:24,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 21:30:24,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:24,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:24,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:24,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:24,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955224015] [2025-01-09 21:30:24,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955224015] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:24,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:24,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:24,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916986427] [2025-01-09 21:30:24,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:24,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:24,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:24,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:24,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:24,958 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 235 [2025-01-09 21:30:24,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 168 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:24,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:24,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 235 [2025-01-09 21:30:24,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:24,989 INFO L124 PetriNetUnfolderBase]: 5/177 cut-off events. [2025-01-09 21:30:24,989 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:30:24,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 177 events. 5/177 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 65 event pairs, 3 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 136. Up to 16 conditions per place. [2025-01-09 21:30:24,989 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 9 selfloop transitions, 2 changer transitions 0/167 dead transitions. [2025-01-09 21:30:24,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 167 transitions, 364 flow [2025-01-09 21:30:24,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:24,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:24,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 558 transitions. [2025-01-09 21:30:24,992 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7914893617021277 [2025-01-09 21:30:24,992 INFO L175 Difference]: Start difference. First operand has 171 places, 168 transitions, 344 flow. Second operand 3 states and 558 transitions. [2025-01-09 21:30:24,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 167 transitions, 364 flow [2025-01-09 21:30:24,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 167 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:24,994 INFO L231 Difference]: Finished difference. Result has 170 places, 167 transitions, 342 flow [2025-01-09 21:30:24,994 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=342, PETRI_PLACES=170, PETRI_TRANSITIONS=167} [2025-01-09 21:30:24,995 INFO L279 CegarLoopForPetriNet]: 216 programPoint places, -46 predicate places. [2025-01-09 21:30:24,995 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 167 transitions, 342 flow [2025-01-09 21:30:24,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:24,995 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:24,995 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] [2025-01-09 21:30:24,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:30:24,995 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2025-01-09 21:30:24,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:24,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1450537670, now seen corresponding path program 1 times [2025-01-09 21:30:24,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:24,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72559153] [2025-01-09 21:30:24,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:24,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:25,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 21:30:25,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 21:30:25,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:25,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:25,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:25,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:25,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72559153] [2025-01-09 21:30:25,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72559153] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:25,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:25,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:25,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973169222] [2025-01-09 21:30:25,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:25,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:25,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:25,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:25,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:25,058 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 235 [2025-01-09 21:30:25,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 167 transitions, 342 flow. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:25,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:25,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 235 [2025-01-09 21:30:25,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:25,091 INFO L124 PetriNetUnfolderBase]: 5/176 cut-off events. [2025-01-09 21:30:25,091 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:30:25,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 176 events. 5/176 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 3 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 127. Up to 16 conditions per place. [2025-01-09 21:30:25,092 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 9 selfloop transitions, 2 changer transitions 0/166 dead transitions. [2025-01-09 21:30:25,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 166 transitions, 362 flow [2025-01-09 21:30:25,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:25,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:25,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 558 transitions. [2025-01-09 21:30:25,093 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7914893617021277 [2025-01-09 21:30:25,093 INFO L175 Difference]: Start difference. First operand has 170 places, 167 transitions, 342 flow. Second operand 3 states and 558 transitions. [2025-01-09 21:30:25,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 166 transitions, 362 flow [2025-01-09 21:30:25,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 166 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:25,096 INFO L231 Difference]: Finished difference. Result has 169 places, 166 transitions, 340 flow [2025-01-09 21:30:25,096 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=340, PETRI_PLACES=169, PETRI_TRANSITIONS=166} [2025-01-09 21:30:25,096 INFO L279 CegarLoopForPetriNet]: 216 programPoint places, -47 predicate places. [2025-01-09 21:30:25,096 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 166 transitions, 340 flow [2025-01-09 21:30:25,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:25,097 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:25,097 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] [2025-01-09 21:30:25,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:30:25,097 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2025-01-09 21:30:25,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:25,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1331132437, now seen corresponding path program 1 times [2025-01-09 21:30:25,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:25,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882117358] [2025-01-09 21:30:25,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:25,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:25,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 21:30:25,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 21:30:25,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:25,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:25,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:25,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:25,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882117358] [2025-01-09 21:30:25,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882117358] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:25,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:25,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:25,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421202224] [2025-01-09 21:30:25,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:25,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:25,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:25,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:25,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:25,153 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 235 [2025-01-09 21:30:25,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 166 transitions, 340 flow. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:25,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:25,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 235 [2025-01-09 21:30:25,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:25,199 INFO L124 PetriNetUnfolderBase]: 5/175 cut-off events. [2025-01-09 21:30:25,199 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:30:25,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 175 events. 5/175 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 3 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 118. Up to 16 conditions per place. [2025-01-09 21:30:25,202 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 9 selfloop transitions, 2 changer transitions 0/165 dead transitions. [2025-01-09 21:30:25,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 165 transitions, 360 flow [2025-01-09 21:30:25,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:25,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:25,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 558 transitions. [2025-01-09 21:30:25,203 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7914893617021277 [2025-01-09 21:30:25,203 INFO L175 Difference]: Start difference. First operand has 169 places, 166 transitions, 340 flow. Second operand 3 states and 558 transitions. [2025-01-09 21:30:25,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 165 transitions, 360 flow [2025-01-09 21:30:25,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 165 transitions, 356 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:25,205 INFO L231 Difference]: Finished difference. Result has 168 places, 165 transitions, 338 flow [2025-01-09 21:30:25,206 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=338, PETRI_PLACES=168, PETRI_TRANSITIONS=165} [2025-01-09 21:30:25,207 INFO L279 CegarLoopForPetriNet]: 216 programPoint places, -48 predicate places. [2025-01-09 21:30:25,207 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 165 transitions, 338 flow [2025-01-09 21:30:25,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:25,207 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:25,207 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] [2025-01-09 21:30:25,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:30:25,207 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2025-01-09 21:30:25,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:25,208 INFO L85 PathProgramCache]: Analyzing trace with hash -716268183, now seen corresponding path program 1 times [2025-01-09 21:30:25,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:25,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279952670] [2025-01-09 21:30:25,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:25,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:25,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 21:30:25,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 21:30:25,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:25,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:25,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:25,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:25,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279952670] [2025-01-09 21:30:25,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279952670] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:25,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:25,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:25,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152771804] [2025-01-09 21:30:25,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:25,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:25,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:25,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:25,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:25,286 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 235 [2025-01-09 21:30:25,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 165 transitions, 338 flow. Second operand has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:25,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:25,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 235 [2025-01-09 21:30:25,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:25,331 INFO L124 PetriNetUnfolderBase]: 5/174 cut-off events. [2025-01-09 21:30:25,331 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:30:25,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 174 events. 5/174 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 3 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 112. Up to 19 conditions per place. [2025-01-09 21:30:25,332 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 12 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2025-01-09 21:30:25,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 164 transitions, 364 flow [2025-01-09 21:30:25,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:25,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:25,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 552 transitions. [2025-01-09 21:30:25,334 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7829787234042553 [2025-01-09 21:30:25,334 INFO L175 Difference]: Start difference. First operand has 168 places, 165 transitions, 338 flow. Second operand 3 states and 552 transitions. [2025-01-09 21:30:25,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 164 transitions, 364 flow [2025-01-09 21:30:25,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 164 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:25,337 INFO L231 Difference]: Finished difference. Result has 167 places, 164 transitions, 336 flow [2025-01-09 21:30:25,337 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=167, PETRI_TRANSITIONS=164} [2025-01-09 21:30:25,338 INFO L279 CegarLoopForPetriNet]: 216 programPoint places, -49 predicate places. [2025-01-09 21:30:25,338 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 164 transitions, 336 flow [2025-01-09 21:30:25,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:25,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:25,338 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] [2025-01-09 21:30:25,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:30:25,339 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2025-01-09 21:30:25,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:25,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1251131674, now seen corresponding path program 1 times [2025-01-09 21:30:25,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:25,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098773695] [2025-01-09 21:30:25,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:25,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:25,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 21:30:25,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 21:30:25,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:25,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:25,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:25,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:25,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098773695] [2025-01-09 21:30:25,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098773695] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:25,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:25,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:25,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185412375] [2025-01-09 21:30:25,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:25,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:25,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:25,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:25,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:25,428 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 235 [2025-01-09 21:30:25,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 164 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:25,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:25,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 235 [2025-01-09 21:30:25,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:25,483 INFO L124 PetriNetUnfolderBase]: 5/173 cut-off events. [2025-01-09 21:30:25,483 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:30:25,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 173 events. 5/173 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 3 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 103. Up to 19 conditions per place. [2025-01-09 21:30:25,484 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 12 selfloop transitions, 2 changer transitions 0/163 dead transitions. [2025-01-09 21:30:25,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 163 transitions, 362 flow [2025-01-09 21:30:25,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:25,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:25,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 552 transitions. [2025-01-09 21:30:25,485 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7829787234042553 [2025-01-09 21:30:25,486 INFO L175 Difference]: Start difference. First operand has 167 places, 164 transitions, 336 flow. Second operand 3 states and 552 transitions. [2025-01-09 21:30:25,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 163 transitions, 362 flow [2025-01-09 21:30:25,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 163 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:25,488 INFO L231 Difference]: Finished difference. Result has 166 places, 163 transitions, 334 flow [2025-01-09 21:30:25,488 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=334, PETRI_PLACES=166, PETRI_TRANSITIONS=163} [2025-01-09 21:30:25,488 INFO L279 CegarLoopForPetriNet]: 216 programPoint places, -50 predicate places. [2025-01-09 21:30:25,489 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 163 transitions, 334 flow [2025-01-09 21:30:25,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:25,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:25,489 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:25,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:30:25,489 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2025-01-09 21:30:25,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:25,490 INFO L85 PathProgramCache]: Analyzing trace with hash -509010271, now seen corresponding path program 1 times [2025-01-09 21:30:25,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:25,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786511193] [2025-01-09 21:30:25,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:25,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:25,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 21:30:25,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 21:30:25,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:25,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:25,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:25,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:25,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786511193] [2025-01-09 21:30:25,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786511193] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:25,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:25,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:25,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148485782] [2025-01-09 21:30:25,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:25,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:25,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:25,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:25,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:25,597 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 235 [2025-01-09 21:30:25,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 163 transitions, 334 flow. Second operand has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:25,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:25,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 235 [2025-01-09 21:30:25,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:25,649 INFO L124 PetriNetUnfolderBase]: 5/170 cut-off events. [2025-01-09 21:30:25,649 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:30:25,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 170 events. 5/170 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 57 event pairs, 3 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 91. Up to 14 conditions per place. [2025-01-09 21:30:25,650 INFO L140 encePairwiseOnDemand]: 231/235 looper letters, 12 selfloop transitions, 1 changer transitions 0/160 dead transitions. [2025-01-09 21:30:25,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 160 transitions, 354 flow [2025-01-09 21:30:25,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:25,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:25,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 553 transitions. [2025-01-09 21:30:25,655 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7843971631205674 [2025-01-09 21:30:25,655 INFO L175 Difference]: Start difference. First operand has 166 places, 163 transitions, 334 flow. Second operand 3 states and 553 transitions. [2025-01-09 21:30:25,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 160 transitions, 354 flow [2025-01-09 21:30:25,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 160 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:25,661 INFO L231 Difference]: Finished difference. Result has 163 places, 160 transitions, 326 flow [2025-01-09 21:30:25,662 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=326, PETRI_PLACES=163, PETRI_TRANSITIONS=160} [2025-01-09 21:30:25,663 INFO L279 CegarLoopForPetriNet]: 216 programPoint places, -53 predicate places. [2025-01-09 21:30:25,663 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 160 transitions, 326 flow [2025-01-09 21:30:25,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:25,663 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:25,663 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:25,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:30:25,663 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2025-01-09 21:30:25,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:25,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1239760229, now seen corresponding path program 1 times [2025-01-09 21:30:25,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:25,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853345552] [2025-01-09 21:30:25,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:25,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:25,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 21:30:25,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 21:30:25,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:25,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:25,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:25,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:25,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853345552] [2025-01-09 21:30:25,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853345552] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:25,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:25,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:25,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693209069] [2025-01-09 21:30:25,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:25,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:25,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:25,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:25,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:25,812 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 235 [2025-01-09 21:30:25,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 160 transitions, 326 flow. Second operand has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:25,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:25,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 235 [2025-01-09 21:30:25,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:25,856 INFO L124 PetriNetUnfolderBase]: 6/192 cut-off events. [2025-01-09 21:30:25,856 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:30:25,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 192 events. 6/192 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 3 based on Foata normal form. 1/189 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2025-01-09 21:30:25,857 INFO L140 encePairwiseOnDemand]: 229/235 looper letters, 0 selfloop transitions, 0 changer transitions 159/159 dead transitions. [2025-01-09 21:30:25,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 159 transitions, 352 flow [2025-01-09 21:30:25,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:25,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:25,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 554 transitions. [2025-01-09 21:30:25,859 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7858156028368795 [2025-01-09 21:30:25,859 INFO L175 Difference]: Start difference. First operand has 163 places, 160 transitions, 326 flow. Second operand 3 states and 554 transitions. [2025-01-09 21:30:25,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 159 transitions, 352 flow [2025-01-09 21:30:25,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 159 transitions, 351 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:30:25,863 INFO L231 Difference]: Finished difference. Result has 161 places, 0 transitions, 0 flow [2025-01-09 21:30:25,863 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=161, PETRI_TRANSITIONS=0} [2025-01-09 21:30:25,864 INFO L279 CegarLoopForPetriNet]: 216 programPoint places, -55 predicate places. [2025-01-09 21:30:25,865 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 0 transitions, 0 flow [2025-01-09 21:30:25,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:25,867 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (89 of 90 remaining) [2025-01-09 21:30:25,868 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (88 of 90 remaining) [2025-01-09 21:30:25,868 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (87 of 90 remaining) [2025-01-09 21:30:25,868 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (86 of 90 remaining) [2025-01-09 21:30:25,868 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (85 of 90 remaining) [2025-01-09 21:30:25,868 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (84 of 90 remaining) [2025-01-09 21:30:25,868 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (83 of 90 remaining) [2025-01-09 21:30:25,868 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (82 of 90 remaining) [2025-01-09 21:30:25,869 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (81 of 90 remaining) [2025-01-09 21:30:25,869 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (80 of 90 remaining) [2025-01-09 21:30:25,869 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (79 of 90 remaining) [2025-01-09 21:30:25,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (78 of 90 remaining) [2025-01-09 21:30:25,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (77 of 90 remaining) [2025-01-09 21:30:25,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (76 of 90 remaining) [2025-01-09 21:30:25,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (75 of 90 remaining) [2025-01-09 21:30:25,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (74 of 90 remaining) [2025-01-09 21:30:25,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (73 of 90 remaining) [2025-01-09 21:30:25,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (72 of 90 remaining) [2025-01-09 21:30:25,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (71 of 90 remaining) [2025-01-09 21:30:25,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (70 of 90 remaining) [2025-01-09 21:30:25,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (69 of 90 remaining) [2025-01-09 21:30:25,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (68 of 90 remaining) [2025-01-09 21:30:25,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (67 of 90 remaining) [2025-01-09 21:30:25,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (66 of 90 remaining) [2025-01-09 21:30:25,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (65 of 90 remaining) [2025-01-09 21:30:25,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (64 of 90 remaining) [2025-01-09 21:30:25,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (63 of 90 remaining) [2025-01-09 21:30:25,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (62 of 90 remaining) [2025-01-09 21:30:25,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (61 of 90 remaining) [2025-01-09 21:30:25,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (60 of 90 remaining) [2025-01-09 21:30:25,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (59 of 90 remaining) [2025-01-09 21:30:25,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (58 of 90 remaining) [2025-01-09 21:30:25,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (57 of 90 remaining) [2025-01-09 21:30:25,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (56 of 90 remaining) [2025-01-09 21:30:25,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (55 of 90 remaining) [2025-01-09 21:30:25,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (54 of 90 remaining) [2025-01-09 21:30:25,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (53 of 90 remaining) [2025-01-09 21:30:25,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (52 of 90 remaining) [2025-01-09 21:30:25,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (51 of 90 remaining) [2025-01-09 21:30:25,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (50 of 90 remaining) [2025-01-09 21:30:25,875 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (49 of 90 remaining) [2025-01-09 21:30:25,875 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (48 of 90 remaining) [2025-01-09 21:30:25,875 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (47 of 90 remaining) [2025-01-09 21:30:25,875 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (46 of 90 remaining) [2025-01-09 21:30:25,875 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (45 of 90 remaining) [2025-01-09 21:30:25,875 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (44 of 90 remaining) [2025-01-09 21:30:25,875 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (43 of 90 remaining) [2025-01-09 21:30:25,875 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (42 of 90 remaining) [2025-01-09 21:30:25,875 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (41 of 90 remaining) [2025-01-09 21:30:25,876 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (40 of 90 remaining) [2025-01-09 21:30:25,876 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (39 of 90 remaining) [2025-01-09 21:30:25,876 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (38 of 90 remaining) [2025-01-09 21:30:25,876 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 90 remaining) [2025-01-09 21:30:25,876 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 90 remaining) [2025-01-09 21:30:25,876 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (35 of 90 remaining) [2025-01-09 21:30:25,876 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (34 of 90 remaining) [2025-01-09 21:30:25,876 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (33 of 90 remaining) [2025-01-09 21:30:25,876 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (32 of 90 remaining) [2025-01-09 21:30:25,877 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (31 of 90 remaining) [2025-01-09 21:30:25,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (30 of 90 remaining) [2025-01-09 21:30:25,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (29 of 90 remaining) [2025-01-09 21:30:25,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (28 of 90 remaining) [2025-01-09 21:30:25,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (27 of 90 remaining) [2025-01-09 21:30:25,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (26 of 90 remaining) [2025-01-09 21:30:25,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (25 of 90 remaining) [2025-01-09 21:30:25,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (24 of 90 remaining) [2025-01-09 21:30:25,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (23 of 90 remaining) [2025-01-09 21:30:25,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (22 of 90 remaining) [2025-01-09 21:30:25,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (21 of 90 remaining) [2025-01-09 21:30:25,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (20 of 90 remaining) [2025-01-09 21:30:25,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (19 of 90 remaining) [2025-01-09 21:30:25,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (18 of 90 remaining) [2025-01-09 21:30:25,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (17 of 90 remaining) [2025-01-09 21:30:25,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (16 of 90 remaining) [2025-01-09 21:30:25,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (15 of 90 remaining) [2025-01-09 21:30:25,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (14 of 90 remaining) [2025-01-09 21:30:25,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (13 of 90 remaining) [2025-01-09 21:30:25,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (12 of 90 remaining) [2025-01-09 21:30:25,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (11 of 90 remaining) [2025-01-09 21:30:25,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (10 of 90 remaining) [2025-01-09 21:30:25,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (9 of 90 remaining) [2025-01-09 21:30:25,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (8 of 90 remaining) [2025-01-09 21:30:25,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (7 of 90 remaining) [2025-01-09 21:30:25,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (6 of 90 remaining) [2025-01-09 21:30:25,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (5 of 90 remaining) [2025-01-09 21:30:25,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (4 of 90 remaining) [2025-01-09 21:30:25,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (3 of 90 remaining) [2025-01-09 21:30:25,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (2 of 90 remaining) [2025-01-09 21:30:25,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (1 of 90 remaining) [2025-01-09 21:30:25,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (0 of 90 remaining) [2025-01-09 21:30:25,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:30:25,882 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:25,886 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:30:25,887 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:30:25,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:30:25 BasicIcfg [2025-01-09 21:30:25,893 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:30:25,893 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:30:25,893 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:30:25,893 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:30:25,894 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:30:23" (3/4) ... [2025-01-09 21:30:25,895 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:30:25,896 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:30:25,896 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:30:25,900 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-01-09 21:30:25,900 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:30:25,900 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:30:25,900 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:30:25,955 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:30:25,955 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:30:25,955 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:30:25,955 INFO L158 Benchmark]: Toolchain (without parser) took 3632.83ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 123.5MB in the beginning and 219.4MB in the end (delta: -95.9MB). Peak memory consumption was 123.7MB. Max. memory is 16.1GB. [2025-01-09 21:30:25,956 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:30:25,956 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.85ms. Allocated memory is still 167.8MB. Free memory was 123.5MB in the beginning and 110.8MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:30:25,956 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.59ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 108.3MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:30:25,956 INFO L158 Benchmark]: Boogie Preprocessor took 42.78ms. Allocated memory is still 167.8MB. Free memory was 108.3MB in the beginning and 106.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:30:25,956 INFO L158 Benchmark]: RCFGBuilder took 1134.39ms. Allocated memory is still 167.8MB. Free memory was 106.6MB in the beginning and 96.8MB in the end (delta: 9.8MB). Peak memory consumption was 88.3MB. Max. memory is 16.1GB. [2025-01-09 21:30:25,956 INFO L158 Benchmark]: TraceAbstraction took 2105.32ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 96.8MB in the beginning and 226.1MB in the end (delta: -129.3MB). Peak memory consumption was 90.0MB. Max. memory is 16.1GB. [2025-01-09 21:30:25,957 INFO L158 Benchmark]: Witness Printer took 61.83ms. Allocated memory is still 385.9MB. Free memory was 226.1MB in the beginning and 219.4MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:30:25,958 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.18ms. Allocated memory is still 201.3MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 239.85ms. Allocated memory is still 167.8MB. Free memory was 123.5MB in the beginning and 110.8MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.59ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 108.3MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.78ms. Allocated memory is still 167.8MB. Free memory was 108.3MB in the beginning and 106.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1134.39ms. Allocated memory is still 167.8MB. Free memory was 106.6MB in the beginning and 96.8MB in the end (delta: 9.8MB). Peak memory consumption was 88.3MB. Max. memory is 16.1GB. * TraceAbstraction took 2105.32ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 96.8MB in the beginning and 226.1MB in the end (delta: -129.3MB). Peak memory consumption was 90.0MB. Max. memory is 16.1GB. * Witness Printer took 61.83ms. Allocated memory is still 385.9MB. Free memory was 226.1MB in the beginning and 219.4MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: 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: 56]: 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: 56]: 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: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 278 locations, 90 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: 2.0s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 114 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31 mSDsluCounter, 23 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 270 IncrementalHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 23 mSDtfsCounter, 270 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=438occurred in iteration=0, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 872 NumberOfCodeBlocks, 872 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 860 ConstructedInterpolants, 0 QuantifiedInterpolants, 884 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 52 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:30:25,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE