./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_61-invariant_racing-2.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_61-invariant_racing-2.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 3465c34fa1c26a5c7a3494350123ab41e5828c33cb08ac3f67b81737d460e559 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:50:20,112 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:50:20,154 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:20,160 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:50:20,163 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:50:20,185 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:50:20,187 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:50:20,187 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:50:20,188 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:50:20,188 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:50:20,189 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:50:20,189 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:50:20,189 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:50:20,189 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:50:20,190 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:50:20,190 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:50:20,190 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:50:20,190 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:50:20,190 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:50:20,190 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:50:20,190 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:50:20,190 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:50:20,190 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:50:20,190 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:50:20,190 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:50:20,190 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:50:20,191 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:50:20,191 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:50:20,191 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:50:20,191 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:50:20,192 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:50:20,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:50:20,192 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:50:20,192 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:50:20,192 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:50:20,192 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:50:20,192 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:50:20,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:50:20,192 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:50:20,192 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:50:20,192 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:50:20,192 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:50:20,192 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 -> 3465c34fa1c26a5c7a3494350123ab41e5828c33cb08ac3f67b81737d460e559 [2025-03-04 06:50:20,403 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:50:20,411 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:50:20,413 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:50:20,414 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:50:20,414 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:50:20,416 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_61-invariant_racing-2.i [2025-03-04 06:50:21,553 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fc414ac8/e2587f82f1104bcf8f2eb9681421c274/FLAGab10c8d7f [2025-03-04 06:50:21,891 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:50:21,893 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_61-invariant_racing-2.i [2025-03-04 06:50:21,907 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fc414ac8/e2587f82f1104bcf8f2eb9681421c274/FLAGab10c8d7f [2025-03-04 06:50:22,129 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fc414ac8/e2587f82f1104bcf8f2eb9681421c274 [2025-03-04 06:50:22,132 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:50:22,133 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:50:22,135 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:50:22,135 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:50:22,139 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:50:22,140 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:50:22" (1/1) ... [2025-03-04 06:50:22,140 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@730c8580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:22, skipping insertion in model container [2025-03-04 06:50:22,140 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:50:22" (1/1) ... [2025-03-04 06:50:22,166 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:50:22,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:50:22,415 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:50:22,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:50:22,468 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:50:22,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:22 WrapperNode [2025-03-04 06:50:22,469 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:50:22,471 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:50:22,471 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:50:22,471 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:50:22,475 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:22" (1/1) ... [2025-03-04 06:50:22,492 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:22" (1/1) ... [2025-03-04 06:50:22,513 INFO L138 Inliner]: procedures = 171, calls = 41, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 123 [2025-03-04 06:50:22,514 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:50:22,515 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:50:22,515 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:50:22,516 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:50:22,521 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:22" (1/1) ... [2025-03-04 06:50:22,521 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:22" (1/1) ... [2025-03-04 06:50:22,523 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:22" (1/1) ... [2025-03-04 06:50:22,526 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:22" (1/1) ... [2025-03-04 06:50:22,536 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:22" (1/1) ... [2025-03-04 06:50:22,537 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:22" (1/1) ... [2025-03-04 06:50:22,542 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:22" (1/1) ... [2025-03-04 06:50:22,542 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:22" (1/1) ... [2025-03-04 06:50:22,544 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:50:22,544 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:50:22,544 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:50:22,544 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:50:22,545 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:22" (1/1) ... [2025-03-04 06:50:22,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:50:22,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:50:22,568 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:22,571 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:22,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:50:22,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:50:22,586 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 06:50:22,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:50:22,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 06:50:22,586 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 06:50:22,586 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 06:50:22,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 06:50:22,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:50:22,586 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 06:50:22,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:50:22,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:50:22,587 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:22,665 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:50:22,667 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:50:22,856 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L710: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-04 06:50:22,856 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L710-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:22,896 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:50:22,896 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:50:22,926 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:50:22,927 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:50:22,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:50:22 BoogieIcfgContainer [2025-03-04 06:50:22,927 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:50:22,929 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:50:22,930 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:50:22,933 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:50:22,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:50:22" (1/3) ... [2025-03-04 06:50:22,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24c5b26d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:50:22, skipping insertion in model container [2025-03-04 06:50:22,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:22" (2/3) ... [2025-03-04 06:50:22,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24c5b26d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:50:22, skipping insertion in model container [2025-03-04 06:50:22,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:50:22" (3/3) ... [2025-03-04 06:50:22,935 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_61-invariant_racing-2.i [2025-03-04 06:50:22,945 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:50:22,947 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_61-invariant_racing-2.i that has 2 procedures, 165 locations, 1 initial locations, 7 loop locations, and 12 error locations. [2025-03-04 06:50:22,947 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:50:23,006 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 06:50:23,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 168 places, 183 transitions, 373 flow [2025-03-04 06:50:23,112 INFO L124 PetriNetUnfolderBase]: 28/279 cut-off events. [2025-03-04 06:50:23,114 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:50:23,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284 conditions, 279 events. 28/279 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1123 event pairs, 0 based on Foata normal form. 0/229 useless extension candidates. Maximal degree in co-relation 152. Up to 6 conditions per place. [2025-03-04 06:50:23,123 INFO L82 GeneralOperation]: Start removeDead. Operand has 168 places, 183 transitions, 373 flow [2025-03-04 06:50:23,129 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 168 places, 183 transitions, 373 flow [2025-03-04 06:50:23,135 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:50:23,146 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;@69bbc708, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:50:23,148 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-04 06:50:23,160 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:50:23,161 INFO L124 PetriNetUnfolderBase]: 2/49 cut-off events. [2025-03-04 06:50:23,161 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:50:23,162 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:23,162 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] [2025-03-04 06:50:23,163 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-03-04 06:50:23,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:23,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1700766936, 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,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344971967] [2025-03-04 06:50:23,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:23,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:23,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 06:50:23,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 06:50:23,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:23,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:23,388 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,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:23,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344971967] [2025-03-04 06:50:23,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344971967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:23,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:23,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:50:23,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080042812] [2025-03-04 06:50:23,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:23,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:50:23,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:23,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:50:23,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:50:23,450 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 183 [2025-03-04 06:50:23,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 183 transitions, 373 flow. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 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,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:23,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 183 [2025-03-04 06:50:23,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:23,615 INFO L124 PetriNetUnfolderBase]: 86/840 cut-off events. [2025-03-04 06:50:23,615 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 06:50:23,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1038 conditions, 840 events. 86/840 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4799 event pairs, 66 based on Foata normal form. 87/839 useless extension candidates. Maximal degree in co-relation 968. Up to 184 conditions per place. [2025-03-04 06:50:23,624 INFO L140 encePairwiseOnDemand]: 164/183 looper letters, 28 selfloop transitions, 2 changer transitions 0/172 dead transitions. [2025-03-04 06:50:23,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 172 transitions, 411 flow [2025-03-04 06:50:23,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:50:23,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:50:23,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 482 transitions. [2025-03-04 06:50:23,639 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8779599271402551 [2025-03-04 06:50:23,641 INFO L175 Difference]: Start difference. First operand has 168 places, 183 transitions, 373 flow. Second operand 3 states and 482 transitions. [2025-03-04 06:50:23,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 172 transitions, 411 flow [2025-03-04 06:50:23,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 172 transitions, 411 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:50:23,649 INFO L231 Difference]: Finished difference. Result has 169 places, 165 transitions, 345 flow [2025-03-04 06:50:23,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=345, PETRI_PLACES=169, PETRI_TRANSITIONS=165} [2025-03-04 06:50:23,654 INFO L279 CegarLoopForPetriNet]: 168 programPoint places, 1 predicate places. [2025-03-04 06:50:23,655 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 165 transitions, 345 flow [2025-03-04 06:50:23,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 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,656 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:23,656 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,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:50:23,657 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-03-04 06:50:23,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:23,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1247261995, now seen corresponding path program 1 times [2025-03-04 06:50:23,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:23,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693235198] [2025-03-04 06:50:23,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:23,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:23,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 06:50:23,690 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,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:23,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:24,105 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:24,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:24,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693235198] [2025-03-04 06:50:24,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693235198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:24,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:24,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:50:24,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504448347] [2025-03-04 06:50:24,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:24,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:50:24,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:24,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:50:24,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:50:24,206 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 183 [2025-03-04 06:50:24,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 165 transitions, 345 flow. Second operand has 6 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 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:24,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:24,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 183 [2025-03-04 06:50:24,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:24,367 INFO L124 PetriNetUnfolderBase]: 157/1045 cut-off events. [2025-03-04 06:50:24,367 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-03-04 06:50:24,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1426 conditions, 1045 events. 157/1045 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 6734 event pairs, 102 based on Foata normal form. 0/949 useless extension candidates. Maximal degree in co-relation 1341. Up to 267 conditions per place. [2025-03-04 06:50:24,373 INFO L140 encePairwiseOnDemand]: 177/183 looper letters, 57 selfloop transitions, 5 changer transitions 0/192 dead transitions. [2025-03-04 06:50:24,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 192 transitions, 523 flow [2025-03-04 06:50:24,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:50:24,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:50:24,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 849 transitions. [2025-03-04 06:50:24,378 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.773224043715847 [2025-03-04 06:50:24,378 INFO L175 Difference]: Start difference. First operand has 169 places, 165 transitions, 345 flow. Second operand 6 states and 849 transitions. [2025-03-04 06:50:24,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 192 transitions, 523 flow [2025-03-04 06:50:24,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 192 transitions, 519 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:50:24,382 INFO L231 Difference]: Finished difference. Result has 171 places, 164 transitions, 349 flow [2025-03-04 06:50:24,383 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=349, PETRI_PLACES=171, PETRI_TRANSITIONS=164} [2025-03-04 06:50:24,384 INFO L279 CegarLoopForPetriNet]: 168 programPoint places, 3 predicate places. [2025-03-04 06:50:24,384 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 164 transitions, 349 flow [2025-03-04 06:50:24,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 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:24,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:24,385 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:24,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:50:24,385 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-03-04 06:50:24,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:24,386 INFO L85 PathProgramCache]: Analyzing trace with hash -2138627647, now seen corresponding path program 1 times [2025-03-04 06:50:24,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:24,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277104061] [2025-03-04 06:50:24,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:24,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:24,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 06:50:24,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 06:50:24,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:24,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:24,420 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:24,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:24,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277104061] [2025-03-04 06:50:24,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277104061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:24,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:24,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:50:24,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078564134] [2025-03-04 06:50:24,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:24,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:50:24,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:24,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:50:24,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:50:24,460 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 183 [2025-03-04 06:50:24,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 164 transitions, 349 flow. Second operand has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 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:24,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:24,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 183 [2025-03-04 06:50:24,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:24,647 INFO L124 PetriNetUnfolderBase]: 361/2094 cut-off events. [2025-03-04 06:50:24,647 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-04 06:50:24,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2913 conditions, 2094 events. 361/2094 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 15486 event pairs, 129 based on Foata normal form. 0/1895 useless extension candidates. Maximal degree in co-relation 2851. Up to 462 conditions per place. [2025-03-04 06:50:24,656 INFO L140 encePairwiseOnDemand]: 161/183 looper letters, 55 selfloop transitions, 16 changer transitions 0/196 dead transitions. [2025-03-04 06:50:24,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 196 transitions, 558 flow [2025-03-04 06:50:24,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:50:24,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:50:24,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 458 transitions. [2025-03-04 06:50:24,658 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8342440801457195 [2025-03-04 06:50:24,658 INFO L175 Difference]: Start difference. First operand has 171 places, 164 transitions, 349 flow. Second operand 3 states and 458 transitions. [2025-03-04 06:50:24,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 196 transitions, 558 flow [2025-03-04 06:50:24,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 196 transitions, 548 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:50:24,662 INFO L231 Difference]: Finished difference. Result has 170 places, 180 transitions, 479 flow [2025-03-04 06:50:24,662 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=479, PETRI_PLACES=170, PETRI_TRANSITIONS=180} [2025-03-04 06:50:24,663 INFO L279 CegarLoopForPetriNet]: 168 programPoint places, 2 predicate places. [2025-03-04 06:50:24,663 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 180 transitions, 479 flow [2025-03-04 06:50:24,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 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:24,664 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:24,664 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:24,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:50:24,664 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-03-04 06:50:24,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:24,665 INFO L85 PathProgramCache]: Analyzing trace with hash 2134402434, now seen corresponding path program 1 times [2025-03-04 06:50:24,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:24,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385753910] [2025-03-04 06:50:24,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:24,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:24,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 06:50:24,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 06:50:24,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:24,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:50:24,684 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:50:24,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 06:50:24,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 06:50:24,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:24,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:50:24,721 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:50:24,721 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:50:24,722 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-03-04 06:50:24,723 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2025-03-04 06:50:24,723 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2025-03-04 06:50:24,723 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2025-03-04 06:50:24,723 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2025-03-04 06:50:24,723 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2025-03-04 06:50:24,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2025-03-04 06:50:24,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2025-03-04 06:50:24,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2025-03-04 06:50:24,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2025-03-04 06:50:24,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2025-03-04 06:50:24,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2025-03-04 06:50:24,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2025-03-04 06:50:24,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2025-03-04 06:50:24,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2025-03-04 06:50:24,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2025-03-04 06:50:24,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2025-03-04 06:50:24,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2025-03-04 06:50:24,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:50:24,725 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-04 06:50:24,728 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:50:24,728 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 06:50:24,748 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 06:50:24,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 217 places, 238 transitions, 492 flow [2025-03-04 06:50:24,799 INFO L124 PetriNetUnfolderBase]: 47/457 cut-off events. [2025-03-04 06:50:24,800 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 06:50:24,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 469 conditions, 457 events. 47/457 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1989 event pairs, 0 based on Foata normal form. 0/374 useless extension candidates. Maximal degree in co-relation 281. Up to 9 conditions per place. [2025-03-04 06:50:24,802 INFO L82 GeneralOperation]: Start removeDead. Operand has 217 places, 238 transitions, 492 flow [2025-03-04 06:50:24,805 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 217 places, 238 transitions, 492 flow [2025-03-04 06:50:24,806 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:50:24,806 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;@69bbc708, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:50:24,806 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-03-04 06:50:24,809 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:50:24,809 INFO L124 PetriNetUnfolderBase]: 2/49 cut-off events. [2025-03-04 06:50:24,809 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:50:24,809 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:24,809 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] [2025-03-04 06:50:24,809 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-04 06:50:24,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:24,810 INFO L85 PathProgramCache]: Analyzing trace with hash 391271894, now seen corresponding path program 1 times [2025-03-04 06:50:24,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:24,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062944889] [2025-03-04 06:50:24,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:24,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:24,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 06:50:24,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 06:50:24,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:24,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:24,841 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:24,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:24,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062944889] [2025-03-04 06:50:24,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062944889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:24,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:24,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:50:24,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766473651] [2025-03-04 06:50:24,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:24,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:50:24,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:24,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:50:24,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:50:24,866 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 238 [2025-03-04 06:50:24,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 238 transitions, 492 flow. Second operand has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 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:24,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:24,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 238 [2025-03-04 06:50:24,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:25,599 INFO L124 PetriNetUnfolderBase]: 1636/7872 cut-off events. [2025-03-04 06:50:25,600 INFO L125 PetriNetUnfolderBase]: For 90/103 co-relation queries the response was YES. [2025-03-04 06:50:25,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10390 conditions, 7872 events. 1636/7872 cut-off events. For 90/103 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 81710 event pairs, 1382 based on Foata normal form. 1065/7968 useless extension candidates. Maximal degree in co-relation 8087. Up to 2462 conditions per place. [2025-03-04 06:50:25,638 INFO L140 encePairwiseOnDemand]: 213/238 looper letters, 38 selfloop transitions, 2 changer transitions 0/222 dead transitions. [2025-03-04 06:50:25,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 222 transitions, 540 flow [2025-03-04 06:50:25,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:50:25,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:50:25,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 618 transitions. [2025-03-04 06:50:25,641 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.865546218487395 [2025-03-04 06:50:25,641 INFO L175 Difference]: Start difference. First operand has 217 places, 238 transitions, 492 flow. Second operand 3 states and 618 transitions. [2025-03-04 06:50:25,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 222 transitions, 540 flow [2025-03-04 06:50:25,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 222 transitions, 540 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:50:25,644 INFO L231 Difference]: Finished difference. Result has 218 places, 215 transitions, 456 flow [2025-03-04 06:50:25,644 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=456, PETRI_PLACES=218, PETRI_TRANSITIONS=215} [2025-03-04 06:50:25,645 INFO L279 CegarLoopForPetriNet]: 217 programPoint places, 1 predicate places. [2025-03-04 06:50:25,645 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 215 transitions, 456 flow [2025-03-04 06:50:25,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 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,645 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:25,645 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:25,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:50:25,645 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-04 06:50:25,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:25,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1053886979, now seen corresponding path program 1 times [2025-03-04 06:50:25,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:25,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534173139] [2025-03-04 06:50:25,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:25,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:25,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 06:50:25,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 06:50:25,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:25,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:25,891 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,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:25,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534173139] [2025-03-04 06:50:25,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534173139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:25,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:25,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:50:25,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868719017] [2025-03-04 06:50:25,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:25,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:50:25,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:25,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:50:25,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:50:25,985 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 238 [2025-03-04 06:50:25,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 215 transitions, 456 flow. Second operand has 6 states, 6 states have (on average 172.5) internal successors, (1035), 6 states have internal predecessors, (1035), 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,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:25,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 238 [2025-03-04 06:50:25,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:26,989 INFO L124 PetriNetUnfolderBase]: 2772/10135 cut-off events. [2025-03-04 06:50:26,991 INFO L125 PetriNetUnfolderBase]: For 181/181 co-relation queries the response was YES. [2025-03-04 06:50:27,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14763 conditions, 10135 events. 2772/10135 cut-off events. For 181/181 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 106902 event pairs, 1354 based on Foata normal form. 0/9259 useless extension candidates. Maximal degree in co-relation 7386. Up to 3388 conditions per place. [2025-03-04 06:50:27,039 INFO L140 encePairwiseOnDemand]: 232/238 looper letters, 94 selfloop transitions, 6 changer transitions 0/270 dead transitions. [2025-03-04 06:50:27,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 270 transitions, 766 flow [2025-03-04 06:50:27,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:50:27,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:50:27,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1126 transitions. [2025-03-04 06:50:27,042 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.788515406162465 [2025-03-04 06:50:27,042 INFO L175 Difference]: Start difference. First operand has 218 places, 215 transitions, 456 flow. Second operand 6 states and 1126 transitions. [2025-03-04 06:50:27,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 270 transitions, 766 flow [2025-03-04 06:50:27,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 270 transitions, 764 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:50:27,048 INFO L231 Difference]: Finished difference. Result has 221 places, 214 transitions, 464 flow [2025-03-04 06:50:27,049 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=464, PETRI_PLACES=221, PETRI_TRANSITIONS=214} [2025-03-04 06:50:27,049 INFO L279 CegarLoopForPetriNet]: 217 programPoint places, 4 predicate places. [2025-03-04 06:50:27,049 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 214 transitions, 464 flow [2025-03-04 06:50:27,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 172.5) internal successors, (1035), 6 states have internal predecessors, (1035), 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:27,050 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:27,050 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:27,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:50:27,050 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-04 06:50:27,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:27,051 INFO L85 PathProgramCache]: Analyzing trace with hash -782292838, now seen corresponding path program 1 times [2025-03-04 06:50:27,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:27,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664355648] [2025-03-04 06:50:27,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:27,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:27,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 06:50:27,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 06:50:27,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:27,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:27,080 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:27,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:27,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664355648] [2025-03-04 06:50:27,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664355648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:27,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:27,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:50:27,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915613714] [2025-03-04 06:50:27,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:27,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:50:27,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:27,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:50:27,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:50:27,136 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 238 [2025-03-04 06:50:27,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 214 transitions, 464 flow. Second operand has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 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:27,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:27,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 238 [2025-03-04 06:50:27,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:31,022 INFO L124 PetriNetUnfolderBase]: 17343/55574 cut-off events. [2025-03-04 06:50:31,023 INFO L125 PetriNetUnfolderBase]: For 448/448 co-relation queries the response was YES. [2025-03-04 06:50:31,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83751 conditions, 55574 events. 17343/55574 cut-off events. For 448/448 co-relation queries the response was YES. Maximal size of possible extension queue 993. Compared 711959 event pairs, 6918 based on Foata normal form. 0/49625 useless extension candidates. Maximal degree in co-relation 80723. Up to 16484 conditions per place. [2025-03-04 06:50:31,344 INFO L140 encePairwiseOnDemand]: 205/238 looper letters, 84 selfloop transitions, 24 changer transitions 0/263 dead transitions. [2025-03-04 06:50:31,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 263 transitions, 789 flow [2025-03-04 06:50:31,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:50:31,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:50:31,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 585 transitions. [2025-03-04 06:50:31,346 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.819327731092437 [2025-03-04 06:50:31,346 INFO L175 Difference]: Start difference. First operand has 221 places, 214 transitions, 464 flow. Second operand 3 states and 585 transitions. [2025-03-04 06:50:31,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 263 transitions, 789 flow [2025-03-04 06:50:31,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 263 transitions, 777 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:50:31,353 INFO L231 Difference]: Finished difference. Result has 220 places, 238 transitions, 662 flow [2025-03-04 06:50:31,353 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=662, PETRI_PLACES=220, PETRI_TRANSITIONS=238} [2025-03-04 06:50:31,355 INFO L279 CegarLoopForPetriNet]: 217 programPoint places, 3 predicate places. [2025-03-04 06:50:31,355 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 238 transitions, 662 flow [2025-03-04 06:50:31,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 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,356 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:31,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:50:31,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:50:31,356 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-04 06:50:31,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:31,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1305989379, now seen corresponding path program 1 times [2025-03-04 06:50:31,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:31,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741473436] [2025-03-04 06:50:31,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:31,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:31,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 06:50:31,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 06:50:31,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:31,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:31,430 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,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:31,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741473436] [2025-03-04 06:50:31,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741473436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:31,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:31,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:50:31,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604589479] [2025-03-04 06:50:31,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:31,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:50:31,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:31,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:50:31,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:50:31,477 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 238 [2025-03-04 06:50:31,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 238 transitions, 662 flow. Second operand has 5 states, 5 states have (on average 182.8) internal successors, (914), 5 states have internal predecessors, (914), 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,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:31,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 238 [2025-03-04 06:50:31,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:34,517 INFO L124 PetriNetUnfolderBase]: 10091/45118 cut-off events. [2025-03-04 06:50:34,517 INFO L125 PetriNetUnfolderBase]: For 3697/4003 co-relation queries the response was YES. [2025-03-04 06:50:34,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68945 conditions, 45118 events. 10091/45118 cut-off events. For 3697/4003 co-relation queries the response was YES. Maximal size of possible extension queue 816. Compared 623232 event pairs, 4249 based on Foata normal form. 8/40417 useless extension candidates. Maximal degree in co-relation 19282. Up to 9701 conditions per place. [2025-03-04 06:50:34,722 INFO L140 encePairwiseOnDemand]: 233/238 looper letters, 67 selfloop transitions, 5 changer transitions 0/275 dead transitions. [2025-03-04 06:50:34,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 275 transitions, 880 flow [2025-03-04 06:50:34,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:50:34,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:50:34,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1159 transitions. [2025-03-04 06:50:34,724 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.811624649859944 [2025-03-04 06:50:34,725 INFO L175 Difference]: Start difference. First operand has 220 places, 238 transitions, 662 flow. Second operand 6 states and 1159 transitions. [2025-03-04 06:50:34,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 275 transitions, 880 flow [2025-03-04 06:50:34,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 275 transitions, 832 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:50:34,754 INFO L231 Difference]: Finished difference. Result has 226 places, 240 transitions, 640 flow [2025-03-04 06:50:34,754 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=640, PETRI_PLACES=226, PETRI_TRANSITIONS=240} [2025-03-04 06:50:34,755 INFO L279 CegarLoopForPetriNet]: 217 programPoint places, 9 predicate places. [2025-03-04 06:50:34,755 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 240 transitions, 640 flow [2025-03-04 06:50:34,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 182.8) internal successors, (914), 5 states have internal predecessors, (914), 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:34,756 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:34,756 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:34,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:50:34,756 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-04 06:50:34,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:34,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1436942828, now seen corresponding path program 1 times [2025-03-04 06:50:34,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:34,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16260141] [2025-03-04 06:50:34,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:34,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:34,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 06:50:34,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 06:50:34,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:34,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:34,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 06:50:34,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:34,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16260141] [2025-03-04 06:50:34,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16260141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:34,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:34,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:50:34,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117902080] [2025-03-04 06:50:34,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:34,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:50:34,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:34,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:50:34,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:50:34,817 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 238 [2025-03-04 06:50:34,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 240 transitions, 640 flow. Second operand has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:34,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:34,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 238 [2025-03-04 06:50:34,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:38,712 INFO L124 PetriNetUnfolderBase]: 13025/51443 cut-off events. [2025-03-04 06:50:38,713 INFO L125 PetriNetUnfolderBase]: For 921/1624 co-relation queries the response was YES. [2025-03-04 06:50:38,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76912 conditions, 51443 events. 13025/51443 cut-off events. For 921/1624 co-relation queries the response was YES. Maximal size of possible extension queue 1039. Compared 709184 event pairs, 6744 based on Foata normal form. 25/45176 useless extension candidates. Maximal degree in co-relation 76805. Up to 12856 conditions per place. [2025-03-04 06:50:38,926 INFO L140 encePairwiseOnDemand]: 227/238 looper letters, 58 selfloop transitions, 9 changer transitions 0/268 dead transitions. [2025-03-04 06:50:38,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 268 transitions, 832 flow [2025-03-04 06:50:38,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:50:38,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:50:38,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 603 transitions. [2025-03-04 06:50:38,928 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8445378151260504 [2025-03-04 06:50:38,928 INFO L175 Difference]: Start difference. First operand has 226 places, 240 transitions, 640 flow. Second operand 3 states and 603 transitions. [2025-03-04 06:50:38,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 268 transitions, 832 flow [2025-03-04 06:50:38,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 268 transitions, 826 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 06:50:38,935 INFO L231 Difference]: Finished difference. Result has 227 places, 245 transitions, 694 flow [2025-03-04 06:50:38,935 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=626, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=694, PETRI_PLACES=227, PETRI_TRANSITIONS=245} [2025-03-04 06:50:38,936 INFO L279 CegarLoopForPetriNet]: 217 programPoint places, 10 predicate places. [2025-03-04 06:50:38,936 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 245 transitions, 694 flow [2025-03-04 06:50:38,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:38,937 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:38,937 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:38,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:50:38,937 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-04 06:50:38,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:38,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1066927000, now seen corresponding path program 1 times [2025-03-04 06:50:38,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:38,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657868531] [2025-03-04 06:50:38,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:38,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:38,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 06:50:38,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 06:50:38,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:38,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:50:38,959 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:50:38,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 06:50:38,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 06:50:38,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:38,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:50:38,979 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:50:38,979 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:50:38,979 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2025-03-04 06:50:38,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (21 of 23 remaining) [2025-03-04 06:50:38,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (20 of 23 remaining) [2025-03-04 06:50:38,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (19 of 23 remaining) [2025-03-04 06:50:38,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (18 of 23 remaining) [2025-03-04 06:50:38,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (17 of 23 remaining) [2025-03-04 06:50:38,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (16 of 23 remaining) [2025-03-04 06:50:38,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (15 of 23 remaining) [2025-03-04 06:50:38,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (14 of 23 remaining) [2025-03-04 06:50:38,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (13 of 23 remaining) [2025-03-04 06:50:38,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (12 of 23 remaining) [2025-03-04 06:50:38,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (11 of 23 remaining) [2025-03-04 06:50:38,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (10 of 23 remaining) [2025-03-04 06:50:38,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (9 of 23 remaining) [2025-03-04 06:50:38,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 23 remaining) [2025-03-04 06:50:38,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (7 of 23 remaining) [2025-03-04 06:50:38,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 23 remaining) [2025-03-04 06:50:38,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 23 remaining) [2025-03-04 06:50:38,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (4 of 23 remaining) [2025-03-04 06:50:38,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 23 remaining) [2025-03-04 06:50:38,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 23 remaining) [2025-03-04 06:50:38,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 23 remaining) [2025-03-04 06:50:38,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 23 remaining) [2025-03-04 06:50:38,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:50:38,980 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-04 06:50:38,981 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:50:38,981 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 06:50:39,000 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 06:50:39,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 266 places, 293 transitions, 613 flow [2025-03-04 06:50:39,043 INFO L124 PetriNetUnfolderBase]: 69/678 cut-off events. [2025-03-04 06:50:39,043 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-04 06:50:39,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 703 conditions, 678 events. 69/678 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3127 event pairs, 1 based on Foata normal form. 0/558 useless extension candidates. Maximal degree in co-relation 465. Up to 12 conditions per place. [2025-03-04 06:50:39,048 INFO L82 GeneralOperation]: Start removeDead. Operand has 266 places, 293 transitions, 613 flow [2025-03-04 06:50:39,052 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 266 places, 293 transitions, 613 flow [2025-03-04 06:50:39,053 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:50:39,053 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;@69bbc708, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:50:39,053 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-03-04 06:50:39,055 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:50:39,055 INFO L124 PetriNetUnfolderBase]: 2/49 cut-off events. [2025-03-04 06:50:39,055 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:50:39,055 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:39,055 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] [2025-03-04 06:50:39,055 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-03-04 06:50:39,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:39,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1201879653, now seen corresponding path program 1 times [2025-03-04 06:50:39,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:39,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738581863] [2025-03-04 06:50:39,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:39,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:39,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 06:50:39,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 06:50:39,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:39,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:39,074 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:39,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:39,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738581863] [2025-03-04 06:50:39,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738581863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:39,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:39,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:50:39,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77848667] [2025-03-04 06:50:39,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:39,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:50:39,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:39,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:50:39,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:50:39,091 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 293 [2025-03-04 06:50:39,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 293 transitions, 613 flow. Second operand has 3 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 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:39,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:39,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 293 [2025-03-04 06:50:39,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:45,208 INFO L124 PetriNetUnfolderBase]: 20295/72305 cut-off events. [2025-03-04 06:50:45,208 INFO L125 PetriNetUnfolderBase]: For 1272/1337 co-relation queries the response was YES. [2025-03-04 06:50:45,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100006 conditions, 72305 events. 20295/72305 cut-off events. For 1272/1337 co-relation queries the response was YES. Maximal size of possible extension queue 1383. Compared 1018189 event pairs, 12300 based on Foata normal form. 11565/75202 useless extension candidates. Maximal degree in co-relation 12862. Up to 27148 conditions per place. [2025-03-04 06:50:45,649 INFO L140 encePairwiseOnDemand]: 262/293 looper letters, 47 selfloop transitions, 2 changer transitions 0/271 dead transitions. [2025-03-04 06:50:45,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 271 transitions, 667 flow [2025-03-04 06:50:45,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:50:45,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:50:45,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 753 transitions. [2025-03-04 06:50:45,652 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.856655290102389 [2025-03-04 06:50:45,652 INFO L175 Difference]: Start difference. First operand has 266 places, 293 transitions, 613 flow. Second operand 3 states and 753 transitions. [2025-03-04 06:50:45,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 271 transitions, 667 flow [2025-03-04 06:50:45,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 271 transitions, 667 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:50:45,655 INFO L231 Difference]: Finished difference. Result has 267 places, 264 transitions, 565 flow [2025-03-04 06:50:45,655 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=565, PETRI_PLACES=267, PETRI_TRANSITIONS=264} [2025-03-04 06:50:45,656 INFO L279 CegarLoopForPetriNet]: 266 programPoint places, 1 predicate places. [2025-03-04 06:50:45,656 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 264 transitions, 565 flow [2025-03-04 06:50:45,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 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:45,656 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:45,657 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:45,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:50:45,657 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-03-04 06:50:45,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:45,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1919791240, now seen corresponding path program 1 times [2025-03-04 06:50:45,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:45,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956385342] [2025-03-04 06:50:45,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:45,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:45,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 06:50:45,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 06:50:45,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:45,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:45,816 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:45,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:45,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956385342] [2025-03-04 06:50:45,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956385342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:45,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:45,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:50:45,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479978662] [2025-03-04 06:50:45,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:45,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:50:45,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:45,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:50:45,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:50:45,878 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 293 [2025-03-04 06:50:45,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 264 transitions, 565 flow. Second operand has 6 states, 6 states have (on average 212.5) internal successors, (1275), 6 states have internal predecessors, (1275), 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:45,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:45,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 293 [2025-03-04 06:50:45,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:55,075 INFO L124 PetriNetUnfolderBase]: 35240/97147 cut-off events. [2025-03-04 06:50:55,075 INFO L125 PetriNetUnfolderBase]: For 1888/1888 co-relation queries the response was YES. [2025-03-04 06:50:55,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148333 conditions, 97147 events. 35240/97147 cut-off events. For 1888/1888 co-relation queries the response was YES. Maximal size of possible extension queue 1979. Compared 1312064 event pairs, 3886 based on Foata normal form. 0/90163 useless extension candidates. Maximal degree in co-relation 147195. Up to 37702 conditions per place. [2025-03-04 06:50:55,741 INFO L140 encePairwiseOnDemand]: 287/293 looper letters, 131 selfloop transitions, 6 changer transitions 0/347 dead transitions. [2025-03-04 06:50:55,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 347 transitions, 1005 flow [2025-03-04 06:50:55,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:50:55,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:50:55,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1403 transitions. [2025-03-04 06:50:55,743 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.79806598407281 [2025-03-04 06:50:55,743 INFO L175 Difference]: Start difference. First operand has 267 places, 264 transitions, 565 flow. Second operand 6 states and 1403 transitions. [2025-03-04 06:50:55,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 347 transitions, 1005 flow [2025-03-04 06:50:55,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 347 transitions, 1003 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:50:55,751 INFO L231 Difference]: Finished difference. Result has 270 places, 263 transitions, 573 flow [2025-03-04 06:50:55,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=573, PETRI_PLACES=270, PETRI_TRANSITIONS=263} [2025-03-04 06:50:55,751 INFO L279 CegarLoopForPetriNet]: 266 programPoint places, 4 predicate places. [2025-03-04 06:50:55,752 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 263 transitions, 573 flow [2025-03-04 06:50:55,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 212.5) internal successors, (1275), 6 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:55,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:55,752 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:55,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:50:55,753 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-03-04 06:50:55,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:55,753 INFO L85 PathProgramCache]: Analyzing trace with hash 186838036, now seen corresponding path program 1 times [2025-03-04 06:50:55,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:55,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840739536] [2025-03-04 06:50:55,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:55,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:55,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 06:50:55,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 06:50:55,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:55,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:55,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:55,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:55,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840739536] [2025-03-04 06:50:55,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840739536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:55,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:55,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:50:55,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290546529] [2025-03-04 06:50:55,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:55,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:50:55,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:55,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:50:55,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:50:55,832 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 293 [2025-03-04 06:50:55,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 263 transitions, 573 flow. Second operand has 3 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:55,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:55,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 293 [2025-03-04 06:50:55,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand