./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_73-funloop_hard_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 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/goblint-regression/28-race_reach_73-funloop_hard_racefree.i -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 c8af2e9e80aefb6a93651d6c869df13510f679bd9566c8571973545c9393aab5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:50:42,451 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:50:42,507 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:50:42,515 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:50:42,515 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:50:42,537 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:50:42,538 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:50:42,538 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:50:42,538 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:50:42,538 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:50:42,539 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:50:42,539 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:50:42,539 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:50:42,539 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:50:42,539 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:50:42,539 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:50:42,539 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:50:42,539 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:50:42,539 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:50:42,539 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:50:42,539 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:50:42,539 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:50:42,539 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:50:42,539 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:50:42,539 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:50:42,539 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:50:42,539 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:50:42,539 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:50:42,540 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:50:42,540 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:50:42,540 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:50:42,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:50:42,540 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:50:42,540 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:50:42,540 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:50:42,540 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:50:42,540 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:50:42,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:50:42,540 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:50:42,540 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:50:42,540 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:50:42,540 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:50:42,540 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 -> c8af2e9e80aefb6a93651d6c869df13510f679bd9566c8571973545c9393aab5 [2025-03-04 06:50:42,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:50:42,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:50:42,776 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:50:42,778 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:50:42,778 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:50:42,780 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_73-funloop_hard_racefree.i [2025-03-04 06:50:43,911 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eba706f5a/2257d36554364df1b6a25d839f580b53/FLAG5b52347f2 [2025-03-04 06:50:44,250 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:50:44,251 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_73-funloop_hard_racefree.i [2025-03-04 06:50:44,270 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eba706f5a/2257d36554364df1b6a25d839f580b53/FLAG5b52347f2 [2025-03-04 06:50:44,468 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eba706f5a/2257d36554364df1b6a25d839f580b53 [2025-03-04 06:50:44,470 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:50:44,471 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:50:44,472 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:50:44,472 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:50:44,475 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:50:44,475 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:50:44" (1/1) ... [2025-03-04 06:50:44,476 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e893919 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:44, skipping insertion in model container [2025-03-04 06:50:44,476 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:50:44" (1/1) ... [2025-03-04 06:50:44,505 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:50:44,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:50:44,924 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:50:44,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:50:45,024 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:50:45,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:45 WrapperNode [2025-03-04 06:50:45,026 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:50:45,027 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:50:45,027 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:50:45,027 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:50:45,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:45" (1/1) ... [2025-03-04 06:50:45,047 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:45" (1/1) ... [2025-03-04 06:50:45,077 INFO L138 Inliner]: procedures = 272, calls = 110, calls flagged for inlining = 7, calls inlined = 10, statements flattened = 418 [2025-03-04 06:50:45,077 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:50:45,078 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:50:45,078 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:50:45,078 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:50:45,083 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:45" (1/1) ... [2025-03-04 06:50:45,083 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:45" (1/1) ... [2025-03-04 06:50:45,089 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:45" (1/1) ... [2025-03-04 06:50:45,090 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:45" (1/1) ... [2025-03-04 06:50:45,117 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:45" (1/1) ... [2025-03-04 06:50:45,119 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:45" (1/1) ... [2025-03-04 06:50:45,120 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:45" (1/1) ... [2025-03-04 06:50:45,121 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:45" (1/1) ... [2025-03-04 06:50:45,124 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:50:45,124 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:50:45,124 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:50:45,132 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:50:45,132 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:45" (1/1) ... [2025-03-04 06:50:45,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:50:45,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:50:45,172 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-04 06:50:45,177 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-04 06:50:45,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 06:50:45,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 06:50:45,198 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 06:50:45,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:50:45,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:50:45,198 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 06:50:45,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:50:45,198 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 06:50:45,198 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 06:50:45,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:50:45,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:50:45,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:50:45,201 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:50:45,340 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:50:45,342 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:50:45,786 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L953: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-04 06:50:45,787 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L953-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-04 06:50:45,880 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:50:45,880 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:50:45,934 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:50:45,935 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:50:45,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:50:45 BoogieIcfgContainer [2025-03-04 06:50:45,935 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:50:45,937 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:50:45,937 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:50:45,941 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:50:45,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:50:44" (1/3) ... [2025-03-04 06:50:45,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b7943 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:50:45, skipping insertion in model container [2025-03-04 06:50:45,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:45" (2/3) ... [2025-03-04 06:50:45,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b7943 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:50:45, skipping insertion in model container [2025-03-04 06:50:45,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:50:45" (3/3) ... [2025-03-04 06:50:45,944 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_73-funloop_hard_racefree.i [2025-03-04 06:50:45,959 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:50:45,961 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_73-funloop_hard_racefree.i that has 2 procedures, 398 locations, 1 initial locations, 17 loop locations, and 17 error locations. [2025-03-04 06:50:45,962 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:50:46,098 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 06:50:46,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 401 places, 441 transitions, 889 flow [2025-03-04 06:50:46,340 INFO L124 PetriNetUnfolderBase]: 70/674 cut-off events. [2025-03-04 06:50:46,343 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:50:46,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 679 conditions, 674 events. 70/674 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3387 event pairs, 0 based on Foata normal form. 0/572 useless extension candidates. Maximal degree in co-relation 347. Up to 8 conditions per place. [2025-03-04 06:50:46,359 INFO L82 GeneralOperation]: Start removeDead. Operand has 401 places, 441 transitions, 889 flow [2025-03-04 06:50:46,370 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 401 places, 441 transitions, 889 flow [2025-03-04 06:50:46,380 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:50:46,399 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;@298ef5bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:50:46,399 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-03-04 06:50:46,418 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:50:46,419 INFO L124 PetriNetUnfolderBase]: 1/117 cut-off events. [2025-03-04 06:50:46,419 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:50:46,419 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:46,420 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] [2025-03-04 06:50:46,421 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-04 06:50:46,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:46,427 INFO L85 PathProgramCache]: Analyzing trace with hash 955900180, now seen corresponding path program 1 times [2025-03-04 06:50:46,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:46,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306883911] [2025-03-04 06:50:46,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:46,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:46,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-04 06:50:46,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 06:50:46,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:46,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:46,835 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-04 06:50:46,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:46,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306883911] [2025-03-04 06:50:46,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306883911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:46,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:46,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:50:46,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636931011] [2025-03-04 06:50:46,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:46,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:50:46,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:46,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:50:46,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:50:46,880 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 441 [2025-03-04 06:50:46,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 441 transitions, 889 flow. Second operand has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 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-04 06:50:46,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:46,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 441 [2025-03-04 06:50:46,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:47,355 INFO L124 PetriNetUnfolderBase]: 181/2360 cut-off events. [2025-03-04 06:50:47,356 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2025-03-04 06:50:47,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2707 conditions, 2360 events. 181/2360 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 19627 event pairs, 136 based on Foata normal form. 301/2459 useless extension candidates. Maximal degree in co-relation 2370. Up to 340 conditions per place. [2025-03-04 06:50:47,371 INFO L140 encePairwiseOnDemand]: 402/441 looper letters, 31 selfloop transitions, 2 changer transitions 0/400 dead transitions. [2025-03-04 06:50:47,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 400 transitions, 873 flow [2025-03-04 06:50:47,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:50:47,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:50:47,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1180 transitions. [2025-03-04 06:50:47,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.891912320483749 [2025-03-04 06:50:47,388 INFO L175 Difference]: Start difference. First operand has 401 places, 441 transitions, 889 flow. Second operand 3 states and 1180 transitions. [2025-03-04 06:50:47,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 400 transitions, 873 flow [2025-03-04 06:50:47,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 400 transitions, 873 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:50:47,403 INFO L231 Difference]: Finished difference. Result has 398 places, 400 transitions, 817 flow [2025-03-04 06:50:47,407 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=805, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=817, PETRI_PLACES=398, PETRI_TRANSITIONS=400} [2025-03-04 06:50:47,410 INFO L279 CegarLoopForPetriNet]: 401 programPoint places, -3 predicate places. [2025-03-04 06:50:47,411 INFO L471 AbstractCegarLoop]: Abstraction has has 398 places, 400 transitions, 817 flow [2025-03-04 06:50:47,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 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-04 06:50:47,412 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:47,412 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-04 06:50:47,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:50:47,412 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-04 06:50:47,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:47,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1239613547, now seen corresponding path program 1 times [2025-03-04 06:50:47,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:47,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147990289] [2025-03-04 06:50:47,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:47,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:47,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 06:50:47,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 06:50:47,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:47,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:47,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:47,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:47,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147990289] [2025-03-04 06:50:47,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147990289] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:50:47,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512171811] [2025-03-04 06:50:47,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:47,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:50:47,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:50:47,594 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:50:47,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 06:50:47,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 06:50:47,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 06:50:47,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:47,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:47,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 06:50:47,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:50:47,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:47,740 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:50:47,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:47,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512171811] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:50:47,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:50:47,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 06:50:47,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360467191] [2025-03-04 06:50:47,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:50:47,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:50:47,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:47,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:50:47,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:50:47,830 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 441 [2025-03-04 06:50:47,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 400 transitions, 817 flow. Second operand has 10 states, 10 states have (on average 368.8) internal successors, (3688), 10 states have internal predecessors, (3688), 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-04 06:50:47,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:47,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 441 [2025-03-04 06:50:47,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:48,253 INFO L124 PetriNetUnfolderBase]: 181/2367 cut-off events. [2025-03-04 06:50:48,254 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-03-04 06:50:48,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2733 conditions, 2367 events. 181/2367 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 19663 event pairs, 136 based on Foata normal form. 2/2167 useless extension candidates. Maximal degree in co-relation 2638. Up to 340 conditions per place. [2025-03-04 06:50:48,269 INFO L140 encePairwiseOnDemand]: 435/441 looper letters, 35 selfloop transitions, 9 changer transitions 0/408 dead transitions. [2025-03-04 06:50:48,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 408 transitions, 923 flow [2025-03-04 06:50:48,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:50:48,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 06:50:48,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3349 transitions. [2025-03-04 06:50:48,278 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8437893675988914 [2025-03-04 06:50:48,279 INFO L175 Difference]: Start difference. First operand has 398 places, 400 transitions, 817 flow. Second operand 9 states and 3349 transitions. [2025-03-04 06:50:48,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 408 transitions, 923 flow [2025-03-04 06:50:48,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 408 transitions, 921 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:50:48,285 INFO L231 Difference]: Finished difference. Result has 408 places, 406 transitions, 865 flow [2025-03-04 06:50:48,286 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=815, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=865, PETRI_PLACES=408, PETRI_TRANSITIONS=406} [2025-03-04 06:50:48,287 INFO L279 CegarLoopForPetriNet]: 401 programPoint places, 7 predicate places. [2025-03-04 06:50:48,287 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 406 transitions, 865 flow [2025-03-04 06:50:48,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 368.8) internal successors, (3688), 10 states have internal predecessors, (3688), 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-04 06:50:48,289 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:48,289 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:50:48,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 06:50:48,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:50:48,494 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-04 06:50:48,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:48,495 INFO L85 PathProgramCache]: Analyzing trace with hash -2047771915, now seen corresponding path program 2 times [2025-03-04 06:50:48,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:48,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042134776] [2025-03-04 06:50:48,495 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:50:48,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:48,520 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 108 statements into 2 equivalence classes. [2025-03-04 06:50:48,537 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 93 of 108 statements. [2025-03-04 06:50:48,537 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:50:48,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:49,059 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 06:50:49,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:49,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042134776] [2025-03-04 06:50:49,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042134776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:49,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:49,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:50:49,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698480233] [2025-03-04 06:50:49,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:49,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:50:49,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:49,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:50:49,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:50:49,399 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 441 [2025-03-04 06:50:49,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 406 transitions, 865 flow. Second operand has 6 states, 6 states have (on average 299.5) internal successors, (1797), 6 states have internal predecessors, (1797), 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-04 06:50:49,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:49,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 441 [2025-03-04 06:50:49,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:50,711 INFO L124 PetriNetUnfolderBase]: 2317/9331 cut-off events. [2025-03-04 06:50:50,711 INFO L125 PetriNetUnfolderBase]: For 11/14 co-relation queries the response was YES. [2025-03-04 06:50:50,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13912 conditions, 9331 events. 2317/9331 cut-off events. For 11/14 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 96079 event pairs, 1820 based on Foata normal form. 0/8489 useless extension candidates. Maximal degree in co-relation 13788. Up to 4319 conditions per place. [2025-03-04 06:50:50,757 INFO L140 encePairwiseOnDemand]: 414/441 looper letters, 135 selfloop transitions, 86 changer transitions 0/523 dead transitions. [2025-03-04 06:50:50,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 523 transitions, 1541 flow [2025-03-04 06:50:50,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:50:50,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:50:50,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2010 transitions. [2025-03-04 06:50:50,763 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7596371882086168 [2025-03-04 06:50:50,763 INFO L175 Difference]: Start difference. First operand has 408 places, 406 transitions, 865 flow. Second operand 6 states and 2010 transitions. [2025-03-04 06:50:50,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 523 transitions, 1541 flow [2025-03-04 06:50:50,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 523 transitions, 1535 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-04 06:50:50,774 INFO L231 Difference]: Finished difference. Result has 417 places, 491 transitions, 1425 flow [2025-03-04 06:50:50,774 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=859, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1425, PETRI_PLACES=417, PETRI_TRANSITIONS=491} [2025-03-04 06:50:50,775 INFO L279 CegarLoopForPetriNet]: 401 programPoint places, 16 predicate places. [2025-03-04 06:50:50,775 INFO L471 AbstractCegarLoop]: Abstraction has has 417 places, 491 transitions, 1425 flow [2025-03-04 06:50:50,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 299.5) internal successors, (1797), 6 states have internal predecessors, (1797), 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-04 06:50:50,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:50,776 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:50:50,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:50:50,777 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-04 06:50:50,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:50,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1837394325, now seen corresponding path program 1 times [2025-03-04 06:50:50,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:50,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919569323] [2025-03-04 06:50:50,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:50,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:50,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 06:50:50,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 06:50:50,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:50,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:50,857 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 06:50:50,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:50,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919569323] [2025-03-04 06:50:50,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919569323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:50,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:50,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:50:50,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653265156] [2025-03-04 06:50:50,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:50,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:50:50,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:50,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:50:50,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:50:50,881 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 441 [2025-03-04 06:50:50,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 491 transitions, 1425 flow. Second operand has 3 states, 3 states have (on average 372.0) internal successors, (1116), 3 states have internal predecessors, (1116), 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-04 06:50:50,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:50,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 441 [2025-03-04 06:50:50,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:51,255 INFO L124 PetriNetUnfolderBase]: 403/3090 cut-off events. [2025-03-04 06:50:51,255 INFO L125 PetriNetUnfolderBase]: For 156/170 co-relation queries the response was YES. [2025-03-04 06:50:51,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4242 conditions, 3090 events. 403/3090 cut-off events. For 156/170 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 27371 event pairs, 95 based on Foata normal form. 1/2838 useless extension candidates. Maximal degree in co-relation 4116. Up to 410 conditions per place. [2025-03-04 06:50:51,276 INFO L140 encePairwiseOnDemand]: 438/441 looper letters, 38 selfloop transitions, 3 changer transitions 0/499 dead transitions. [2025-03-04 06:50:51,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 419 places, 499 transitions, 1523 flow [2025-03-04 06:50:51,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:50:51,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:50:51,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1151 transitions. [2025-03-04 06:50:51,280 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8699924414210128 [2025-03-04 06:50:51,280 INFO L175 Difference]: Start difference. First operand has 417 places, 491 transitions, 1425 flow. Second operand 3 states and 1151 transitions. [2025-03-04 06:50:51,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 419 places, 499 transitions, 1523 flow [2025-03-04 06:50:51,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 419 places, 499 transitions, 1523 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:50:51,295 INFO L231 Difference]: Finished difference. Result has 420 places, 491 transitions, 1436 flow [2025-03-04 06:50:51,296 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=1425, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=491, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=488, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1436, PETRI_PLACES=420, PETRI_TRANSITIONS=491} [2025-03-04 06:50:51,297 INFO L279 CegarLoopForPetriNet]: 401 programPoint places, 19 predicate places. [2025-03-04 06:50:51,297 INFO L471 AbstractCegarLoop]: Abstraction has has 420 places, 491 transitions, 1436 flow [2025-03-04 06:50:51,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.0) internal successors, (1116), 3 states have internal predecessors, (1116), 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-04 06:50:51,298 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:51,298 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:50:51,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:50:51,298 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-04 06:50:51,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:51,300 INFO L85 PathProgramCache]: Analyzing trace with hash 166126883, now seen corresponding path program 1 times [2025-03-04 06:50:51,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:51,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226532871] [2025-03-04 06:50:51,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:51,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:51,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 06:50:51,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 06:50:51,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:51,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:51,470 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:51,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:51,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226532871] [2025-03-04 06:50:51,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226532871] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:50:51,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285057882] [2025-03-04 06:50:51,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:51,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:50:51,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:50:51,472 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:50:51,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 06:50:51,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 06:50:51,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 06:50:51,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:51,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:51,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 06:50:51,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:50:51,621 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:51,622 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:50:51,703 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:51,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285057882] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:50:51,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:50:51,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-04 06:50:51,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811360304] [2025-03-04 06:50:51,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:50:51,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 06:50:51,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:51,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 06:50:51,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-04 06:50:51,731 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 441 [2025-03-04 06:50:51,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 491 transitions, 1436 flow. Second operand has 18 states, 18 states have (on average 368.94444444444446) internal successors, (6641), 18 states have internal predecessors, (6641), 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-04 06:50:51,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:51,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 441 [2025-03-04 06:50:51,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:52,325 INFO L124 PetriNetUnfolderBase]: 369/3104 cut-off events. [2025-03-04 06:50:52,326 INFO L125 PetriNetUnfolderBase]: For 168/207 co-relation queries the response was YES. [2025-03-04 06:50:52,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4582 conditions, 3104 events. 369/3104 cut-off events. For 168/207 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 27781 event pairs, 136 based on Foata normal form. 4/2869 useless extension candidates. Maximal degree in co-relation 4380. Up to 596 conditions per place. [2025-03-04 06:50:52,349 INFO L140 encePairwiseOnDemand]: 435/441 looper letters, 39 selfloop transitions, 21 changer transitions 0/509 dead transitions. [2025-03-04 06:50:52,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 509 transitions, 1644 flow [2025-03-04 06:50:52,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 06:50:52,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 06:50:52,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 7771 transitions. [2025-03-04 06:50:52,361 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8391102472735126 [2025-03-04 06:50:52,362 INFO L175 Difference]: Start difference. First operand has 420 places, 491 transitions, 1436 flow. Second operand 21 states and 7771 transitions. [2025-03-04 06:50:52,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 509 transitions, 1644 flow [2025-03-04 06:50:52,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 509 transitions, 1638 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:50:52,374 INFO L231 Difference]: Finished difference. Result has 443 places, 504 transitions, 1560 flow [2025-03-04 06:50:52,374 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=1430, PETRI_DIFFERENCE_MINUEND_PLACES=418, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=491, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=480, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1560, PETRI_PLACES=443, PETRI_TRANSITIONS=504} [2025-03-04 06:50:52,375 INFO L279 CegarLoopForPetriNet]: 401 programPoint places, 42 predicate places. [2025-03-04 06:50:52,375 INFO L471 AbstractCegarLoop]: Abstraction has has 443 places, 504 transitions, 1560 flow [2025-03-04 06:50:52,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 368.94444444444446) internal successors, (6641), 18 states have internal predecessors, (6641), 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-04 06:50:52,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:52,382 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:50:52,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 06:50:52,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:50:52,586 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-04 06:50:52,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:52,587 INFO L85 PathProgramCache]: Analyzing trace with hash -2072461725, now seen corresponding path program 2 times [2025-03-04 06:50:52,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:52,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214414851] [2025-03-04 06:50:52,587 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:50:52,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:52,608 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 143 statements into 2 equivalence classes. [2025-03-04 06:50:52,634 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 06:50:52,634 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 06:50:52,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:52,972 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:52,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:52,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214414851] [2025-03-04 06:50:52,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214414851] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:50:52,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906678277] [2025-03-04 06:50:52,972 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:50:52,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:50:52,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:50:52,978 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:50:52,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 06:50:53,055 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 143 statements into 2 equivalence classes. [2025-03-04 06:50:53,108 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 06:50:53,109 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 06:50:53,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:53,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 06:50:53,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:50:53,217 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:53,217 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:50:53,441 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:53,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906678277] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:50:53,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:50:53,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-04 06:50:53,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672574697] [2025-03-04 06:50:53,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:50:53,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 06:50:53,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:53,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 06:50:53,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-04 06:50:53,482 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 441 [2025-03-04 06:50:53,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 504 transitions, 1560 flow. Second operand has 23 states, 23 states have (on average 369.04347826086956) internal successors, (8488), 23 states have internal predecessors, (8488), 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-04 06:50:53,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:53,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 441 [2025-03-04 06:50:53,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:54,308 INFO L124 PetriNetUnfolderBase]: 369/3119 cut-off events. [2025-03-04 06:50:54,309 INFO L125 PetriNetUnfolderBase]: For 269/308 co-relation queries the response was YES. [2025-03-04 06:50:54,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4682 conditions, 3119 events. 369/3119 cut-off events. For 269/308 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 27711 event pairs, 136 based on Foata normal form. 3/2883 useless extension candidates. Maximal degree in co-relation 4380. Up to 596 conditions per place. [2025-03-04 06:50:54,336 INFO L140 encePairwiseOnDemand]: 435/441 looper letters, 42 selfloop transitions, 30 changer transitions 0/521 dead transitions. [2025-03-04 06:50:54,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 472 places, 521 transitions, 1832 flow [2025-03-04 06:50:54,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 06:50:54,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-04 06:50:54,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 11085 transitions. [2025-03-04 06:50:54,355 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8378684807256236 [2025-03-04 06:50:54,356 INFO L175 Difference]: Start difference. First operand has 443 places, 504 transitions, 1560 flow. Second operand 30 states and 11085 transitions. [2025-03-04 06:50:54,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 472 places, 521 transitions, 1832 flow [2025-03-04 06:50:54,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 466 places, 521 transitions, 1802 flow, removed 9 selfloop flow, removed 6 redundant places. [2025-03-04 06:50:54,371 INFO L231 Difference]: Finished difference. Result has 470 places, 514 transitions, 1688 flow [2025-03-04 06:50:54,372 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=1536, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=504, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=481, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1688, PETRI_PLACES=470, PETRI_TRANSITIONS=514} [2025-03-04 06:50:54,373 INFO L279 CegarLoopForPetriNet]: 401 programPoint places, 69 predicate places. [2025-03-04 06:50:54,373 INFO L471 AbstractCegarLoop]: Abstraction has has 470 places, 514 transitions, 1688 flow [2025-03-04 06:50:54,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 369.04347826086956) internal successors, (8488), 23 states have internal predecessors, (8488), 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-04 06:50:54,376 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:54,377 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:50:54,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 06:50:54,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:50:54,578 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-04 06:50:54,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:54,579 INFO L85 PathProgramCache]: Analyzing trace with hash 129842692, now seen corresponding path program 3 times [2025-03-04 06:50:54,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:54,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346120098] [2025-03-04 06:50:54,579 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 06:50:54,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:54,597 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 158 statements into 11 equivalence classes. [2025-03-04 06:50:54,687 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 158 of 158 statements. [2025-03-04 06:50:54,688 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 06:50:54,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:50:54,688 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:50:54,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-04 06:50:54,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-04 06:50:54,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:54,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:50:54,742 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:50:54,743 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:50:54,743 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2025-03-04 06:50:54,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (21 of 23 remaining) [2025-03-04 06:50:54,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (20 of 23 remaining) [2025-03-04 06:50:54,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (19 of 23 remaining) [2025-03-04 06:50:54,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (18 of 23 remaining) [2025-03-04 06:50:54,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (17 of 23 remaining) [2025-03-04 06:50:54,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (16 of 23 remaining) [2025-03-04 06:50:54,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (15 of 23 remaining) [2025-03-04 06:50:54,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (14 of 23 remaining) [2025-03-04 06:50:54,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (13 of 23 remaining) [2025-03-04 06:50:54,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 23 remaining) [2025-03-04 06:50:54,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (11 of 23 remaining) [2025-03-04 06:50:54,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (10 of 23 remaining) [2025-03-04 06:50:54,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (9 of 23 remaining) [2025-03-04 06:50:54,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (8 of 23 remaining) [2025-03-04 06:50:54,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (7 of 23 remaining) [2025-03-04 06:50:54,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 23 remaining) [2025-03-04 06:50:54,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 23 remaining) [2025-03-04 06:50:54,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 23 remaining) [2025-03-04 06:50:54,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (3 of 23 remaining) [2025-03-04 06:50:54,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 23 remaining) [2025-03-04 06:50:54,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 23 remaining) [2025-03-04 06:50:54,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 23 remaining) [2025-03-04 06:50:54,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:50:54,746 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1] [2025-03-04 06:50:54,748 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:50:54,748 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 06:50:54,793 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 06:50:54,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 501 places, 554 transitions, 1124 flow [2025-03-04 06:50:54,925 INFO L124 PetriNetUnfolderBase]: 113/1047 cut-off events. [2025-03-04 06:50:54,925 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 06:50:54,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1059 conditions, 1047 events. 113/1047 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6125 event pairs, 0 based on Foata normal form. 0/883 useless extension candidates. Maximal degree in co-relation 676. Up to 12 conditions per place. [2025-03-04 06:50:54,942 INFO L82 GeneralOperation]: Start removeDead. Operand has 501 places, 554 transitions, 1124 flow [2025-03-04 06:50:54,951 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 501 places, 554 transitions, 1124 flow [2025-03-04 06:50:54,952 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:50:54,952 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;@298ef5bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:50:54,952 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-03-04 06:50:54,958 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:50:54,958 INFO L124 PetriNetUnfolderBase]: 1/117 cut-off events. [2025-03-04 06:50:54,958 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:50:54,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:54,958 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] [2025-03-04 06:50:54,958 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-03-04 06:50:54,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:54,959 INFO L85 PathProgramCache]: Analyzing trace with hash 2041909694, now seen corresponding path program 1 times [2025-03-04 06:50:54,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:54,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063514111] [2025-03-04 06:50:54,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:54,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:54,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-04 06:50:54,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 06:50:54,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:54,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:55,023 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-04 06:50:55,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:55,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063514111] [2025-03-04 06:50:55,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063514111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:55,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:55,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:50:55,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091575305] [2025-03-04 06:50:55,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:55,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:50:55,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:55,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:50:55,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:50:55,036 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 554 [2025-03-04 06:50:55,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 501 places, 554 transitions, 1124 flow. Second operand has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 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-04 06:50:55,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:55,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 554 [2025-03-04 06:50:55,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:57,718 INFO L124 PetriNetUnfolderBase]: 3251/22680 cut-off events. [2025-03-04 06:50:57,718 INFO L125 PetriNetUnfolderBase]: For 151/155 co-relation queries the response was YES. [2025-03-04 06:50:57,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27460 conditions, 22680 events. 3251/22680 cut-off events. For 151/155 co-relation queries the response was YES. Maximal size of possible extension queue 558. Compared 307936 event pairs, 2680 based on Foata normal form. 4169/24938 useless extension candidates. Maximal degree in co-relation 24550. Up to 4707 conditions per place. [2025-03-04 06:50:57,884 INFO L140 encePairwiseOnDemand]: 503/554 looper letters, 41 selfloop transitions, 2 changer transitions 0/499 dead transitions. [2025-03-04 06:50:57,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 495 places, 499 transitions, 1100 flow [2025-03-04 06:50:57,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:50:57,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:50:57,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1472 transitions. [2025-03-04 06:50:57,887 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8856799037304453 [2025-03-04 06:50:57,887 INFO L175 Difference]: Start difference. First operand has 501 places, 554 transitions, 1124 flow. Second operand 3 states and 1472 transitions. [2025-03-04 06:50:57,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 495 places, 499 transitions, 1100 flow [2025-03-04 06:50:57,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 495 places, 499 transitions, 1100 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:50:57,893 INFO L231 Difference]: Finished difference. Result has 496 places, 499 transitions, 1024 flow [2025-03-04 06:50:57,893 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=1012, PETRI_DIFFERENCE_MINUEND_PLACES=493, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=498, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=496, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1024, PETRI_PLACES=496, PETRI_TRANSITIONS=499} [2025-03-04 06:50:57,894 INFO L279 CegarLoopForPetriNet]: 501 programPoint places, -5 predicate places. [2025-03-04 06:50:57,894 INFO L471 AbstractCegarLoop]: Abstraction has has 496 places, 499 transitions, 1024 flow [2025-03-04 06:50:57,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 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-04 06:50:57,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:57,895 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-04 06:50:57,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:50:57,895 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-03-04 06:50:57,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:57,896 INFO L85 PathProgramCache]: Analyzing trace with hash -595935019, now seen corresponding path program 1 times [2025-03-04 06:50:57,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:57,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263197333] [2025-03-04 06:50:57,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:57,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:57,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 06:50:57,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 06:50:57,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:57,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:57,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:57,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:57,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263197333] [2025-03-04 06:50:57,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263197333] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:50:57,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773769894] [2025-03-04 06:50:57,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:57,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:50:57,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:50:57,954 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:50:57,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 06:50:58,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 06:50:58,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 06:50:58,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:58,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:58,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 06:50:58,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:50:58,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:58,200 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:50:58,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:58,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773769894] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:50:58,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:50:58,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 06:50:58,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310810763] [2025-03-04 06:50:58,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:50:58,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:50:58,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:58,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:50:58,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:50:58,244 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 457 out of 554 [2025-03-04 06:50:58,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 496 places, 499 transitions, 1024 flow. Second operand has 10 states, 10 states have (on average 458.8) internal successors, (4588), 10 states have internal predecessors, (4588), 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-04 06:50:58,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:58,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 457 of 554 [2025-03-04 06:50:58,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:00,917 INFO L124 PetriNetUnfolderBase]: 3251/22687 cut-off events. [2025-03-04 06:51:00,918 INFO L125 PetriNetUnfolderBase]: For 152/156 co-relation queries the response was YES. [2025-03-04 06:51:01,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27486 conditions, 22687 events. 3251/22687 cut-off events. For 152/156 co-relation queries the response was YES. Maximal size of possible extension queue 558. Compared 307812 event pairs, 2680 based on Foata normal form. 2/20778 useless extension candidates. Maximal degree in co-relation 27390. Up to 4707 conditions per place. [2025-03-04 06:51:01,101 INFO L140 encePairwiseOnDemand]: 548/554 looper letters, 45 selfloop transitions, 9 changer transitions 0/507 dead transitions. [2025-03-04 06:51:01,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 504 places, 507 transitions, 1150 flow [2025-03-04 06:51:01,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:51:01,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 06:51:01,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 4169 transitions. [2025-03-04 06:51:01,109 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8361411953469715 [2025-03-04 06:51:01,109 INFO L175 Difference]: Start difference. First operand has 496 places, 499 transitions, 1024 flow. Second operand 9 states and 4169 transitions. [2025-03-04 06:51:01,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 504 places, 507 transitions, 1150 flow [2025-03-04 06:51:01,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 503 places, 507 transitions, 1148 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:51:01,117 INFO L231 Difference]: Finished difference. Result has 506 places, 505 transitions, 1072 flow [2025-03-04 06:51:01,117 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=1022, PETRI_DIFFERENCE_MINUEND_PLACES=495, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=493, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1072, PETRI_PLACES=506, PETRI_TRANSITIONS=505} [2025-03-04 06:51:01,121 INFO L279 CegarLoopForPetriNet]: 501 programPoint places, 5 predicate places. [2025-03-04 06:51:01,121 INFO L471 AbstractCegarLoop]: Abstraction has has 506 places, 505 transitions, 1072 flow [2025-03-04 06:51:01,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 458.8) internal successors, (4588), 10 states have internal predecessors, (4588), 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-04 06:51:01,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:01,123 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:51:01,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 06:51:01,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:51:01,324 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-03-04 06:51:01,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:01,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1533863541, now seen corresponding path program 2 times [2025-03-04 06:51:01,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:01,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405763602] [2025-03-04 06:51:01,324 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:51:01,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:01,333 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 108 statements into 2 equivalence classes. [2025-03-04 06:51:01,338 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 93 of 108 statements. [2025-03-04 06:51:01,338 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:51:01,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:01,706 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 06:51:01,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:01,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405763602] [2025-03-04 06:51:01,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405763602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:01,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:01,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:51:01,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850563693] [2025-03-04 06:51:01,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:01,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:51:01,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:01,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:51:01,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:51:02,129 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 554 [2025-03-04 06:51:02,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 506 places, 505 transitions, 1072 flow. Second operand has 6 states, 6 states have (on average 369.5) internal successors, (2217), 6 states have internal predecessors, (2217), 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-04 06:51:02,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:02,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 554 [2025-03-04 06:51:02,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand