./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-simpl-str-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-simpl-str-symm.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 86978482104e316c202a01b019909b1a7fe566ade6200bbc4193c078d7c086e9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:23:43,200 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:23:43,253 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:23:43,257 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:23:43,257 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:23:43,270 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:23:43,270 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:23:43,270 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:23:43,270 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:23:43,270 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:23:43,271 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:23:43,271 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:23:43,271 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:23:43,271 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:23:43,271 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:23:43,271 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:23:43,271 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:23:43,271 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:23:43,271 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:23:43,271 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:23:43,271 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:23:43,271 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:23:43,274 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:23:43,274 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:23:43,274 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:23:43,275 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:23:43,275 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:23:43,275 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:23:43,275 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:23:43,275 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:23:43,275 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:23:43,275 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:23:43,275 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:23:43,275 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:23:43,275 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:23:43,275 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:23:43,275 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:23:43,275 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:23:43,275 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:23:43,275 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:23:43,275 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:23:43,275 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:23:43,275 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/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 -> 86978482104e316c202a01b019909b1a7fe566ade6200bbc4193c078d7c086e9 [2025-03-13 22:23:43,502 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:23:43,510 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:23:43,512 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:23:43,513 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:23:43,513 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:23:43,514 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-simpl-str-symm.wvr.c [2025-03-13 22:23:44,625 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/407aee77e/8a982ce8fc334ac3b49727f49ec5f3e9/FLAG451da8399 [2025-03-13 22:23:44,819 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:23:44,831 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-simpl-str-symm.wvr.c [2025-03-13 22:23:44,838 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/407aee77e/8a982ce8fc334ac3b49727f49ec5f3e9/FLAG451da8399 [2025-03-13 22:23:44,853 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/407aee77e/8a982ce8fc334ac3b49727f49ec5f3e9 [2025-03-13 22:23:44,855 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:23:44,856 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:23:44,857 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:23:44,857 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:23:44,860 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:23:44,860 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:23:44" (1/1) ... [2025-03-13 22:23:44,861 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ad69ff7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:44, skipping insertion in model container [2025-03-13 22:23:44,861 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:23:44" (1/1) ... [2025-03-13 22:23:44,874 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:23:45,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:23:45,015 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:23:45,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:23:45,047 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:23:45,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:45 WrapperNode [2025-03-13 22:23:45,048 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:23:45,049 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:23:45,049 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:23:45,049 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:23:45,054 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:45" (1/1) ... [2025-03-13 22:23:45,060 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:45" (1/1) ... [2025-03-13 22:23:45,082 INFO L138 Inliner]: procedures = 21, calls = 16, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 185 [2025-03-13 22:23:45,088 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:23:45,088 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:23:45,088 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:23:45,088 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:23:45,092 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:45" (1/1) ... [2025-03-13 22:23:45,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:45" (1/1) ... [2025-03-13 22:23:45,094 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:45" (1/1) ... [2025-03-13 22:23:45,094 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:45" (1/1) ... [2025-03-13 22:23:45,097 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:45" (1/1) ... [2025-03-13 22:23:45,098 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:45" (1/1) ... [2025-03-13 22:23:45,098 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:45" (1/1) ... [2025-03-13 22:23:45,099 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:45" (1/1) ... [2025-03-13 22:23:45,100 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:23:45,101 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:23:45,101 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:23:45,101 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:23:45,102 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:45" (1/1) ... [2025-03-13 22:23:45,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:23:45,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:23:45,144 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 22:23:45,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 22:23:45,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:23:45,187 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 22:23:45,187 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 22:23:45,187 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 22:23:45,187 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 22:23:45,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:23:45,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:23:45,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:23:45,188 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:23:45,256 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:23:45,257 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:23:45,526 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:23:45,527 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:23:45,527 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:23:45,540 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:23:45,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:23:45 BoogieIcfgContainer [2025-03-13 22:23:45,541 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:23:45,542 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:23:45,542 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:23:45,546 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:23:45,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:23:44" (1/3) ... [2025-03-13 22:23:45,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d8b616 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:23:45, skipping insertion in model container [2025-03-13 22:23:45,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:45" (2/3) ... [2025-03-13 22:23:45,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d8b616 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:23:45, skipping insertion in model container [2025-03-13 22:23:45,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:23:45" (3/3) ... [2025-03-13 22:23:45,547 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-simpl-str-symm.wvr.c [2025-03-13 22:23:45,557 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:23:45,558 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-simpl-str-symm.wvr.c that has 3 procedures, 242 locations, 1 initial locations, 0 loop locations, and 22 error locations. [2025-03-13 22:23:45,559 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:23:45,625 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-13 22:23:45,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 248 places, 255 transitions, 524 flow [2025-03-13 22:23:45,711 INFO L124 PetriNetUnfolderBase]: 14/253 cut-off events. [2025-03-13 22:23:45,714 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 22:23:45,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 253 events. 14/253 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 432 event pairs, 0 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2025-03-13 22:23:45,722 INFO L82 GeneralOperation]: Start removeDead. Operand has 248 places, 255 transitions, 524 flow [2025-03-13 22:23:45,728 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 228 places, 233 transitions, 478 flow [2025-03-13 22:23:45,739 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:23:45,750 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;@63a944d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:23:45,751 INFO L334 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2025-03-13 22:23:45,756 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:23:45,756 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-03-13 22:23:45,756 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:23:45,756 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:45,757 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-03-13 22:23:45,757 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-13 22:23:45,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:45,764 INFO L85 PathProgramCache]: Analyzing trace with hash -553044387, now seen corresponding path program 1 times [2025-03-13 22:23:45,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:45,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618613191] [2025-03-13 22:23:45,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:45,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:45,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-13 22:23:45,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 22:23:45,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:45,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:45,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:45,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:45,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618613191] [2025-03-13 22:23:45,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618613191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:45,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:45,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:45,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205828609] [2025-03-13 22:23:45,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:45,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:45,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:45,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:45,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:45,963 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 255 [2025-03-13 22:23:45,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 233 transitions, 478 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 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-03-13 22:23:45,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:45,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 255 [2025-03-13 22:23:45,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:46,075 INFO L124 PetriNetUnfolderBase]: 17/407 cut-off events. [2025-03-13 22:23:46,075 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-03-13 22:23:46,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443 conditions, 407 events. 17/407 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1583 event pairs, 5 based on Foata normal form. 13/355 useless extension candidates. Maximal degree in co-relation 317. Up to 21 conditions per place. [2025-03-13 22:23:46,081 INFO L140 encePairwiseOnDemand]: 246/255 looper letters, 10 selfloop transitions, 2 changer transitions 2/226 dead transitions. [2025-03-13 22:23:46,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 226 transitions, 488 flow [2025-03-13 22:23:46,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:46,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:46,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 718 transitions. [2025-03-13 22:23:46,095 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.938562091503268 [2025-03-13 22:23:46,096 INFO L175 Difference]: Start difference. First operand has 228 places, 233 transitions, 478 flow. Second operand 3 states and 718 transitions. [2025-03-13 22:23:46,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 226 transitions, 488 flow [2025-03-13 22:23:46,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 226 transitions, 480 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-13 22:23:46,105 INFO L231 Difference]: Finished difference. Result has 225 places, 224 transitions, 456 flow [2025-03-13 22:23:46,107 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=456, PETRI_PLACES=225, PETRI_TRANSITIONS=224} [2025-03-13 22:23:46,111 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -3 predicate places. [2025-03-13 22:23:46,111 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 224 transitions, 456 flow [2025-03-13 22:23:46,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 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-03-13 22:23:46,112 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:46,112 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] [2025-03-13 22:23:46,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:23:46,112 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-13 22:23:46,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:46,113 INFO L85 PathProgramCache]: Analyzing trace with hash 461526780, now seen corresponding path program 1 times [2025-03-13 22:23:46,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:46,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740292714] [2025-03-13 22:23:46,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:46,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:46,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-13 22:23:46,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 22:23:46,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:46,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:46,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:46,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:46,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740292714] [2025-03-13 22:23:46,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740292714] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:46,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:46,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:46,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385685046] [2025-03-13 22:23:46,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:46,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:46,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:46,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:46,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:46,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 255 [2025-03-13 22:23:46,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 224 transitions, 456 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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-03-13 22:23:46,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:46,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 255 [2025-03-13 22:23:46,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:46,229 INFO L124 PetriNetUnfolderBase]: 12/329 cut-off events. [2025-03-13 22:23:46,229 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-13 22:23:46,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 355 conditions, 329 events. 12/329 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 956 event pairs, 3 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 325. Up to 17 conditions per place. [2025-03-13 22:23:46,233 INFO L140 encePairwiseOnDemand]: 252/255 looper letters, 9 selfloop transitions, 2 changer transitions 0/223 dead transitions. [2025-03-13 22:23:46,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 223 transitions, 476 flow [2025-03-13 22:23:46,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:46,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:46,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2025-03-13 22:23:46,238 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2025-03-13 22:23:46,238 INFO L175 Difference]: Start difference. First operand has 225 places, 224 transitions, 456 flow. Second operand 3 states and 714 transitions. [2025-03-13 22:23:46,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 223 transitions, 476 flow [2025-03-13 22:23:46,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 223 transitions, 472 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:46,241 INFO L231 Difference]: Finished difference. Result has 222 places, 223 transitions, 454 flow [2025-03-13 22:23:46,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=454, PETRI_PLACES=222, PETRI_TRANSITIONS=223} [2025-03-13 22:23:46,242 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -6 predicate places. [2025-03-13 22:23:46,242 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 223 transitions, 454 flow [2025-03-13 22:23:46,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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-03-13 22:23:46,243 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:46,243 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:46,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:23:46,243 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-13 22:23:46,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:46,243 INFO L85 PathProgramCache]: Analyzing trace with hash 2016091562, now seen corresponding path program 1 times [2025-03-13 22:23:46,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:46,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925717036] [2025-03-13 22:23:46,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:46,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:46,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-13 22:23:46,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-13 22:23:46,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:46,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:46,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:46,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:46,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925717036] [2025-03-13 22:23:46,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925717036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:46,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:46,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:46,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430485008] [2025-03-13 22:23:46,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:46,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:46,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:46,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:46,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:46,322 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 255 [2025-03-13 22:23:46,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 223 transitions, 454 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 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-03-13 22:23:46,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:46,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 255 [2025-03-13 22:23:46,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:46,363 INFO L124 PetriNetUnfolderBase]: 15/334 cut-off events. [2025-03-13 22:23:46,363 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 22:23:46,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 334 events. 15/334 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1115 event pairs, 5 based on Foata normal form. 0/288 useless extension candidates. Maximal degree in co-relation 327. Up to 21 conditions per place. [2025-03-13 22:23:46,364 INFO L140 encePairwiseOnDemand]: 252/255 looper letters, 10 selfloop transitions, 2 changer transitions 0/222 dead transitions. [2025-03-13 22:23:46,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 222 transitions, 476 flow [2025-03-13 22:23:46,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:46,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:46,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 712 transitions. [2025-03-13 22:23:46,369 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.930718954248366 [2025-03-13 22:23:46,369 INFO L175 Difference]: Start difference. First operand has 222 places, 223 transitions, 454 flow. Second operand 3 states and 712 transitions. [2025-03-13 22:23:46,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 222 transitions, 476 flow [2025-03-13 22:23:46,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 222 transitions, 472 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:46,374 INFO L231 Difference]: Finished difference. Result has 221 places, 222 transitions, 452 flow [2025-03-13 22:23:46,375 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=452, PETRI_PLACES=221, PETRI_TRANSITIONS=222} [2025-03-13 22:23:46,376 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -7 predicate places. [2025-03-13 22:23:46,376 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 222 transitions, 452 flow [2025-03-13 22:23:46,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 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-03-13 22:23:46,376 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:46,376 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-03-13 22:23:46,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:23:46,377 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-13 22:23:46,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:46,377 INFO L85 PathProgramCache]: Analyzing trace with hash -446225199, now seen corresponding path program 1 times [2025-03-13 22:23:46,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:46,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153401017] [2025-03-13 22:23:46,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:46,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:46,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-13 22:23:46,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-13 22:23:46,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:46,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:46,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:46,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:46,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153401017] [2025-03-13 22:23:46,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153401017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:46,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:46,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:46,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838794535] [2025-03-13 22:23:46,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:46,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:46,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:46,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:46,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:46,447 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 255 [2025-03-13 22:23:46,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 222 transitions, 452 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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-03-13 22:23:46,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:46,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 255 [2025-03-13 22:23:46,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:46,500 INFO L124 PetriNetUnfolderBase]: 12/330 cut-off events. [2025-03-13 22:23:46,501 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-13 22:23:46,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 356 conditions, 330 events. 12/330 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 958 event pairs, 3 based on Foata normal form. 0/286 useless extension candidates. Maximal degree in co-relation 310. Up to 17 conditions per place. [2025-03-13 22:23:46,502 INFO L140 encePairwiseOnDemand]: 252/255 looper letters, 9 selfloop transitions, 2 changer transitions 0/221 dead transitions. [2025-03-13 22:23:46,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 221 transitions, 472 flow [2025-03-13 22:23:46,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:46,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:46,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2025-03-13 22:23:46,504 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2025-03-13 22:23:46,504 INFO L175 Difference]: Start difference. First operand has 221 places, 222 transitions, 452 flow. Second operand 3 states and 714 transitions. [2025-03-13 22:23:46,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 221 transitions, 472 flow [2025-03-13 22:23:46,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 221 transitions, 468 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:46,507 INFO L231 Difference]: Finished difference. Result has 220 places, 221 transitions, 450 flow [2025-03-13 22:23:46,507 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=450, PETRI_PLACES=220, PETRI_TRANSITIONS=221} [2025-03-13 22:23:46,508 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -8 predicate places. [2025-03-13 22:23:46,508 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 221 transitions, 450 flow [2025-03-13 22:23:46,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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-03-13 22:23:46,508 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:46,509 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-03-13 22:23:46,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:23:46,509 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-13 22:23:46,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:46,509 INFO L85 PathProgramCache]: Analyzing trace with hash -891297705, now seen corresponding path program 1 times [2025-03-13 22:23:46,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:46,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129839830] [2025-03-13 22:23:46,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:46,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:46,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-13 22:23:46,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-13 22:23:46,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:46,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:46,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:46,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:46,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129839830] [2025-03-13 22:23:46,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129839830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:46,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:46,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:46,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241222546] [2025-03-13 22:23:46,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:46,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:46,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:46,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:46,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:46,570 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 255 [2025-03-13 22:23:46,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 221 transitions, 450 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 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-03-13 22:23:46,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:46,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 255 [2025-03-13 22:23:46,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:46,609 INFO L124 PetriNetUnfolderBase]: 32/560 cut-off events. [2025-03-13 22:23:46,612 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-13 22:23:46,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 560 events. 32/560 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2687 event pairs, 9 based on Foata normal form. 0/484 useless extension candidates. Maximal degree in co-relation 554. Up to 36 conditions per place. [2025-03-13 22:23:46,615 INFO L140 encePairwiseOnDemand]: 249/255 looper letters, 12 selfloop transitions, 3 changer transitions 0/222 dead transitions. [2025-03-13 22:23:46,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 222 transitions, 483 flow [2025-03-13 22:23:46,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:46,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:46,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 717 transitions. [2025-03-13 22:23:46,617 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9372549019607843 [2025-03-13 22:23:46,617 INFO L175 Difference]: Start difference. First operand has 220 places, 221 transitions, 450 flow. Second operand 3 states and 717 transitions. [2025-03-13 22:23:46,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 222 transitions, 483 flow [2025-03-13 22:23:46,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 222 transitions, 479 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:46,620 INFO L231 Difference]: Finished difference. Result has 218 places, 221 transitions, 461 flow [2025-03-13 22:23:46,620 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=461, PETRI_PLACES=218, PETRI_TRANSITIONS=221} [2025-03-13 22:23:46,621 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -10 predicate places. [2025-03-13 22:23:46,621 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 221 transitions, 461 flow [2025-03-13 22:23:46,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 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-03-13 22:23:46,622 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:46,622 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:46,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:23:46,622 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-13 22:23:46,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:46,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1161626098, now seen corresponding path program 1 times [2025-03-13 22:23:46,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:46,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331226451] [2025-03-13 22:23:46,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:46,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:46,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-13 22:23:46,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-13 22:23:46,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:46,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:46,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:46,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:46,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331226451] [2025-03-13 22:23:46,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331226451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:46,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:46,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:46,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328149105] [2025-03-13 22:23:46,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:46,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:46,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:46,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:46,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:46,676 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 255 [2025-03-13 22:23:46,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 221 transitions, 461 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 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-03-13 22:23:46,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:46,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 255 [2025-03-13 22:23:46,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:46,741 INFO L124 PetriNetUnfolderBase]: 34/573 cut-off events. [2025-03-13 22:23:46,741 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-03-13 22:23:46,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 641 conditions, 573 events. 34/573 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2885 event pairs, 8 based on Foata normal form. 0/508 useless extension candidates. Maximal degree in co-relation 520. Up to 36 conditions per place. [2025-03-13 22:23:46,744 INFO L140 encePairwiseOnDemand]: 249/255 looper letters, 12 selfloop transitions, 3 changer transitions 0/222 dead transitions. [2025-03-13 22:23:46,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 222 transitions, 494 flow [2025-03-13 22:23:46,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:46,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:46,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 717 transitions. [2025-03-13 22:23:46,746 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9372549019607843 [2025-03-13 22:23:46,746 INFO L175 Difference]: Start difference. First operand has 218 places, 221 transitions, 461 flow. Second operand 3 states and 717 transitions. [2025-03-13 22:23:46,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 222 transitions, 494 flow [2025-03-13 22:23:46,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 222 transitions, 494 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:23:46,750 INFO L231 Difference]: Finished difference. Result has 218 places, 221 transitions, 476 flow [2025-03-13 22:23:46,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=476, PETRI_PLACES=218, PETRI_TRANSITIONS=221} [2025-03-13 22:23:46,751 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -10 predicate places. [2025-03-13 22:23:46,751 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 221 transitions, 476 flow [2025-03-13 22:23:46,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 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-03-13 22:23:46,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:46,751 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-03-13 22:23:46,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:23:46,752 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-13 22:23:46,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:46,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1421479744, now seen corresponding path program 1 times [2025-03-13 22:23:46,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:46,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997346777] [2025-03-13 22:23:46,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:46,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:46,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-13 22:23:46,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-13 22:23:46,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:46,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:46,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:46,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:46,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997346777] [2025-03-13 22:23:46,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997346777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:46,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:46,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:46,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628452870] [2025-03-13 22:23:46,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:46,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:46,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:46,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:46,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:46,803 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 255 [2025-03-13 22:23:46,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 221 transitions, 476 flow. Second operand has 3 states, 3 states have (on average 237.33333333333334) internal successors, (712), 3 states have internal predecessors, (712), 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-03-13 22:23:46,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:46,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 255 [2025-03-13 22:23:46,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:46,853 INFO L124 PetriNetUnfolderBase]: 25/689 cut-off events. [2025-03-13 22:23:46,853 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2025-03-13 22:23:46,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 758 conditions, 689 events. 25/689 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3447 event pairs, 2 based on Foata normal form. 0/620 useless extension candidates. Maximal degree in co-relation 623. Up to 32 conditions per place. [2025-03-13 22:23:46,856 INFO L140 encePairwiseOnDemand]: 251/255 looper letters, 12 selfloop transitions, 2 changer transitions 0/224 dead transitions. [2025-03-13 22:23:46,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 224 transitions, 513 flow [2025-03-13 22:23:46,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:46,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:46,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2025-03-13 22:23:46,858 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9464052287581699 [2025-03-13 22:23:46,858 INFO L175 Difference]: Start difference. First operand has 218 places, 221 transitions, 476 flow. Second operand 3 states and 724 transitions. [2025-03-13 22:23:46,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 224 transitions, 513 flow [2025-03-13 22:23:46,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 224 transitions, 513 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:23:46,860 INFO L231 Difference]: Finished difference. Result has 219 places, 221 transitions, 486 flow [2025-03-13 22:23:46,861 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=486, PETRI_PLACES=219, PETRI_TRANSITIONS=221} [2025-03-13 22:23:46,861 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -9 predicate places. [2025-03-13 22:23:46,861 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 221 transitions, 486 flow [2025-03-13 22:23:46,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 237.33333333333334) internal successors, (712), 3 states have internal predecessors, (712), 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-03-13 22:23:46,862 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:46,862 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] [2025-03-13 22:23:46,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:23:46,862 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-13 22:23:46,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:46,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1363068610, now seen corresponding path program 1 times [2025-03-13 22:23:46,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:46,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986820241] [2025-03-13 22:23:46,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:46,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:46,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-13 22:23:46,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-13 22:23:46,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:46,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:46,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:46,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:46,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986820241] [2025-03-13 22:23:46,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986820241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:46,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:46,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:46,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087416183] [2025-03-13 22:23:46,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:46,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:46,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:46,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:46,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:46,921 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 255 [2025-03-13 22:23:46,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 221 transitions, 486 flow. Second operand has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 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-03-13 22:23:46,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:46,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 255 [2025-03-13 22:23:46,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:46,986 INFO L124 PetriNetUnfolderBase]: 26/630 cut-off events. [2025-03-13 22:23:46,986 INFO L125 PetriNetUnfolderBase]: For 4/12 co-relation queries the response was YES. [2025-03-13 22:23:46,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 630 events. 26/630 cut-off events. For 4/12 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3001 event pairs, 4 based on Foata normal form. 2/570 useless extension candidates. Maximal degree in co-relation 591. Up to 25 conditions per place. [2025-03-13 22:23:46,989 INFO L140 encePairwiseOnDemand]: 252/255 looper letters, 10 selfloop transitions, 2 changer transitions 0/221 dead transitions. [2025-03-13 22:23:46,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 221 transitions, 511 flow [2025-03-13 22:23:46,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:46,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:46,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 718 transitions. [2025-03-13 22:23:46,991 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.938562091503268 [2025-03-13 22:23:46,993 INFO L175 Difference]: Start difference. First operand has 219 places, 221 transitions, 486 flow. Second operand 3 states and 718 transitions. [2025-03-13 22:23:46,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 221 transitions, 511 flow [2025-03-13 22:23:46,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 221 transitions, 511 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:23:46,997 INFO L231 Difference]: Finished difference. Result has 220 places, 220 transitions, 488 flow [2025-03-13 22:23:46,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=488, PETRI_PLACES=220, PETRI_TRANSITIONS=220} [2025-03-13 22:23:46,997 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -8 predicate places. [2025-03-13 22:23:46,997 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 220 transitions, 488 flow [2025-03-13 22:23:46,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 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-03-13 22:23:46,998 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:46,998 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] [2025-03-13 22:23:46,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:23:46,998 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-13 22:23:46,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:46,998 INFO L85 PathProgramCache]: Analyzing trace with hash -242417789, now seen corresponding path program 1 times [2025-03-13 22:23:46,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:46,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298741416] [2025-03-13 22:23:46,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:46,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:47,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-13 22:23:47,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-13 22:23:47,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:47,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:47,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:47,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:47,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298741416] [2025-03-13 22:23:47,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298741416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:47,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:47,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:47,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244342477] [2025-03-13 22:23:47,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:47,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:47,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:47,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:47,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:47,053 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 255 [2025-03-13 22:23:47,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 220 transitions, 488 flow. Second operand has 3 states, 3 states have (on average 237.33333333333334) internal successors, (712), 3 states have internal predecessors, (712), 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-03-13 22:23:47,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:47,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 255 [2025-03-13 22:23:47,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:47,104 INFO L124 PetriNetUnfolderBase]: 26/722 cut-off events. [2025-03-13 22:23:47,104 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2025-03-13 22:23:47,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 819 conditions, 722 events. 26/722 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3784 event pairs, 4 based on Foata normal form. 0/661 useless extension candidates. Maximal degree in co-relation 681. Up to 33 conditions per place. [2025-03-13 22:23:47,107 INFO L140 encePairwiseOnDemand]: 251/255 looper letters, 12 selfloop transitions, 2 changer transitions 0/223 dead transitions. [2025-03-13 22:23:47,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 223 transitions, 525 flow [2025-03-13 22:23:47,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:47,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:47,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2025-03-13 22:23:47,110 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9464052287581699 [2025-03-13 22:23:47,110 INFO L175 Difference]: Start difference. First operand has 220 places, 220 transitions, 488 flow. Second operand 3 states and 724 transitions. [2025-03-13 22:23:47,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 223 transitions, 525 flow [2025-03-13 22:23:47,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 223 transitions, 521 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:47,113 INFO L231 Difference]: Finished difference. Result has 219 places, 220 transitions, 494 flow [2025-03-13 22:23:47,113 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=494, PETRI_PLACES=219, PETRI_TRANSITIONS=220} [2025-03-13 22:23:47,114 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -9 predicate places. [2025-03-13 22:23:47,114 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 220 transitions, 494 flow [2025-03-13 22:23:47,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 237.33333333333334) internal successors, (712), 3 states have internal predecessors, (712), 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-03-13 22:23:47,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:47,114 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-03-13 22:23:47,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:23:47,115 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-13 22:23:47,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:47,115 INFO L85 PathProgramCache]: Analyzing trace with hash 435141038, now seen corresponding path program 1 times [2025-03-13 22:23:47,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:47,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284204209] [2025-03-13 22:23:47,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:47,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:47,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-13 22:23:47,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-13 22:23:47,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:47,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:47,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:47,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:47,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284204209] [2025-03-13 22:23:47,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284204209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:47,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:47,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:47,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10805318] [2025-03-13 22:23:47,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:47,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:47,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:47,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:47,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:47,170 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 255 [2025-03-13 22:23:47,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 220 transitions, 494 flow. Second operand has 3 states, 3 states have (on average 236.66666666666666) internal successors, (710), 3 states have internal predecessors, (710), 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-03-13 22:23:47,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:47,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 255 [2025-03-13 22:23:47,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:47,219 INFO L124 PetriNetUnfolderBase]: 33/577 cut-off events. [2025-03-13 22:23:47,220 INFO L125 PetriNetUnfolderBase]: For 19/21 co-relation queries the response was YES. [2025-03-13 22:23:47,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 712 conditions, 577 events. 33/577 cut-off events. For 19/21 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2618 event pairs, 4 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 569. Up to 47 conditions per place. [2025-03-13 22:23:47,221 INFO L140 encePairwiseOnDemand]: 252/255 looper letters, 10 selfloop transitions, 2 changer transitions 0/220 dead transitions. [2025-03-13 22:23:47,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 220 transitions, 519 flow [2025-03-13 22:23:47,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:47,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:47,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 718 transitions. [2025-03-13 22:23:47,223 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.938562091503268 [2025-03-13 22:23:47,223 INFO L175 Difference]: Start difference. First operand has 219 places, 220 transitions, 494 flow. Second operand 3 states and 718 transitions. [2025-03-13 22:23:47,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 220 transitions, 519 flow [2025-03-13 22:23:47,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 220 transitions, 519 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:23:47,225 INFO L231 Difference]: Finished difference. Result has 220 places, 219 transitions, 496 flow [2025-03-13 22:23:47,226 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=496, PETRI_PLACES=220, PETRI_TRANSITIONS=219} [2025-03-13 22:23:47,226 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -8 predicate places. [2025-03-13 22:23:47,226 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 219 transitions, 496 flow [2025-03-13 22:23:47,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.66666666666666) internal successors, (710), 3 states have internal predecessors, (710), 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-03-13 22:23:47,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:47,227 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:47,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:23:47,227 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-13 22:23:47,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:47,227 INFO L85 PathProgramCache]: Analyzing trace with hash 259617708, now seen corresponding path program 1 times [2025-03-13 22:23:47,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:47,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922498117] [2025-03-13 22:23:47,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:47,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:47,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-13 22:23:47,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-13 22:23:47,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:47,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:47,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:47,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:47,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922498117] [2025-03-13 22:23:47,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922498117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:47,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:47,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:47,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170157187] [2025-03-13 22:23:47,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:47,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:47,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:47,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:47,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:47,298 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 255 [2025-03-13 22:23:47,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 219 transitions, 496 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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-03-13 22:23:47,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:47,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 255 [2025-03-13 22:23:47,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:47,357 INFO L124 PetriNetUnfolderBase]: 21/625 cut-off events. [2025-03-13 22:23:47,357 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-03-13 22:23:47,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 745 conditions, 625 events. 21/625 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2964 event pairs, 2 based on Foata normal form. 0/585 useless extension candidates. Maximal degree in co-relation 605. Up to 18 conditions per place. [2025-03-13 22:23:47,361 INFO L140 encePairwiseOnDemand]: 251/255 looper letters, 10 selfloop transitions, 1 changer transitions 0/216 dead transitions. [2025-03-13 22:23:47,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 216 transitions, 512 flow [2025-03-13 22:23:47,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:47,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:47,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 713 transitions. [2025-03-13 22:23:47,364 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9320261437908497 [2025-03-13 22:23:47,364 INFO L175 Difference]: Start difference. First operand has 220 places, 219 transitions, 496 flow. Second operand 3 states and 713 transitions. [2025-03-13 22:23:47,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 216 transitions, 512 flow [2025-03-13 22:23:47,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 216 transitions, 508 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:47,369 INFO L231 Difference]: Finished difference. Result has 217 places, 216 transitions, 488 flow [2025-03-13 22:23:47,370 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=488, PETRI_PLACES=217, PETRI_TRANSITIONS=216} [2025-03-13 22:23:47,370 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -11 predicate places. [2025-03-13 22:23:47,370 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 216 transitions, 488 flow [2025-03-13 22:23:47,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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-03-13 22:23:47,371 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:47,371 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:47,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 22:23:47,371 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-13 22:23:47,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:47,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1956360176, now seen corresponding path program 1 times [2025-03-13 22:23:47,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:47,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781106108] [2025-03-13 22:23:47,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:47,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:47,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-13 22:23:47,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-13 22:23:47,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:47,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:47,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:47,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:47,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781106108] [2025-03-13 22:23:47,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781106108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:47,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:47,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:47,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957670247] [2025-03-13 22:23:47,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:47,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:47,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:47,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:47,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:47,440 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 255 [2025-03-13 22:23:47,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 216 transitions, 488 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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-03-13 22:23:47,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:47,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 255 [2025-03-13 22:23:47,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:47,493 INFO L124 PetriNetUnfolderBase]: 23/596 cut-off events. [2025-03-13 22:23:47,493 INFO L125 PetriNetUnfolderBase]: For 7/9 co-relation queries the response was YES. [2025-03-13 22:23:47,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 596 events. 23/596 cut-off events. For 7/9 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2512 event pairs, 2 based on Foata normal form. 2/565 useless extension candidates. Maximal degree in co-relation 556. Up to 25 conditions per place. [2025-03-13 22:23:47,495 INFO L140 encePairwiseOnDemand]: 249/255 looper letters, 0 selfloop transitions, 0 changer transitions 215/215 dead transitions. [2025-03-13 22:23:47,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 215 transitions, 510 flow [2025-03-13 22:23:47,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:47,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:47,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2025-03-13 22:23:47,497 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2025-03-13 22:23:47,497 INFO L175 Difference]: Start difference. First operand has 217 places, 216 transitions, 488 flow. Second operand 3 states and 714 transitions. [2025-03-13 22:23:47,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 215 transitions, 510 flow [2025-03-13 22:23:47,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 215 transitions, 509 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:23:47,500 INFO L231 Difference]: Finished difference. Result has 215 places, 0 transitions, 0 flow [2025-03-13 22:23:47,500 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=215, PETRI_TRANSITIONS=0} [2025-03-13 22:23:47,500 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -13 predicate places. [2025-03-13 22:23:47,500 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 0 transitions, 0 flow [2025-03-13 22:23:47,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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-03-13 22:23:47,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (35 of 36 remaining) [2025-03-13 22:23:47,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (34 of 36 remaining) [2025-03-13 22:23:47,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (33 of 36 remaining) [2025-03-13 22:23:47,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (32 of 36 remaining) [2025-03-13 22:23:47,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (31 of 36 remaining) [2025-03-13 22:23:47,504 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (30 of 36 remaining) [2025-03-13 22:23:47,504 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (29 of 36 remaining) [2025-03-13 22:23:47,504 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (28 of 36 remaining) [2025-03-13 22:23:47,504 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (27 of 36 remaining) [2025-03-13 22:23:47,504 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (26 of 36 remaining) [2025-03-13 22:23:47,504 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (25 of 36 remaining) [2025-03-13 22:23:47,504 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (24 of 36 remaining) [2025-03-13 22:23:47,504 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (23 of 36 remaining) [2025-03-13 22:23:47,504 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (22 of 36 remaining) [2025-03-13 22:23:47,504 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (21 of 36 remaining) [2025-03-13 22:23:47,504 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (20 of 36 remaining) [2025-03-13 22:23:47,504 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (19 of 36 remaining) [2025-03-13 22:23:47,504 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (18 of 36 remaining) [2025-03-13 22:23:47,505 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (17 of 36 remaining) [2025-03-13 22:23:47,505 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (16 of 36 remaining) [2025-03-13 22:23:47,505 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 36 remaining) [2025-03-13 22:23:47,505 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 36 remaining) [2025-03-13 22:23:47,505 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 36 remaining) [2025-03-13 22:23:47,505 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 36 remaining) [2025-03-13 22:23:47,505 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (11 of 36 remaining) [2025-03-13 22:23:47,505 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (10 of 36 remaining) [2025-03-13 22:23:47,505 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (9 of 36 remaining) [2025-03-13 22:23:47,505 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (8 of 36 remaining) [2025-03-13 22:23:47,505 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (7 of 36 remaining) [2025-03-13 22:23:47,505 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (6 of 36 remaining) [2025-03-13 22:23:47,505 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (5 of 36 remaining) [2025-03-13 22:23:47,505 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (4 of 36 remaining) [2025-03-13 22:23:47,506 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (3 of 36 remaining) [2025-03-13 22:23:47,506 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (2 of 36 remaining) [2025-03-13 22:23:47,506 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (1 of 36 remaining) [2025-03-13 22:23:47,506 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (0 of 36 remaining) [2025-03-13 22:23:47,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:23:47,506 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:47,510 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 22:23:47,510 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 22:23:47,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 10:23:47 BasicIcfg [2025-03-13 22:23:47,513 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 22:23:47,514 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 22:23:47,514 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 22:23:47,514 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 22:23:47,514 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:23:45" (3/4) ... [2025-03-13 22:23:47,515 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-13 22:23:47,518 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-13 22:23:47,518 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-13 22:23:47,521 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-13 22:23:47,521 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-13 22:23:47,521 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-13 22:23:47,521 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-13 22:23:47,581 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 22:23:47,581 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 22:23:47,581 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 22:23:47,582 INFO L158 Benchmark]: Toolchain (without parser) took 2725.64ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 107.1MB in the beginning and 181.0MB in the end (delta: -73.9MB). Peak memory consumption was 88.3MB. Max. memory is 16.1GB. [2025-03-13 22:23:47,582 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:23:47,582 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.40ms. Allocated memory is still 142.6MB. Free memory was 107.1MB in the beginning and 95.5MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:23:47,582 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.94ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 93.2MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:23:47,583 INFO L158 Benchmark]: Boogie Preprocessor took 11.94ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 92.4MB in the end (delta: 851.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:23:47,583 INFO L158 Benchmark]: IcfgBuilder took 439.96ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 72.6MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-13 22:23:47,583 INFO L158 Benchmark]: TraceAbstraction took 1971.11ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 72.6MB in the beginning and 187.0MB in the end (delta: -114.4MB). Peak memory consumption was 54.7MB. Max. memory is 16.1GB. [2025-03-13 22:23:47,583 INFO L158 Benchmark]: Witness Printer took 67.39ms. Allocated memory is still 310.4MB. Free memory was 187.0MB in the beginning and 181.0MB in the end (delta: 6.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:23:47,584 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.14ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 191.40ms. Allocated memory is still 142.6MB. Free memory was 107.1MB in the beginning and 95.5MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.94ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 93.2MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 11.94ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 92.4MB in the end (delta: 851.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 439.96ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 72.6MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1971.11ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 72.6MB in the beginning and 187.0MB in the end (delta: -114.4MB). Peak memory consumption was 54.7MB. Max. memory is 16.1GB. * Witness Printer took 67.39ms. Allocated memory is still 310.4MB. Free memory was 187.0MB in the beginning and 181.0MB in the end (delta: 6.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 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: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: 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: 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: 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: 71]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 360 locations, 36 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.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 263 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 71 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 295 IncrementalHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 71 mSDtfsCounter, 295 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=496occurred 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, 705 NumberOfCodeBlocks, 705 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 693 ConstructedInterpolants, 0 QuantifiedInterpolants, 717 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 22 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-13 22:23:47,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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