./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_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_60-invariant_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 ca8ac8d2a0a0bfcebfb7f99229747142c166641dd0f1bf091ac2b4ae67e9ee75 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:50:16,792 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:50:16,840 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:16,844 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:50:16,844 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:50:16,858 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:50:16,860 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:50:16,860 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:50:16,860 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:50:16,860 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:50:16,861 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:50:16,861 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:50:16,862 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:50:16,862 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:50:16,862 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:50:16,862 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:50:16,862 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:50:16,862 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:50:16,862 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:50:16,862 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:50:16,863 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:50:16,863 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:50:16,863 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:50:16,863 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:50:16,863 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:50:16,863 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:50:16,863 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:50:16,863 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:50:16,863 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:50:16,863 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:50:16,863 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:50:16,863 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:50:16,864 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:50:16,864 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:50:16,864 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:50:16,864 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:50:16,864 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:50:16,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:50:16,864 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:50:16,864 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:50:16,865 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:50:16,865 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:50:16,865 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 -> ca8ac8d2a0a0bfcebfb7f99229747142c166641dd0f1bf091ac2b4ae67e9ee75 [2025-03-04 06:50:17,065 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:50:17,071 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:50:17,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:50:17,073 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:50:17,073 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:50:17,074 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.i [2025-03-04 06:50:18,201 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a2f94900/d129384a72a84d81861b7406517247ff/FLAGf6b27c5dc [2025-03-04 06:50:18,459 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:50:18,460 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.i [2025-03-04 06:50:18,467 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a2f94900/d129384a72a84d81861b7406517247ff/FLAGf6b27c5dc [2025-03-04 06:50:18,768 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a2f94900/d129384a72a84d81861b7406517247ff [2025-03-04 06:50:18,770 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:50:18,771 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:50:18,772 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:50:18,772 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:50:18,775 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:50:18,776 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:50:18" (1/1) ... [2025-03-04 06:50:18,777 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52273704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:18, skipping insertion in model container [2025-03-04 06:50:18,777 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:50:18" (1/1) ... [2025-03-04 06:50:18,801 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:50:19,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:50:19,036 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:50:19,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:50:19,104 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:50:19,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:19 WrapperNode [2025-03-04 06:50:19,105 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:50:19,106 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:50:19,106 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:50:19,106 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:50:19,110 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:19" (1/1) ... [2025-03-04 06:50:19,117 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:19" (1/1) ... [2025-03-04 06:50:19,132 INFO L138 Inliner]: procedures = 171, calls = 44, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 196 [2025-03-04 06:50:19,132 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:50:19,133 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:50:19,133 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:50:19,133 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:50:19,137 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:19" (1/1) ... [2025-03-04 06:50:19,137 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:19" (1/1) ... [2025-03-04 06:50:19,139 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:19" (1/1) ... [2025-03-04 06:50:19,140 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:19" (1/1) ... [2025-03-04 06:50:19,145 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:19" (1/1) ... [2025-03-04 06:50:19,145 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:19" (1/1) ... [2025-03-04 06:50:19,146 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:19" (1/1) ... [2025-03-04 06:50:19,147 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:19" (1/1) ... [2025-03-04 06:50:19,151 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:50:19,152 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:50:19,152 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:50:19,152 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:50:19,153 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:19" (1/1) ... [2025-03-04 06:50:19,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:50:19,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:50:19,177 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:19,179 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:19,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:50:19,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:50:19,198 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 06:50:19,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:50:19,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 06:50:19,198 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 06:50:19,198 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 06:50:19,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 06:50:19,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:50:19,198 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 06:50:19,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:50:19,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:50:19,199 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:19,283 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:50:19,284 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:50:19,513 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L711: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-04 06:50:19,514 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L711-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:19,588 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:50:19,588 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:50:19,632 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:50:19,633 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:50:19,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:50:19 BoogieIcfgContainer [2025-03-04 06:50:19,633 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:50:19,635 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:50:19,635 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:50:19,639 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:50:19,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:50:18" (1/3) ... [2025-03-04 06:50:19,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c98909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:50:19, skipping insertion in model container [2025-03-04 06:50:19,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:19" (2/3) ... [2025-03-04 06:50:19,640 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c98909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:50:19, skipping insertion in model container [2025-03-04 06:50:19,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:50:19" (3/3) ... [2025-03-04 06:50:19,641 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_60-invariant_racefree.i [2025-03-04 06:50:19,654 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:50:19,656 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_60-invariant_racefree.i that has 2 procedures, 184 locations, 1 initial locations, 8 loop locations, and 13 error locations. [2025-03-04 06:50:19,656 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:50:19,729 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 06:50:19,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 187 places, 206 transitions, 419 flow [2025-03-04 06:50:19,898 INFO L124 PetriNetUnfolderBase]: 32/302 cut-off events. [2025-03-04 06:50:19,901 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:50:19,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307 conditions, 302 events. 32/302 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1304 event pairs, 0 based on Foata normal form. 0/247 useless extension candidates. Maximal degree in co-relation 175. Up to 6 conditions per place. [2025-03-04 06:50:19,910 INFO L82 GeneralOperation]: Start removeDead. Operand has 187 places, 206 transitions, 419 flow [2025-03-04 06:50:19,917 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 187 places, 206 transitions, 419 flow [2025-03-04 06:50:19,923 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:50:19,937 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;@4d3e0c21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:50:19,938 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-03-04 06:50:19,950 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:50:19,951 INFO L124 PetriNetUnfolderBase]: 2/55 cut-off events. [2025-03-04 06:50:19,951 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:50:19,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:19,951 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] [2025-03-04 06:50:19,952 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-04 06:50:19,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:19,956 INFO L85 PathProgramCache]: Analyzing trace with hash 318758716, now seen corresponding path program 1 times [2025-03-04 06:50:19,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:19,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488096976] [2025-03-04 06:50:19,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:19,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:20,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 06:50:20,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 06:50:20,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:20,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:20,183 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:20,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:20,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488096976] [2025-03-04 06:50:20,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488096976] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:20,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:20,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:50:20,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391424659] [2025-03-04 06:50:20,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:20,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:50:20,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:20,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:50:20,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:50:20,256 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 206 [2025-03-04 06:50:20,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 206 transitions, 419 flow. Second operand has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 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:20,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:20,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 206 [2025-03-04 06:50:20,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:20,474 INFO L124 PetriNetUnfolderBase]: 110/1044 cut-off events. [2025-03-04 06:50:20,474 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 06:50:20,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1292 conditions, 1044 events. 110/1044 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 6624 event pairs, 88 based on Foata normal form. 130/1059 useless extension candidates. Maximal degree in co-relation 1222. Up to 232 conditions per place. [2025-03-04 06:50:20,482 INFO L140 encePairwiseOnDemand]: 183/206 looper letters, 32 selfloop transitions, 2 changer transitions 0/191 dead transitions. [2025-03-04 06:50:20,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 191 transitions, 457 flow [2025-03-04 06:50:20,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:50:20,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:50:20,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 542 transitions. [2025-03-04 06:50:20,496 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8770226537216829 [2025-03-04 06:50:20,497 INFO L175 Difference]: Start difference. First operand has 187 places, 206 transitions, 419 flow. Second operand 3 states and 542 transitions. [2025-03-04 06:50:20,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 191 transitions, 457 flow [2025-03-04 06:50:20,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 191 transitions, 457 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:50:20,505 INFO L231 Difference]: Finished difference. Result has 186 places, 182 transitions, 379 flow [2025-03-04 06:50:20,507 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=379, PETRI_PLACES=186, PETRI_TRANSITIONS=182} [2025-03-04 06:50:20,510 INFO L279 CegarLoopForPetriNet]: 187 programPoint places, -1 predicate places. [2025-03-04 06:50:20,511 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 182 transitions, 379 flow [2025-03-04 06:50:20,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 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:20,512 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:20,512 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:50:20,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:50:20,512 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-04 06:50:20,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:20,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1635674700, now seen corresponding path program 1 times [2025-03-04 06:50:20,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:20,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836248212] [2025-03-04 06:50:20,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:20,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:20,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 06:50:20,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 06:50:20,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:20,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:20,976 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:20,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:20,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836248212] [2025-03-04 06:50:20,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836248212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:20,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:20,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:50:20,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859531049] [2025-03-04 06:50:20,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:20,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:50:20,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:20,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:50:20,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:50:21,107 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 206 [2025-03-04 06:50:21,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 182 transitions, 379 flow. Second operand has 6 states, 6 states have (on average 148.5) internal successors, (891), 6 states have internal predecessors, (891), 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:21,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:21,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 206 [2025-03-04 06:50:21,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:21,342 INFO L124 PetriNetUnfolderBase]: 202/1288 cut-off events. [2025-03-04 06:50:21,343 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-04 06:50:21,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1763 conditions, 1288 events. 202/1288 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 8973 event pairs, 136 based on Foata normal form. 0/1167 useless extension candidates. Maximal degree in co-relation 1675. Up to 335 conditions per place. [2025-03-04 06:50:21,349 INFO L140 encePairwiseOnDemand]: 200/206 looper letters, 67 selfloop transitions, 5 changer transitions 0/217 dead transitions. [2025-03-04 06:50:21,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 217 transitions, 593 flow [2025-03-04 06:50:21,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:50:21,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:50:21,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 955 transitions. [2025-03-04 06:50:21,352 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7726537216828478 [2025-03-04 06:50:21,352 INFO L175 Difference]: Start difference. First operand has 186 places, 182 transitions, 379 flow. Second operand 6 states and 955 transitions. [2025-03-04 06:50:21,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 217 transitions, 593 flow [2025-03-04 06:50:21,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 217 transitions, 589 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:50:21,355 INFO L231 Difference]: Finished difference. Result has 188 places, 181 transitions, 383 flow [2025-03-04 06:50:21,355 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=383, PETRI_PLACES=188, PETRI_TRANSITIONS=181} [2025-03-04 06:50:21,355 INFO L279 CegarLoopForPetriNet]: 187 programPoint places, 1 predicate places. [2025-03-04 06:50:21,356 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 181 transitions, 383 flow [2025-03-04 06:50:21,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 148.5) internal successors, (891), 6 states have internal predecessors, (891), 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:21,356 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:21,356 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] [2025-03-04 06:50:21,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:50:21,356 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-04 06:50:21,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:21,357 INFO L85 PathProgramCache]: Analyzing trace with hash -892992535, now seen corresponding path program 1 times [2025-03-04 06:50:21,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:21,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095485862] [2025-03-04 06:50:21,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:21,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:21,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 06:50:21,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 06:50:21,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:21,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:21,408 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:21,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:21,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095485862] [2025-03-04 06:50:21,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095485862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:21,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:21,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:50:21,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258493677] [2025-03-04 06:50:21,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:21,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:50:21,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:21,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:50:21,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:50:21,444 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 206 [2025-03-04 06:50:21,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 181 transitions, 383 flow. Second operand has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 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:21,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:21,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 206 [2025-03-04 06:50:21,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:21,685 INFO L124 PetriNetUnfolderBase]: 442/2616 cut-off events. [2025-03-04 06:50:21,686 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-04 06:50:21,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3608 conditions, 2616 events. 442/2616 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 21173 event pairs, 169 based on Foata normal form. 0/2368 useless extension candidates. Maximal degree in co-relation 3546. Up to 608 conditions per place. [2025-03-04 06:50:21,696 INFO L140 encePairwiseOnDemand]: 181/206 looper letters, 62 selfloop transitions, 18 changer transitions 0/217 dead transitions. [2025-03-04 06:50:21,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 217 transitions, 618 flow [2025-03-04 06:50:21,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:50:21,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:50:21,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 507 transitions. [2025-03-04 06:50:21,698 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8203883495145631 [2025-03-04 06:50:21,698 INFO L175 Difference]: Start difference. First operand has 188 places, 181 transitions, 383 flow. Second operand 3 states and 507 transitions. [2025-03-04 06:50:21,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 217 transitions, 618 flow [2025-03-04 06:50:21,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 217 transitions, 608 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:50:21,701 INFO L231 Difference]: Finished difference. Result has 187 places, 199 transitions, 531 flow [2025-03-04 06:50:21,702 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=531, PETRI_PLACES=187, PETRI_TRANSITIONS=199} [2025-03-04 06:50:21,702 INFO L279 CegarLoopForPetriNet]: 187 programPoint places, 0 predicate places. [2025-03-04 06:50:21,702 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 199 transitions, 531 flow [2025-03-04 06:50:21,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 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:21,703 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:21,703 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-03-04 06:50:21,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:50:21,703 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-04 06:50:21,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:21,703 INFO L85 PathProgramCache]: Analyzing trace with hash 509166585, now seen corresponding path program 1 times [2025-03-04 06:50:21,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:21,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383867999] [2025-03-04 06:50:21,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:21,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:21,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 06:50:21,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 06:50:21,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:21,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:50:21,730 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:50:21,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 06:50:21,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 06:50:21,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:21,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:50:21,761 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:50:21,762 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:50:21,763 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 20 remaining) [2025-03-04 06:50:21,764 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (18 of 20 remaining) [2025-03-04 06:50:21,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (17 of 20 remaining) [2025-03-04 06:50:21,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (16 of 20 remaining) [2025-03-04 06:50:21,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (15 of 20 remaining) [2025-03-04 06:50:21,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (14 of 20 remaining) [2025-03-04 06:50:21,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (13 of 20 remaining) [2025-03-04 06:50:21,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 20 remaining) [2025-03-04 06:50:21,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (11 of 20 remaining) [2025-03-04 06:50:21,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (10 of 20 remaining) [2025-03-04 06:50:21,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (9 of 20 remaining) [2025-03-04 06:50:21,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (8 of 20 remaining) [2025-03-04 06:50:21,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 20 remaining) [2025-03-04 06:50:21,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 20 remaining) [2025-03-04 06:50:21,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (5 of 20 remaining) [2025-03-04 06:50:21,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 20 remaining) [2025-03-04 06:50:21,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (3 of 20 remaining) [2025-03-04 06:50:21,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 20 remaining) [2025-03-04 06:50:21,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (1 of 20 remaining) [2025-03-04 06:50:21,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 20 remaining) [2025-03-04 06:50:21,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:50:21,766 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-04 06:50:21,769 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:50:21,770 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 06:50:21,812 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 06:50:21,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 255 places, 284 transitions, 584 flow [2025-03-04 06:50:21,873 INFO L124 PetriNetUnfolderBase]: 55/503 cut-off events. [2025-03-04 06:50:21,873 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 06:50:21,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 515 conditions, 503 events. 55/503 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2366 event pairs, 0 based on Foata normal form. 0/410 useless extension candidates. Maximal degree in co-relation 304. Up to 9 conditions per place. [2025-03-04 06:50:21,876 INFO L82 GeneralOperation]: Start removeDead. Operand has 255 places, 284 transitions, 584 flow [2025-03-04 06:50:21,882 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 255 places, 284 transitions, 584 flow [2025-03-04 06:50:21,883 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:50:21,883 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;@4d3e0c21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:50:21,883 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-04 06:50:21,891 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:50:21,891 INFO L124 PetriNetUnfolderBase]: 2/55 cut-off events. [2025-03-04 06:50:21,891 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:50:21,892 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:21,892 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] [2025-03-04 06:50:21,892 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-04 06:50:21,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:21,892 INFO L85 PathProgramCache]: Analyzing trace with hash -281171880, now seen corresponding path program 1 times [2025-03-04 06:50:21,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:21,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467859535] [2025-03-04 06:50:21,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:21,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:21,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 06:50:21,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 06:50:21,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:21,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:21,940 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:21,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:21,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467859535] [2025-03-04 06:50:21,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467859535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:21,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:21,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:50:21,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267114860] [2025-03-04 06:50:21,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:21,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:50:21,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:21,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:50:21,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:50:21,960 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 284 [2025-03-04 06:50:21,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 284 transitions, 584 flow. Second operand has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 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:21,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:21,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 284 [2025-03-04 06:50:21,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:23,047 INFO L124 PetriNetUnfolderBase]: 2529/12644 cut-off events. [2025-03-04 06:50:23,047 INFO L125 PetriNetUnfolderBase]: For 107/107 co-relation queries the response was YES. [2025-03-04 06:50:23,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16552 conditions, 12644 events. 2529/12644 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 147936 event pairs, 1098 based on Foata normal form. 2229/13422 useless extension candidates. Maximal degree in co-relation 1788. Up to 3840 conditions per place. [2025-03-04 06:50:23,123 INFO L140 encePairwiseOnDemand]: 251/284 looper letters, 44 selfloop transitions, 2 changer transitions 0/258 dead transitions. [2025-03-04 06:50:23,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 258 transitions, 624 flow [2025-03-04 06:50:23,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:50:23,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:50:23,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 732 transitions. [2025-03-04 06:50:23,161 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8591549295774648 [2025-03-04 06:50:23,161 INFO L175 Difference]: Start difference. First operand has 255 places, 284 transitions, 584 flow. Second operand 3 states and 732 transitions. [2025-03-04 06:50:23,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 258 transitions, 624 flow [2025-03-04 06:50:23,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 258 transitions, 624 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:50:23,167 INFO L231 Difference]: Finished difference. Result has 252 places, 249 transitions, 524 flow [2025-03-04 06:50:23,167 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=524, PETRI_PLACES=252, PETRI_TRANSITIONS=249} [2025-03-04 06:50:23,168 INFO L279 CegarLoopForPetriNet]: 255 programPoint places, -3 predicate places. [2025-03-04 06:50:23,168 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 249 transitions, 524 flow [2025-03-04 06:50:23,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 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:23,169 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:23,169 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:50:23,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:50:23,170 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-04 06:50:23,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:23,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1651616592, now seen corresponding path program 1 times [2025-03-04 06:50:23,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:23,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516783663] [2025-03-04 06:50:23,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:23,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:23,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 06:50:23,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 06:50:23,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:23,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:23,437 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:23,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:23,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516783663] [2025-03-04 06:50:23,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516783663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:23,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:23,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:50:23,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060510410] [2025-03-04 06:50:23,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:23,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:50:23,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:23,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:50:23,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:50:23,516 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 284 [2025-03-04 06:50:23,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 249 transitions, 524 flow. Second operand has 6 states, 6 states have (on average 204.5) internal successors, (1227), 6 states have internal predecessors, (1227), 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:23,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:23,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 284 [2025-03-04 06:50:23,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:25,063 INFO L124 PetriNetUnfolderBase]: 4384/17032 cut-off events. [2025-03-04 06:50:25,064 INFO L125 PetriNetUnfolderBase]: For 251/251 co-relation queries the response was YES. [2025-03-04 06:50:25,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24198 conditions, 17032 events. 4384/17032 cut-off events. For 251/251 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 200839 event pairs, 2104 based on Foata normal form. 0/15347 useless extension candidates. Maximal degree in co-relation 21730. Up to 5258 conditions per place. [2025-03-04 06:50:25,153 INFO L140 encePairwiseOnDemand]: 278/284 looper letters, 114 selfloop transitions, 6 changer transitions 0/320 dead transitions. [2025-03-04 06:50:25,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 320 transitions, 906 flow [2025-03-04 06:50:25,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:50:25,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:50:25,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1338 transitions. [2025-03-04 06:50:25,158 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7852112676056338 [2025-03-04 06:50:25,158 INFO L175 Difference]: Start difference. First operand has 252 places, 249 transitions, 524 flow. Second operand 6 states and 1338 transitions. [2025-03-04 06:50:25,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 320 transitions, 906 flow [2025-03-04 06:50:25,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 320 transitions, 904 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:50:25,162 INFO L231 Difference]: Finished difference. Result has 255 places, 248 transitions, 532 flow [2025-03-04 06:50:25,162 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=532, PETRI_PLACES=255, PETRI_TRANSITIONS=248} [2025-03-04 06:50:25,163 INFO L279 CegarLoopForPetriNet]: 255 programPoint places, 0 predicate places. [2025-03-04 06:50:25,163 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 248 transitions, 532 flow [2025-03-04 06:50:25,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 204.5) internal successors, (1227), 6 states have internal predecessors, (1227), 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:25,164 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:25,164 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] [2025-03-04 06:50:25,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:50:25,164 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-04 06:50:25,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:25,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1884720697, now seen corresponding path program 1 times [2025-03-04 06:50:25,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:25,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498748029] [2025-03-04 06:50:25,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:25,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:25,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 06:50:25,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 06:50:25,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:25,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:25,190 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:25,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:25,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498748029] [2025-03-04 06:50:25,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498748029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:25,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:25,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:50:25,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60753881] [2025-03-04 06:50:25,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:25,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:50:25,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:25,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:50:25,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:50:25,236 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 284 [2025-03-04 06:50:25,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 248 transitions, 532 flow. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:25,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:25,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 284 [2025-03-04 06:50:25,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:31,014 INFO L124 PetriNetUnfolderBase]: 26162/85797 cut-off events. [2025-03-04 06:50:31,014 INFO L125 PetriNetUnfolderBase]: For 550/550 co-relation queries the response was YES. [2025-03-04 06:50:31,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128092 conditions, 85797 events. 26162/85797 cut-off events. For 550/550 co-relation queries the response was YES. Maximal size of possible extension queue 1636. Compared 1197229 event pairs, 10776 based on Foata normal form. 0/76732 useless extension candidates. Maximal degree in co-relation 124370. Up to 26496 conditions per place. [2025-03-04 06:50:31,490 INFO L140 encePairwiseOnDemand]: 245/284 looper letters, 98 selfloop transitions, 28 changer transitions 0/305 dead transitions. [2025-03-04 06:50:31,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 305 transitions, 909 flow [2025-03-04 06:50:31,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:50:31,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:50:31,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 683 transitions. [2025-03-04 06:50:31,492 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8016431924882629 [2025-03-04 06:50:31,492 INFO L175 Difference]: Start difference. First operand has 255 places, 248 transitions, 532 flow. Second operand 3 states and 683 transitions. [2025-03-04 06:50:31,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 305 transitions, 909 flow [2025-03-04 06:50:31,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 305 transitions, 897 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:50:31,500 INFO L231 Difference]: Finished difference. Result has 254 places, 276 transitions, 766 flow [2025-03-04 06:50:31,501 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=766, PETRI_PLACES=254, PETRI_TRANSITIONS=276} [2025-03-04 06:50:31,502 INFO L279 CegarLoopForPetriNet]: 255 programPoint places, -1 predicate places. [2025-03-04 06:50:31,503 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 276 transitions, 766 flow [2025-03-04 06:50:31,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:31,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:31,504 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] [2025-03-04 06:50:31,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:50:31,504 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-04 06:50:31,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:31,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1292104750, now seen corresponding path program 1 times [2025-03-04 06:50:31,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:31,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322069649] [2025-03-04 06:50:31,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:31,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:31,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 06:50:31,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 06:50:31,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:31,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:31,572 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:31,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:31,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322069649] [2025-03-04 06:50:31,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322069649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:31,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:31,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:50:31,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447759995] [2025-03-04 06:50:31,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:31,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:50:31,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:31,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:50:31,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:50:31,602 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 284 [2025-03-04 06:50:31,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 276 transitions, 766 flow. Second operand has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 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:31,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:31,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 284 [2025-03-04 06:50:31,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:36,807 INFO L124 PetriNetUnfolderBase]: 15075/68778 cut-off events. [2025-03-04 06:50:36,808 INFO L125 PetriNetUnfolderBase]: For 4907/5192 co-relation queries the response was YES. [2025-03-04 06:50:36,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103712 conditions, 68778 events. 15075/68778 cut-off events. For 4907/5192 co-relation queries the response was YES. Maximal size of possible extension queue 1324. Compared 1027005 event pairs, 4546 based on Foata normal form. 10/61939 useless extension candidates. Maximal degree in co-relation 23857. Up to 14752 conditions per place. [2025-03-04 06:50:37,125 INFO L140 encePairwiseOnDemand]: 279/284 looper letters, 81 selfloop transitions, 5 changer transitions 0/323 dead transitions. [2025-03-04 06:50:37,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 323 transitions, 1032 flow [2025-03-04 06:50:37,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:50:37,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:50:37,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1365 transitions. [2025-03-04 06:50:37,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.801056338028169 [2025-03-04 06:50:37,127 INFO L175 Difference]: Start difference. First operand has 254 places, 276 transitions, 766 flow. Second operand 6 states and 1365 transitions. [2025-03-04 06:50:37,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 323 transitions, 1032 flow [2025-03-04 06:50:37,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 323 transitions, 976 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:50:37,176 INFO L231 Difference]: Finished difference. Result has 260 places, 278 transitions, 736 flow [2025-03-04 06:50:37,176 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=710, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=736, PETRI_PLACES=260, PETRI_TRANSITIONS=278} [2025-03-04 06:50:37,177 INFO L279 CegarLoopForPetriNet]: 255 programPoint places, 5 predicate places. [2025-03-04 06:50:37,177 INFO L471 AbstractCegarLoop]: Abstraction has has 260 places, 278 transitions, 736 flow [2025-03-04 06:50:37,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 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:37,177 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:37,177 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] [2025-03-04 06:50:37,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:50:37,178 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-04 06:50:37,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:37,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1099925653, now seen corresponding path program 1 times [2025-03-04 06:50:37,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:37,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225660200] [2025-03-04 06:50:37,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:37,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:37,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 06:50:37,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 06:50:37,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:37,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:37,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 06:50:37,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:37,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225660200] [2025-03-04 06:50:37,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225660200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:37,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:37,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:50:37,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127207848] [2025-03-04 06:50:37,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:37,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:50:37,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:37,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:50:37,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:50:37,270 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 284 [2025-03-04 06:50:37,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 278 transitions, 736 flow. Second operand has 3 states, 3 states have (on average 212.33333333333334) internal successors, (637), 3 states have internal predecessors, (637), 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:37,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:37,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 284 [2025-03-04 06:50:37,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:43,973 INFO L124 PetriNetUnfolderBase]: 21531/91650 cut-off events. [2025-03-04 06:50:43,974 INFO L125 PetriNetUnfolderBase]: For 850/897 co-relation queries the response was YES. [2025-03-04 06:50:44,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133919 conditions, 91650 events. 21531/91650 cut-off events. For 850/897 co-relation queries the response was YES. Maximal size of possible extension queue 2105. Compared 1419704 event pairs, 9881 based on Foata normal form. 0/81370 useless extension candidates. Maximal degree in co-relation 133782. Up to 17172 conditions per place. [2025-03-04 06:50:44,562 INFO L140 encePairwiseOnDemand]: 273/284 looper letters, 65 selfloop transitions, 9 changer transitions 0/309 dead transitions. [2025-03-04 06:50:44,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 309 transitions, 948 flow [2025-03-04 06:50:44,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:50:44,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:50:44,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 706 transitions. [2025-03-04 06:50:44,564 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8286384976525821 [2025-03-04 06:50:44,564 INFO L175 Difference]: Start difference. First operand has 260 places, 278 transitions, 736 flow. Second operand 3 states and 706 transitions. [2025-03-04 06:50:44,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 309 transitions, 948 flow [2025-03-04 06:50:44,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 309 transitions, 942 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 06:50:44,576 INFO L231 Difference]: Finished difference. Result has 261 places, 283 transitions, 790 flow [2025-03-04 06:50:44,576 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=790, PETRI_PLACES=261, PETRI_TRANSITIONS=283} [2025-03-04 06:50:44,577 INFO L279 CegarLoopForPetriNet]: 255 programPoint places, 6 predicate places. [2025-03-04 06:50:44,577 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 283 transitions, 790 flow [2025-03-04 06:50:44,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.33333333333334) internal successors, (637), 3 states have internal predecessors, (637), 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:44,577 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:44,578 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-04 06:50:44,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:50:44,578 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-04 06:50:44,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:44,578 INFO L85 PathProgramCache]: Analyzing trace with hash 149864189, now seen corresponding path program 1 times [2025-03-04 06:50:44,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:44,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287640131] [2025-03-04 06:50:44,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:44,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:44,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 06:50:44,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 06:50:44,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:44,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:50:44,606 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:50:44,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 06:50:44,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 06:50:44,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:44,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:50:44,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:50:44,623 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:50:44,623 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 26 remaining) [2025-03-04 06:50:44,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (24 of 26 remaining) [2025-03-04 06:50:44,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (23 of 26 remaining) [2025-03-04 06:50:44,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (22 of 26 remaining) [2025-03-04 06:50:44,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (21 of 26 remaining) [2025-03-04 06:50:44,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (20 of 26 remaining) [2025-03-04 06:50:44,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (19 of 26 remaining) [2025-03-04 06:50:44,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (18 of 26 remaining) [2025-03-04 06:50:44,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (17 of 26 remaining) [2025-03-04 06:50:44,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (16 of 26 remaining) [2025-03-04 06:50:44,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (15 of 26 remaining) [2025-03-04 06:50:44,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (14 of 26 remaining) [2025-03-04 06:50:44,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (13 of 26 remaining) [2025-03-04 06:50:44,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (12 of 26 remaining) [2025-03-04 06:50:44,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (11 of 26 remaining) [2025-03-04 06:50:44,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (10 of 26 remaining) [2025-03-04 06:50:44,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (9 of 26 remaining) [2025-03-04 06:50:44,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (8 of 26 remaining) [2025-03-04 06:50:44,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 26 remaining) [2025-03-04 06:50:44,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 26 remaining) [2025-03-04 06:50:44,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (5 of 26 remaining) [2025-03-04 06:50:44,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 26 remaining) [2025-03-04 06:50:44,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (3 of 26 remaining) [2025-03-04 06:50:44,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 26 remaining) [2025-03-04 06:50:44,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (1 of 26 remaining) [2025-03-04 06:50:44,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 26 remaining) [2025-03-04 06:50:44,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:50:44,625 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-04 06:50:44,630 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:50:44,631 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 06:50:44,667 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 06:50:44,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 323 places, 362 transitions, 751 flow [2025-03-04 06:50:44,757 INFO L124 PetriNetUnfolderBase]: 81/747 cut-off events. [2025-03-04 06:50:44,757 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-04 06:50:44,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 772 conditions, 747 events. 81/747 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3646 event pairs, 1 based on Foata normal form. 0/612 useless extension candidates. Maximal degree in co-relation 511. Up to 12 conditions per place. [2025-03-04 06:50:44,775 INFO L82 GeneralOperation]: Start removeDead. Operand has 323 places, 362 transitions, 751 flow [2025-03-04 06:50:44,785 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 323 places, 362 transitions, 751 flow [2025-03-04 06:50:44,786 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:50:44,786 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;@4d3e0c21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:50:44,787 INFO L334 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2025-03-04 06:50:44,790 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:50:44,790 INFO L124 PetriNetUnfolderBase]: 2/55 cut-off events. [2025-03-04 06:50:44,790 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:50:44,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:44,791 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] [2025-03-04 06:50:44,791 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-03-04 06:50:44,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:44,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1650797118, now seen corresponding path program 1 times [2025-03-04 06:50:44,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:44,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846901928] [2025-03-04 06:50:44,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:44,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:44,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 06:50:44,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 06:50:44,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:44,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:44,834 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:44,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:44,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846901928] [2025-03-04 06:50:44,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846901928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:44,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:44,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:50:44,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10734519] [2025-03-04 06:50:44,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:44,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:50:44,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:44,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:50:44,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:50:44,857 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 362 [2025-03-04 06:50:44,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 362 transitions, 751 flow. Second operand has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 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:44,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:44,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 362 [2025-03-04 06:50:44,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:57,687 INFO L124 PetriNetUnfolderBase]: 39301/143651 cut-off events. [2025-03-04 06:50:57,687 INFO L125 PetriNetUnfolderBase]: For 1786/1786 co-relation queries the response was YES. [2025-03-04 06:50:58,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197108 conditions, 143651 events. 39301/143651 cut-off events. For 1786/1786 co-relation queries the response was YES. Maximal size of possible extension queue 2929. Compared 2248273 event pairs, 36032 based on Foata normal form. 30998/158400 useless extension candidates. Maximal degree in co-relation 159621. Up to 52627 conditions per place. [2025-03-04 06:50:58,910 INFO L140 encePairwiseOnDemand]: 319/362 looper letters, 55 selfloop transitions, 2 changer transitions 0/324 dead transitions. [2025-03-04 06:50:58,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 324 transitions, 789 flow [2025-03-04 06:50:58,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:50:58,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:50:58,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 921 transitions. [2025-03-04 06:50:58,912 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8480662983425414 [2025-03-04 06:50:58,912 INFO L175 Difference]: Start difference. First operand has 323 places, 362 transitions, 751 flow. Second operand 3 states and 921 transitions. [2025-03-04 06:50:58,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 324 transitions, 789 flow [2025-03-04 06:50:58,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 324 transitions, 789 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:50:58,918 INFO L231 Difference]: Finished difference. Result has 318 places, 315 transitions, 667 flow [2025-03-04 06:50:58,918 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=667, PETRI_PLACES=318, PETRI_TRANSITIONS=315} [2025-03-04 06:50:58,919 INFO L279 CegarLoopForPetriNet]: 323 programPoint places, -5 predicate places. [2025-03-04 06:50:58,919 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 315 transitions, 667 flow [2025-03-04 06:50:58,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 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,920 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:58,920 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:50:58,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:50:58,920 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-03-04 06:50:58,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:58,920 INFO L85 PathProgramCache]: Analyzing trace with hash -298232966, now seen corresponding path program 1 times [2025-03-04 06:50:58,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:58,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747095220] [2025-03-04 06:50:58,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:58,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:58,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 06:50:58,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 06:50:58,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:58,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:59,221 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:59,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:59,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747095220] [2025-03-04 06:50:59,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747095220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:59,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:59,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:50:59,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199270258] [2025-03-04 06:50:59,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:59,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:50:59,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:59,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:50:59,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:50:59,297 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 362 [2025-03-04 06:50:59,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 315 transitions, 667 flow. Second operand has 6 states, 6 states have (on average 260.5) internal successors, (1563), 6 states have internal predecessors, (1563), 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:59,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:59,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 362 [2025-03-04 06:50:59,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand