./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/mult-flipped-dist.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/mult-flipped-dist.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 7cfd33ca5f647adf12592c5e71401ab9da35a49d8f2ec6d0757ea2cc237974cc --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:31:55,771 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:31:55,806 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:31:55,810 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:31:55,810 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:31:55,828 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:31:55,829 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:31:55,829 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:31:55,829 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:31:55,829 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:31:55,829 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:31:55,830 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:31:55,830 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:31:55,830 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:31:55,830 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:31:55,830 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:31:55,830 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:31:55,830 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:31:55,830 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:31:55,830 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:31:55,830 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:31:55,830 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:31:55,830 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:31:55,830 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:31:55,830 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:31:55,830 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:31:55,831 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:31:55,831 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:31:55,831 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:31:55,831 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:31:55,831 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:31:55,831 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:31:55,831 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:31:55,831 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:31:55,831 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:31:55,831 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:31:55,831 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:31:55,831 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:31:55,831 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:31:55,832 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:31:55,832 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:31:55,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:31:55,832 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:31:55,832 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:31:55,832 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:31:55,832 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:31:55,832 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 -> 7cfd33ca5f647adf12592c5e71401ab9da35a49d8f2ec6d0757ea2cc237974cc [2025-01-09 21:31:56,027 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:31:56,032 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:31:56,033 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:31:56,034 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:31:56,034 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:31:56,037 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/mult-flipped-dist.wvr.c [2025-01-09 21:31:57,131 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/315a1d7c0/9954e474b822473a84765f001930ecd5/FLAGedbf9dcb4 [2025-01-09 21:31:57,375 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:31:57,375 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/mult-flipped-dist.wvr.c [2025-01-09 21:31:57,399 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/315a1d7c0/9954e474b822473a84765f001930ecd5/FLAGedbf9dcb4 [2025-01-09 21:31:57,713 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/315a1d7c0/9954e474b822473a84765f001930ecd5 [2025-01-09 21:31:57,715 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:31:57,716 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:31:57,717 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:31:57,717 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:31:57,721 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:31:57,723 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:31:57" (1/1) ... [2025-01-09 21:31:57,724 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c12a219 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:57, skipping insertion in model container [2025-01-09 21:31:57,724 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:31:57" (1/1) ... [2025-01-09 21:31:57,739 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:31:57,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:31:57,887 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:31:57,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:31:57,912 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:31:57,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:57 WrapperNode [2025-01-09 21:31:57,913 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:31:57,913 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:31:57,913 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:31:57,913 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:31:57,917 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:31:57" (1/1) ... [2025-01-09 21:31:57,922 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:31:57" (1/1) ... [2025-01-09 21:31:57,931 INFO L138 Inliner]: procedures = 21, calls = 11, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2025-01-09 21:31:57,931 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:31:57,932 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:31:57,932 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:31:57,932 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:31:57,936 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:57" (1/1) ... [2025-01-09 21:31:57,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:57" (1/1) ... [2025-01-09 21:31:57,937 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:57" (1/1) ... [2025-01-09 21:31:57,937 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:57" (1/1) ... [2025-01-09 21:31:57,941 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:57" (1/1) ... [2025-01-09 21:31:57,942 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:57" (1/1) ... [2025-01-09 21:31:57,944 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:57" (1/1) ... [2025-01-09 21:31:57,946 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:57" (1/1) ... [2025-01-09 21:31:57,946 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:57" (1/1) ... [2025-01-09 21:31:57,947 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:31:57,951 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:31:57,951 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:31:57,951 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:31:57,952 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:57" (1/1) ... [2025-01-09 21:31:57,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:31:57,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:31:57,986 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:31:57,990 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:31:58,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:31:58,010 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:31:58,010 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:31:58,010 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:31:58,010 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:31:58,010 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:31:58,011 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:31:58,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:31:58,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:31:58,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:31:58,013 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:31:58,097 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:31:58,103 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:31:58,303 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:31:58,305 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:31:58,320 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:31:58,321 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-09 21:31:58,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:31:58 BoogieIcfgContainer [2025-01-09 21:31:58,322 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:31:58,324 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:31:58,324 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:31:58,329 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:31:58,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:31:57" (1/3) ... [2025-01-09 21:31:58,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54573d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:31:58, skipping insertion in model container [2025-01-09 21:31:58,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:57" (2/3) ... [2025-01-09 21:31:58,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54573d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:31:58, skipping insertion in model container [2025-01-09 21:31:58,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:31:58" (3/3) ... [2025-01-09 21:31:58,332 INFO L128 eAbstractionObserver]: Analyzing ICFG mult-flipped-dist.wvr.c [2025-01-09 21:31:58,347 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:31:58,349 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mult-flipped-dist.wvr.c that has 4 procedures, 165 locations, 1 initial locations, 3 loop locations, and 19 error locations. [2025-01-09 21:31:58,349 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:31:58,424 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 21:31:58,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 171 transitions, 363 flow [2025-01-09 21:31:58,496 INFO L124 PetriNetUnfolderBase]: 7/168 cut-off events. [2025-01-09 21:31:58,498 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:31:58,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 168 events. 7/168 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs, 0 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 112. Up to 2 conditions per place. [2025-01-09 21:31:58,502 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 171 transitions, 363 flow [2025-01-09 21:31:58,506 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 155 places, 151 transitions, 320 flow [2025-01-09 21:31:58,511 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:31:58,523 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;@32521ae5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:31:58,525 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2025-01-09 21:31:58,532 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:31:58,532 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2025-01-09 21:31:58,533 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:31:58,533 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:58,533 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] [2025-01-09 21:31:58,534 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-01-09 21:31:58,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:58,538 INFO L85 PathProgramCache]: Analyzing trace with hash -574957363, now seen corresponding path program 1 times [2025-01-09 21:31:58,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:58,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466805370] [2025-01-09 21:31:58,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:58,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:58,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 21:31:58,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 21:31:58,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:58,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:58,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:58,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:58,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466805370] [2025-01-09 21:31:58,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466805370] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:58,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:58,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:58,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336640898] [2025-01-09 21:31:58,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:58,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:58,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:58,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:58,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:58,706 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 171 [2025-01-09 21:31:58,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 151 transitions, 320 flow. Second operand has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:58,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:58,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 171 [2025-01-09 21:31:58,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:58,783 INFO L124 PetriNetUnfolderBase]: 10/216 cut-off events. [2025-01-09 21:31:58,783 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-01-09 21:31:58,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 216 events. 10/216 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 676 event pairs, 5 based on Foata normal form. 16/200 useless extension candidates. Maximal degree in co-relation 175. Up to 22 conditions per place. [2025-01-09 21:31:58,787 INFO L140 encePairwiseOnDemand]: 165/171 looper letters, 11 selfloop transitions, 2 changer transitions 0/147 dead transitions. [2025-01-09 21:31:58,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 147 transitions, 338 flow [2025-01-09 21:31:58,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:58,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:58,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions. [2025-01-09 21:31:58,797 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9161793372319688 [2025-01-09 21:31:58,799 INFO L175 Difference]: Start difference. First operand has 155 places, 151 transitions, 320 flow. Second operand 3 states and 470 transitions. [2025-01-09 21:31:58,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 147 transitions, 338 flow [2025-01-09 21:31:58,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 147 transitions, 326 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 21:31:58,805 INFO L231 Difference]: Finished difference. Result has 150 places, 147 transitions, 304 flow [2025-01-09 21:31:58,807 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=304, PETRI_PLACES=150, PETRI_TRANSITIONS=147} [2025-01-09 21:31:58,810 INFO L279 CegarLoopForPetriNet]: 155 programPoint places, -5 predicate places. [2025-01-09 21:31:58,810 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 147 transitions, 304 flow [2025-01-09 21:31:58,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:58,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:58,810 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] [2025-01-09 21:31:58,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:31:58,811 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-01-09 21:31:58,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:58,812 INFO L85 PathProgramCache]: Analyzing trace with hash -411357764, now seen corresponding path program 1 times [2025-01-09 21:31:58,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:58,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211937306] [2025-01-09 21:31:58,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:58,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:58,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 21:31:58,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 21:31:58,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:58,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:58,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:58,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:58,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211937306] [2025-01-09 21:31:58,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211937306] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:58,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:58,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:58,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464722330] [2025-01-09 21:31:58,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:58,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:58,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:58,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:58,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:58,877 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 171 [2025-01-09 21:31:58,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 147 transitions, 304 flow. Second operand has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:58,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:58,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 171 [2025-01-09 21:31:58,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:58,935 INFO L124 PetriNetUnfolderBase]: 11/188 cut-off events. [2025-01-09 21:31:58,936 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:31:58,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 188 events. 11/188 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 500 event pairs, 7 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 193. Up to 25 conditions per place. [2025-01-09 21:31:58,938 INFO L140 encePairwiseOnDemand]: 168/171 looper letters, 11 selfloop transitions, 2 changer transitions 0/146 dead transitions. [2025-01-09 21:31:58,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 146 transitions, 328 flow [2025-01-09 21:31:58,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:58,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:58,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions. [2025-01-09 21:31:58,940 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9103313840155945 [2025-01-09 21:31:58,940 INFO L175 Difference]: Start difference. First operand has 150 places, 147 transitions, 304 flow. Second operand 3 states and 467 transitions. [2025-01-09 21:31:58,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 146 transitions, 328 flow [2025-01-09 21:31:58,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 146 transitions, 324 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:58,942 INFO L231 Difference]: Finished difference. Result has 149 places, 146 transitions, 302 flow [2025-01-09 21:31:58,943 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=302, PETRI_PLACES=149, PETRI_TRANSITIONS=146} [2025-01-09 21:31:58,943 INFO L279 CegarLoopForPetriNet]: 155 programPoint places, -6 predicate places. [2025-01-09 21:31:58,943 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 146 transitions, 302 flow [2025-01-09 21:31:58,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:58,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:58,944 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] [2025-01-09 21:31:58,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:31:58,944 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-01-09 21:31:58,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:58,945 INFO L85 PathProgramCache]: Analyzing trace with hash 874652847, now seen corresponding path program 1 times [2025-01-09 21:31:58,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:58,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237191744] [2025-01-09 21:31:58,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:58,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:58,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 21:31:58,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 21:31:58,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:58,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:59,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:59,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:59,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237191744] [2025-01-09 21:31:59,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237191744] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:59,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:59,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:59,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350684627] [2025-01-09 21:31:59,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:59,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:59,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:59,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:59,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:59,027 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 171 [2025-01-09 21:31:59,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 146 transitions, 302 flow. Second operand has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:59,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:59,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 171 [2025-01-09 21:31:59,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:59,077 INFO L124 PetriNetUnfolderBase]: 30/404 cut-off events. [2025-01-09 21:31:59,077 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:31:59,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 469 conditions, 404 events. 30/404 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1966 event pairs, 15 based on Foata normal form. 0/329 useless extension candidates. Maximal degree in co-relation 432. Up to 52 conditions per place. [2025-01-09 21:31:59,080 INFO L140 encePairwiseOnDemand]: 168/171 looper letters, 12 selfloop transitions, 2 changer transitions 0/145 dead transitions. [2025-01-09 21:31:59,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 145 transitions, 328 flow [2025-01-09 21:31:59,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:59,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:59,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 465 transitions. [2025-01-09 21:31:59,081 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9064327485380117 [2025-01-09 21:31:59,081 INFO L175 Difference]: Start difference. First operand has 149 places, 146 transitions, 302 flow. Second operand 3 states and 465 transitions. [2025-01-09 21:31:59,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 145 transitions, 328 flow [2025-01-09 21:31:59,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 145 transitions, 324 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:59,084 INFO L231 Difference]: Finished difference. Result has 148 places, 145 transitions, 300 flow [2025-01-09 21:31:59,084 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=300, PETRI_PLACES=148, PETRI_TRANSITIONS=145} [2025-01-09 21:31:59,084 INFO L279 CegarLoopForPetriNet]: 155 programPoint places, -7 predicate places. [2025-01-09 21:31:59,085 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 145 transitions, 300 flow [2025-01-09 21:31:59,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:59,085 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:59,085 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] [2025-01-09 21:31:59,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:31:59,085 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-01-09 21:31:59,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:59,086 INFO L85 PathProgramCache]: Analyzing trace with hash 794100236, now seen corresponding path program 1 times [2025-01-09 21:31:59,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:59,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814677214] [2025-01-09 21:31:59,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:59,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:59,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 21:31:59,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 21:31:59,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:59,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:59,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:59,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:59,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814677214] [2025-01-09 21:31:59,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814677214] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:59,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:59,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:59,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204824178] [2025-01-09 21:31:59,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:59,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:59,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:59,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:59,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:59,133 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 171 [2025-01-09 21:31:59,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 145 transitions, 300 flow. Second operand has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:59,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:59,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 171 [2025-01-09 21:31:59,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:59,199 INFO L124 PetriNetUnfolderBase]: 97/835 cut-off events. [2025-01-09 21:31:59,199 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-01-09 21:31:59,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1003 conditions, 835 events. 97/835 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5765 event pairs, 34 based on Foata normal form. 0/684 useless extension candidates. Maximal degree in co-relation 959. Up to 146 conditions per place. [2025-01-09 21:31:59,204 INFO L140 encePairwiseOnDemand]: 165/171 looper letters, 15 selfloop transitions, 3 changer transitions 0/147 dead transitions. [2025-01-09 21:31:59,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 147 transitions, 342 flow [2025-01-09 21:31:59,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:59,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:59,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions. [2025-01-09 21:31:59,205 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9181286549707602 [2025-01-09 21:31:59,205 INFO L175 Difference]: Start difference. First operand has 148 places, 145 transitions, 300 flow. Second operand 3 states and 471 transitions. [2025-01-09 21:31:59,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 147 transitions, 342 flow [2025-01-09 21:31:59,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 147 transitions, 338 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:59,208 INFO L231 Difference]: Finished difference. Result has 146 places, 145 transitions, 311 flow [2025-01-09 21:31:59,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=311, PETRI_PLACES=146, PETRI_TRANSITIONS=145} [2025-01-09 21:31:59,208 INFO L279 CegarLoopForPetriNet]: 155 programPoint places, -9 predicate places. [2025-01-09 21:31:59,209 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 145 transitions, 311 flow [2025-01-09 21:31:59,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:59,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:59,209 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] [2025-01-09 21:31:59,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:31:59,209 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-01-09 21:31:59,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:59,210 INFO L85 PathProgramCache]: Analyzing trace with hash 360669550, now seen corresponding path program 1 times [2025-01-09 21:31:59,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:59,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399225996] [2025-01-09 21:31:59,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:59,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:59,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 21:31:59,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 21:31:59,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:59,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:59,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:59,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:59,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399225996] [2025-01-09 21:31:59,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399225996] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:59,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:59,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:59,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940997183] [2025-01-09 21:31:59,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:59,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:59,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:59,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:59,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:59,258 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 171 [2025-01-09 21:31:59,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 145 transitions, 311 flow. Second operand has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:59,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:59,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 171 [2025-01-09 21:31:59,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:59,320 INFO L124 PetriNetUnfolderBase]: 31/327 cut-off events. [2025-01-09 21:31:59,320 INFO L125 PetriNetUnfolderBase]: For 3/7 co-relation queries the response was YES. [2025-01-09 21:31:59,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401 conditions, 327 events. 31/327 cut-off events. For 3/7 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1368 event pairs, 4 based on Foata normal form. 1/280 useless extension candidates. Maximal degree in co-relation 259. Up to 32 conditions per place. [2025-01-09 21:31:59,322 INFO L140 encePairwiseOnDemand]: 166/171 looper letters, 10 selfloop transitions, 3 changer transitions 0/145 dead transitions. [2025-01-09 21:31:59,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 145 transitions, 339 flow [2025-01-09 21:31:59,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:59,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:59,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2025-01-09 21:31:59,326 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9239766081871345 [2025-01-09 21:31:59,327 INFO L175 Difference]: Start difference. First operand has 146 places, 145 transitions, 311 flow. Second operand 3 states and 474 transitions. [2025-01-09 21:31:59,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 145 transitions, 339 flow [2025-01-09 21:31:59,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 145 transitions, 339 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:31:59,353 INFO L231 Difference]: Finished difference. Result has 146 places, 143 transitions, 313 flow [2025-01-09 21:31:59,354 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=313, PETRI_PLACES=146, PETRI_TRANSITIONS=143} [2025-01-09 21:31:59,356 INFO L279 CegarLoopForPetriNet]: 155 programPoint places, -9 predicate places. [2025-01-09 21:31:59,356 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 143 transitions, 313 flow [2025-01-09 21:31:59,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:59,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:59,357 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] [2025-01-09 21:31:59,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:31:59,357 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-01-09 21:31:59,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:59,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1288900176, now seen corresponding path program 1 times [2025-01-09 21:31:59,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:59,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605000052] [2025-01-09 21:31:59,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:59,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:59,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 21:31:59,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 21:31:59,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:59,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:59,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:59,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:59,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605000052] [2025-01-09 21:31:59,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605000052] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:59,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:59,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:59,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586729451] [2025-01-09 21:31:59,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:59,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:59,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:59,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:59,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:59,449 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 171 [2025-01-09 21:31:59,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 143 transitions, 313 flow. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:59,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:59,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 171 [2025-01-09 21:31:59,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:59,532 INFO L124 PetriNetUnfolderBase]: 70/685 cut-off events. [2025-01-09 21:31:59,532 INFO L125 PetriNetUnfolderBase]: For 13/19 co-relation queries the response was YES. [2025-01-09 21:31:59,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 840 conditions, 685 events. 70/685 cut-off events. For 13/19 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3910 event pairs, 17 based on Foata normal form. 1/580 useless extension candidates. Maximal degree in co-relation 655. Up to 62 conditions per place. [2025-01-09 21:31:59,538 INFO L140 encePairwiseOnDemand]: 167/171 looper letters, 16 selfloop transitions, 2 changer transitions 0/148 dead transitions. [2025-01-09 21:31:59,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 148 transitions, 364 flow [2025-01-09 21:31:59,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:59,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:59,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2025-01-09 21:31:59,541 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9337231968810916 [2025-01-09 21:31:59,542 INFO L175 Difference]: Start difference. First operand has 146 places, 143 transitions, 313 flow. Second operand 3 states and 479 transitions. [2025-01-09 21:31:59,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 148 transitions, 364 flow [2025-01-09 21:31:59,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 148 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:59,544 INFO L231 Difference]: Finished difference. Result has 145 places, 143 transitions, 317 flow [2025-01-09 21:31:59,544 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=317, PETRI_PLACES=145, PETRI_TRANSITIONS=143} [2025-01-09 21:31:59,545 INFO L279 CegarLoopForPetriNet]: 155 programPoint places, -10 predicate places. [2025-01-09 21:31:59,546 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 143 transitions, 317 flow [2025-01-09 21:31:59,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:59,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:59,546 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] [2025-01-09 21:31:59,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:31:59,546 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-01-09 21:31:59,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:59,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1453404159, now seen corresponding path program 1 times [2025-01-09 21:31:59,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:59,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807108563] [2025-01-09 21:31:59,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:59,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:59,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 21:31:59,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 21:31:59,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:59,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:59,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:59,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:59,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807108563] [2025-01-09 21:31:59,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807108563] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:59,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:59,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:59,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513192342] [2025-01-09 21:31:59,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:59,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:59,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:59,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:59,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:59,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 171 [2025-01-09 21:31:59,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 143 transitions, 317 flow. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:59,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:59,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 171 [2025-01-09 21:31:59,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:59,649 INFO L124 PetriNetUnfolderBase]: 54/532 cut-off events. [2025-01-09 21:31:59,649 INFO L125 PetriNetUnfolderBase]: For 12/15 co-relation queries the response was YES. [2025-01-09 21:31:59,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 684 conditions, 532 events. 54/532 cut-off events. For 12/15 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2841 event pairs, 14 based on Foata normal form. 0/467 useless extension candidates. Maximal degree in co-relation 468. Up to 46 conditions per place. [2025-01-09 21:31:59,653 INFO L140 encePairwiseOnDemand]: 166/171 looper letters, 10 selfloop transitions, 3 changer transitions 0/143 dead transitions. [2025-01-09 21:31:59,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 143 transitions, 345 flow [2025-01-09 21:31:59,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:59,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:59,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2025-01-09 21:31:59,655 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9239766081871345 [2025-01-09 21:31:59,655 INFO L175 Difference]: Start difference. First operand has 145 places, 143 transitions, 317 flow. Second operand 3 states and 474 transitions. [2025-01-09 21:31:59,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 143 transitions, 345 flow [2025-01-09 21:31:59,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 143 transitions, 345 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:31:59,657 INFO L231 Difference]: Finished difference. Result has 145 places, 141 transitions, 319 flow [2025-01-09 21:31:59,657 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=319, PETRI_PLACES=145, PETRI_TRANSITIONS=141} [2025-01-09 21:31:59,657 INFO L279 CegarLoopForPetriNet]: 155 programPoint places, -10 predicate places. [2025-01-09 21:31:59,657 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 141 transitions, 319 flow [2025-01-09 21:31:59,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:59,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:59,658 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] [2025-01-09 21:31:59,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:31:59,658 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-01-09 21:31:59,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:59,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1950319117, now seen corresponding path program 1 times [2025-01-09 21:31:59,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:59,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515142808] [2025-01-09 21:31:59,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:59,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:59,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 21:31:59,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 21:31:59,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:59,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:59,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:59,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:59,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515142808] [2025-01-09 21:31:59,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515142808] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:59,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:59,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:59,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596195438] [2025-01-09 21:31:59,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:59,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:59,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:59,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:59,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:59,721 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 171 [2025-01-09 21:31:59,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 141 transitions, 319 flow. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:59,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:59,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 171 [2025-01-09 21:31:59,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:59,784 INFO L124 PetriNetUnfolderBase]: 48/493 cut-off events. [2025-01-09 21:31:59,784 INFO L125 PetriNetUnfolderBase]: For 4/12 co-relation queries the response was YES. [2025-01-09 21:31:59,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 647 conditions, 493 events. 48/493 cut-off events. For 4/12 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2477 event pairs, 16 based on Foata normal form. 1/436 useless extension candidates. Maximal degree in co-relation 486. Up to 47 conditions per place. [2025-01-09 21:31:59,788 INFO L140 encePairwiseOnDemand]: 168/171 looper letters, 12 selfloop transitions, 2 changer transitions 0/142 dead transitions. [2025-01-09 21:31:59,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 142 transitions, 351 flow [2025-01-09 21:31:59,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:59,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:59,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2025-01-09 21:31:59,789 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9239766081871345 [2025-01-09 21:31:59,789 INFO L175 Difference]: Start difference. First operand has 145 places, 141 transitions, 319 flow. Second operand 3 states and 474 transitions. [2025-01-09 21:31:59,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 142 transitions, 351 flow [2025-01-09 21:31:59,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 142 transitions, 345 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:59,792 INFO L231 Difference]: Finished difference. Result has 144 places, 140 transitions, 315 flow [2025-01-09 21:31:59,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=315, PETRI_PLACES=144, PETRI_TRANSITIONS=140} [2025-01-09 21:31:59,793 INFO L279 CegarLoopForPetriNet]: 155 programPoint places, -11 predicate places. [2025-01-09 21:31:59,793 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 140 transitions, 315 flow [2025-01-09 21:31:59,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:59,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:59,794 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:59,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:31:59,794 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-01-09 21:31:59,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:59,795 INFO L85 PathProgramCache]: Analyzing trace with hash -857011517, now seen corresponding path program 1 times [2025-01-09 21:31:59,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:59,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388117888] [2025-01-09 21:31:59,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:59,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:59,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 21:31:59,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 21:31:59,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:59,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:59,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:59,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:59,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388117888] [2025-01-09 21:31:59,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388117888] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:59,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:59,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:59,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701949932] [2025-01-09 21:31:59,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:59,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:59,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:59,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:59,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:59,859 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 171 [2025-01-09 21:31:59,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 140 transitions, 315 flow. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:59,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:59,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 171 [2025-01-09 21:31:59,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:59,962 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([425] L58-9-->L58-2: Formula: (= |v_#race~c~0_7| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_7|} AuxVars[] AssignedVars[#race~c~0][94], [113#L58-2true, 205#(= |#race~b~0| 0), Black: 193#true, 200#true, 195#(= |#race~a~0| 0), 79#L50-2true, 149#L42-2true, Black: 186#true, 142#L75-4true, 188#(= |#race~c~0| 0)]) [2025-01-09 21:31:59,963 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2025-01-09 21:31:59,963 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2025-01-09 21:31:59,963 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-01-09 21:31:59,963 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:31:59,973 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([425] L58-9-->L58-2: Formula: (= |v_#race~c~0_7| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_7|} AuxVars[] AssignedVars[#race~c~0][94], [113#L58-2true, 139#L76-1true, 205#(= |#race~b~0| 0), Black: 193#true, 200#true, 195#(= |#race~a~0| 0), 79#L50-2true, Black: 186#true, 188#(= |#race~c~0| 0)]) [2025-01-09 21:31:59,973 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2025-01-09 21:31:59,973 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-01-09 21:31:59,973 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-01-09 21:31:59,973 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-01-09 21:31:59,973 INFO L124 PetriNetUnfolderBase]: 140/946 cut-off events. [2025-01-09 21:31:59,973 INFO L125 PetriNetUnfolderBase]: For 28/32 co-relation queries the response was YES. [2025-01-09 21:31:59,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1236 conditions, 946 events. 140/946 cut-off events. For 28/32 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 6425 event pairs, 21 based on Foata normal form. 1/834 useless extension candidates. Maximal degree in co-relation 974. Up to 146 conditions per place. [2025-01-09 21:31:59,979 INFO L140 encePairwiseOnDemand]: 167/171 looper letters, 15 selfloop transitions, 2 changer transitions 0/144 dead transitions. [2025-01-09 21:31:59,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 144 transitions, 361 flow [2025-01-09 21:31:59,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:59,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:59,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 478 transitions. [2025-01-09 21:31:59,980 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9317738791423001 [2025-01-09 21:31:59,980 INFO L175 Difference]: Start difference. First operand has 144 places, 140 transitions, 315 flow. Second operand 3 states and 478 transitions. [2025-01-09 21:31:59,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 144 transitions, 361 flow [2025-01-09 21:31:59,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 144 transitions, 357 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:59,982 INFO L231 Difference]: Finished difference. Result has 143 places, 140 transitions, 321 flow [2025-01-09 21:31:59,982 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=321, PETRI_PLACES=143, PETRI_TRANSITIONS=140} [2025-01-09 21:31:59,982 INFO L279 CegarLoopForPetriNet]: 155 programPoint places, -12 predicate places. [2025-01-09 21:31:59,982 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 140 transitions, 321 flow [2025-01-09 21:31:59,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:59,983 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:59,983 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] [2025-01-09 21:31:59,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:31:59,983 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-01-09 21:31:59,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:59,983 INFO L85 PathProgramCache]: Analyzing trace with hash -136180730, now seen corresponding path program 1 times [2025-01-09 21:31:59,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:59,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23567103] [2025-01-09 21:31:59,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:59,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:59,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 21:31:59,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 21:31:59,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:59,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:00,010 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:32:00,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:00,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23567103] [2025-01-09 21:32:00,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23567103] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:00,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:00,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:00,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214724694] [2025-01-09 21:32:00,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:00,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:00,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:00,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:00,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:00,024 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 171 [2025-01-09 21:32:00,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 140 transitions, 321 flow. Second operand has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 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:32:00,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:00,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 171 [2025-01-09 21:32:00,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:00,095 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([425] L58-9-->L58-2: Formula: (= |v_#race~c~0_7| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_7|} AuxVars[] AssignedVars[#race~c~0][93], [113#L58-2true, 205#(= |#race~b~0| 0), Black: 193#true, 195#(= |#race~a~0| 0), 79#L50-2true, 207#true, 149#L42-2true, Black: 186#true, 142#L75-4true, Black: 203#true, 188#(= |#race~c~0| 0)]) [2025-01-09 21:32:00,095 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2025-01-09 21:32:00,095 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-01-09 21:32:00,095 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2025-01-09 21:32:00,095 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:32:00,129 INFO L124 PetriNetUnfolderBase]: 124/881 cut-off events. [2025-01-09 21:32:00,129 INFO L125 PetriNetUnfolderBase]: For 27/33 co-relation queries the response was YES. [2025-01-09 21:32:00,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1211 conditions, 881 events. 124/881 cut-off events. For 27/33 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 5730 event pairs, 42 based on Foata normal form. 0/800 useless extension candidates. Maximal degree in co-relation 898. Up to 101 conditions per place. [2025-01-09 21:32:00,133 INFO L140 encePairwiseOnDemand]: 168/171 looper letters, 12 selfloop transitions, 2 changer transitions 0/141 dead transitions. [2025-01-09 21:32:00,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 141 transitions, 353 flow [2025-01-09 21:32:00,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:00,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:00,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2025-01-09 21:32:00,135 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9239766081871345 [2025-01-09 21:32:00,135 INFO L175 Difference]: Start difference. First operand has 143 places, 140 transitions, 321 flow. Second operand 3 states and 474 transitions. [2025-01-09 21:32:00,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 141 transitions, 353 flow [2025-01-09 21:32:00,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 141 transitions, 353 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:32:00,136 INFO L231 Difference]: Finished difference. Result has 144 places, 139 transitions, 323 flow [2025-01-09 21:32:00,137 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=323, PETRI_PLACES=144, PETRI_TRANSITIONS=139} [2025-01-09 21:32:00,137 INFO L279 CegarLoopForPetriNet]: 155 programPoint places, -11 predicate places. [2025-01-09 21:32:00,137 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 139 transitions, 323 flow [2025-01-09 21:32:00,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 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:32:00,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:00,137 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] [2025-01-09 21:32:00,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:32:00,138 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-01-09 21:32:00,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:00,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1106275265, now seen corresponding path program 1 times [2025-01-09 21:32:00,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:00,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929650875] [2025-01-09 21:32:00,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:00,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:00,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 21:32:00,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 21:32:00,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:00,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:00,174 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:32:00,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:00,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929650875] [2025-01-09 21:32:00,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929650875] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:00,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:00,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:00,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142775732] [2025-01-09 21:32:00,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:00,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:00,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:00,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:00,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:00,184 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 171 [2025-01-09 21:32:00,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 139 transitions, 323 flow. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 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:32:00,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:00,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 171 [2025-01-09 21:32:00,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:00,239 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([425] L58-9-->L58-2: Formula: (= |v_#race~c~0_7| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_7|} AuxVars[] AssignedVars[#race~c~0][93], [113#L58-2true, 205#(= |#race~b~0| 0), Black: 193#true, 195#(= |#race~a~0| 0), 79#L50-2true, 210#true, 207#true, 149#L42-2true, Black: 186#true, 142#L75-4true, Black: 203#true, 188#(= |#race~c~0| 0)]) [2025-01-09 21:32:00,239 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2025-01-09 21:32:00,239 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2025-01-09 21:32:00,239 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:32:00,239 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-01-09 21:32:00,243 INFO L124 PetriNetUnfolderBase]: 98/652 cut-off events. [2025-01-09 21:32:00,244 INFO L125 PetriNetUnfolderBase]: For 31/47 co-relation queries the response was YES. [2025-01-09 21:32:00,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 922 conditions, 652 events. 98/652 cut-off events. For 31/47 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3818 event pairs, 14 based on Foata normal form. 6/607 useless extension candidates. Maximal degree in co-relation 750. Up to 64 conditions per place. [2025-01-09 21:32:00,248 INFO L140 encePairwiseOnDemand]: 166/171 looper letters, 8 selfloop transitions, 2 changer transitions 6/139 dead transitions. [2025-01-09 21:32:00,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 139 transitions, 349 flow [2025-01-09 21:32:00,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:00,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:00,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2025-01-09 21:32:00,249 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9220272904483431 [2025-01-09 21:32:00,249 INFO L175 Difference]: Start difference. First operand has 144 places, 139 transitions, 323 flow. Second operand 3 states and 473 transitions. [2025-01-09 21:32:00,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 139 transitions, 349 flow [2025-01-09 21:32:00,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 139 transitions, 345 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:00,252 INFO L231 Difference]: Finished difference. Result has 142 places, 131 transitions, 306 flow [2025-01-09 21:32:00,253 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=306, PETRI_PLACES=142, PETRI_TRANSITIONS=131} [2025-01-09 21:32:00,253 INFO L279 CegarLoopForPetriNet]: 155 programPoint places, -13 predicate places. [2025-01-09 21:32:00,253 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 131 transitions, 306 flow [2025-01-09 21:32:00,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 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:32:00,253 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:00,253 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:00,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:32:00,253 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-01-09 21:32:00,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:00,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1408678310, now seen corresponding path program 1 times [2025-01-09 21:32:00,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:00,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011726936] [2025-01-09 21:32:00,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:00,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:00,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:32:00,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:32:00,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:00,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:00,279 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:32:00,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:00,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011726936] [2025-01-09 21:32:00,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011726936] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:00,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:00,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:00,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586344339] [2025-01-09 21:32:00,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:00,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:00,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:00,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:00,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:00,294 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 171 [2025-01-09 21:32:00,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 131 transitions, 306 flow. Second operand has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 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:32:00,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:00,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 171 [2025-01-09 21:32:00,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:00,350 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([425] L58-9-->L58-2: Formula: (= |v_#race~c~0_7| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_7|} AuxVars[] AssignedVars[#race~c~0][93], [113#L58-2true, 205#(= |#race~b~0| 0), Black: 193#true, 195#(= |#race~a~0| 0), 79#L50-2true, 210#true, 213#true, 149#L42-2true, Black: 186#true, 142#L75-4true, Black: 203#true, 188#(= |#race~c~0| 0)]) [2025-01-09 21:32:00,350 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2025-01-09 21:32:00,350 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:32:00,350 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2025-01-09 21:32:00,350 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-01-09 21:32:00,355 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([443] L59-6-->L59-7: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet5=|v_thread3Thread1of1ForFork0_#t~nondet5_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet5][123], [30#L59-7true, 205#(= |#race~b~0| 0), Black: 193#true, 90#L77true, 195#(= |#race~a~0| 0), 213#true, Black: 186#true, Black: 203#true, 188#(= |#race~c~0| 0), 212#(= |#race~x_3~0| 0)]) [2025-01-09 21:32:00,355 INFO L294 olderBase$Statistics]: this new event has 104 ancestors and is cut-off event [2025-01-09 21:32:00,355 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-01-09 21:32:00,355 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-01-09 21:32:00,355 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-01-09 21:32:00,356 INFO L124 PetriNetUnfolderBase]: 108/651 cut-off events. [2025-01-09 21:32:00,356 INFO L125 PetriNetUnfolderBase]: For 59/83 co-relation queries the response was YES. [2025-01-09 21:32:00,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 951 conditions, 651 events. 108/651 cut-off events. For 59/83 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3818 event pairs, 29 based on Foata normal form. 1/604 useless extension candidates. Maximal degree in co-relation 701. Up to 80 conditions per place. [2025-01-09 21:32:00,359 INFO L140 encePairwiseOnDemand]: 168/171 looper letters, 0 selfloop transitions, 0 changer transitions 132/132 dead transitions. [2025-01-09 21:32:00,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 132 transitions, 334 flow [2025-01-09 21:32:00,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:00,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:00,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions. [2025-01-09 21:32:00,361 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9200779727095516 [2025-01-09 21:32:00,361 INFO L175 Difference]: Start difference. First operand has 142 places, 131 transitions, 306 flow. Second operand 3 states and 472 transitions. [2025-01-09 21:32:00,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 132 transitions, 334 flow [2025-01-09 21:32:00,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 132 transitions, 330 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:00,363 INFO L231 Difference]: Finished difference. Result has 135 places, 0 transitions, 0 flow [2025-01-09 21:32:00,363 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=135, PETRI_TRANSITIONS=0} [2025-01-09 21:32:00,363 INFO L279 CegarLoopForPetriNet]: 155 programPoint places, -20 predicate places. [2025-01-09 21:32:00,363 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 0 transitions, 0 flow [2025-01-09 21:32:00,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 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:32:00,366 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (34 of 35 remaining) [2025-01-09 21:32:00,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (33 of 35 remaining) [2025-01-09 21:32:00,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (32 of 35 remaining) [2025-01-09 21:32:00,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (31 of 35 remaining) [2025-01-09 21:32:00,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (30 of 35 remaining) [2025-01-09 21:32:00,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (29 of 35 remaining) [2025-01-09 21:32:00,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (28 of 35 remaining) [2025-01-09 21:32:00,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (27 of 35 remaining) [2025-01-09 21:32:00,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (26 of 35 remaining) [2025-01-09 21:32:00,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (25 of 35 remaining) [2025-01-09 21:32:00,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (24 of 35 remaining) [2025-01-09 21:32:00,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (23 of 35 remaining) [2025-01-09 21:32:00,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (22 of 35 remaining) [2025-01-09 21:32:00,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (21 of 35 remaining) [2025-01-09 21:32:00,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (20 of 35 remaining) [2025-01-09 21:32:00,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (19 of 35 remaining) [2025-01-09 21:32:00,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (18 of 35 remaining) [2025-01-09 21:32:00,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (17 of 35 remaining) [2025-01-09 21:32:00,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (16 of 35 remaining) [2025-01-09 21:32:00,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 35 remaining) [2025-01-09 21:32:00,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 35 remaining) [2025-01-09 21:32:00,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 35 remaining) [2025-01-09 21:32:00,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (12 of 35 remaining) [2025-01-09 21:32:00,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (11 of 35 remaining) [2025-01-09 21:32:00,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (10 of 35 remaining) [2025-01-09 21:32:00,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (9 of 35 remaining) [2025-01-09 21:32:00,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (8 of 35 remaining) [2025-01-09 21:32:00,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (7 of 35 remaining) [2025-01-09 21:32:00,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (6 of 35 remaining) [2025-01-09 21:32:00,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (5 of 35 remaining) [2025-01-09 21:32:00,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (4 of 35 remaining) [2025-01-09 21:32:00,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (3 of 35 remaining) [2025-01-09 21:32:00,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 35 remaining) [2025-01-09 21:32:00,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (1 of 35 remaining) [2025-01-09 21:32:00,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (0 of 35 remaining) [2025-01-09 21:32:00,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:32:00,369 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:00,373 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:32:00,373 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:32:00,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:32:00 BasicIcfg [2025-01-09 21:32:00,378 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:32:00,379 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:32:00,379 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:32:00,379 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:32:00,380 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:31:58" (3/4) ... [2025-01-09 21:32:00,381 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:32:00,385 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:32:00,385 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:32:00,385 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-09 21:32:00,387 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-01-09 21:32:00,387 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:32:00,388 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:32:00,388 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:32:00,457 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:32:00,457 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:32:00,457 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:32:00,458 INFO L158 Benchmark]: Toolchain (without parser) took 2741.92ms. Allocated memory was 167.8MB in the beginning and 411.0MB in the end (delta: 243.3MB). Free memory was 121.2MB in the beginning and 373.7MB in the end (delta: -252.6MB). Peak memory consumption was 86.0MB. Max. memory is 16.1GB. [2025-01-09 21:32:00,458 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 226.5MB. Free memory is still 146.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:32:00,458 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.79ms. Allocated memory is still 167.8MB. Free memory was 121.2MB in the beginning and 109.8MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:32:00,458 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.16ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 108.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:32:00,458 INFO L158 Benchmark]: Boogie Preprocessor took 18.61ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 107.7MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:32:00,459 INFO L158 Benchmark]: RCFGBuilder took 370.60ms. Allocated memory is still 167.8MB. Free memory was 107.7MB in the beginning and 92.1MB in the end (delta: 15.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:32:00,459 INFO L158 Benchmark]: TraceAbstraction took 2054.18ms. Allocated memory is still 167.8MB. Free memory was 91.0MB in the beginning and 48.4MB in the end (delta: 42.6MB). Peak memory consumption was 39.3MB. Max. memory is 16.1GB. [2025-01-09 21:32:00,459 INFO L158 Benchmark]: Witness Printer took 78.48ms. Allocated memory was 167.8MB in the beginning and 411.0MB in the end (delta: 243.3MB). Free memory was 48.4MB in the beginning and 373.7MB in the end (delta: -325.4MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2025-01-09 21:32:00,460 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.21ms. Allocated memory is still 226.5MB. Free memory is still 146.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 195.79ms. Allocated memory is still 167.8MB. Free memory was 121.2MB in the beginning and 109.8MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.16ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 108.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.61ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 107.7MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 370.60ms. Allocated memory is still 167.8MB. Free memory was 107.7MB in the beginning and 92.1MB in the end (delta: 15.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2054.18ms. Allocated memory is still 167.8MB. Free memory was 91.0MB in the beginning and 48.4MB in the end (delta: 42.6MB). Peak memory consumption was 39.3MB. Max. memory is 16.1GB. * Witness Printer took 78.48ms. Allocated memory was 167.8MB in the beginning and 411.0MB in the end (delta: 243.3MB). Free memory was 48.4MB in the beginning and 373.7MB in the end (delta: -325.4MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 246 locations, 35 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.9s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 242 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 76 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 337 IncrementalHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 76 mSDtfsCounter, 337 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=323occurred in iteration=10, 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.4s InterpolantComputationTime, 591 NumberOfCodeBlocks, 591 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 579 ConstructedInterpolants, 0 QuantifiedInterpolants, 603 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 19 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:32:00,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE