./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_76-tricky_address3_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e2fb8bed 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_76-tricky_address3_racefree.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 53e3b4cf7a6885129025777f14c3b33a959debd694827832fbe127376cb0a5f9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:02:53,835 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:02:53,894 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 22:02:53,901 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:02:53,901 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:02:53,924 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:02:53,924 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:02:53,925 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:02:53,925 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:02:53,925 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:02:53,925 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:02:53,925 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:02:53,926 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:02:53,926 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:02:53,926 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 22:02:53,926 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:02:53,926 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:02:53,926 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:02:53,926 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:02:53,926 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 22:02:53,926 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:02:53,926 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 22:02:53,926 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 22:02:53,926 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:02:53,926 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:02:53,926 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 22:02:53,926 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:02:53,926 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:02:53,926 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:02:53,926 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:02:53,926 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:02:53,926 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:02:53,927 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:02:53,927 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:02:53,927 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 22:02:53,927 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 22:02:53,927 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:02:53,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:02:53,927 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:02:53,927 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:02:53,927 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:02:53,927 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:02:53,927 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 -> 53e3b4cf7a6885129025777f14c3b33a959debd694827832fbe127376cb0a5f9 [2025-03-08 22:02:54,151 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:02:54,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:02:54,161 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:02:54,162 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:02:54,162 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:02:54,164 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_76-tricky_address3_racefree.i [2025-03-08 22:02:55,305 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28c861517/3fc620a823424ebd894a033750ae78ce/FLAG6472a086c [2025-03-08 22:02:55,578 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:02:55,579 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_76-tricky_address3_racefree.i [2025-03-08 22:02:55,588 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28c861517/3fc620a823424ebd894a033750ae78ce/FLAG6472a086c [2025-03-08 22:02:55,887 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28c861517/3fc620a823424ebd894a033750ae78ce [2025-03-08 22:02:55,888 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:02:55,889 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:02:55,890 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:02:55,890 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:02:55,893 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:02:55,894 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:02:55" (1/1) ... [2025-03-08 22:02:55,894 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ba7706c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:55, skipping insertion in model container [2025-03-08 22:02:55,895 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:02:55" (1/1) ... [2025-03-08 22:02:55,924 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:02:56,250 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:02:56,278 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:02:56,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:02:56,353 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:02:56,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:56 WrapperNode [2025-03-08 22:02:56,353 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:02:56,354 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:02:56,354 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:02:56,354 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:02:56,358 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:56" (1/1) ... [2025-03-08 22:02:56,371 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:56" (1/1) ... [2025-03-08 22:02:56,392 INFO L138 Inliner]: procedures = 271, calls = 110, calls flagged for inlining = 7, calls inlined = 8, statements flattened = 329 [2025-03-08 22:02:56,393 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:02:56,393 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:02:56,393 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:02:56,393 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:02:56,398 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:56" (1/1) ... [2025-03-08 22:02:56,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:56" (1/1) ... [2025-03-08 22:02:56,403 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:56" (1/1) ... [2025-03-08 22:02:56,404 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:56" (1/1) ... [2025-03-08 22:02:56,416 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:56" (1/1) ... [2025-03-08 22:02:56,422 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:56" (1/1) ... [2025-03-08 22:02:56,427 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:56" (1/1) ... [2025-03-08 22:02:56,428 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:56" (1/1) ... [2025-03-08 22:02:56,430 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:02:56,430 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:02:56,430 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:02:56,430 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:02:56,433 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:56" (1/1) ... [2025-03-08 22:02:56,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:02:56,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:02:56,461 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-08 22:02:56,468 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-08 22:02:56,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 22:02:56,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:02:56,483 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-08 22:02:56,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 22:02:56,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 22:02:56,484 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-08 22:02:56,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:02:56,484 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-08 22:02:56,484 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-08 22:02:56,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 22:02:56,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:02:56,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:02:56,485 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 22:02:56,594 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:02:56,595 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:02:56,924 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L954: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-08 22:02:56,925 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L954-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-08 22:02:57,037 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 22:02:57,037 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:02:57,079 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:02:57,079 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:02:57,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:02:57 BoogieIcfgContainer [2025-03-08 22:02:57,080 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:02:57,083 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:02:57,084 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:02:57,088 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:02:57,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:02:55" (1/3) ... [2025-03-08 22:02:57,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7621c28e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:02:57, skipping insertion in model container [2025-03-08 22:02:57,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:56" (2/3) ... [2025-03-08 22:02:57,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7621c28e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:02:57, skipping insertion in model container [2025-03-08 22:02:57,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:02:57" (3/3) ... [2025-03-08 22:02:57,091 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_76-tricky_address3_racefree.i [2025-03-08 22:02:57,103 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:02:57,108 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_76-tricky_address3_racefree.i that has 2 procedures, 319 locations, 1 initial locations, 11 loop locations, and 12 error locations. [2025-03-08 22:02:57,109 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 22:02:57,193 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-08 22:02:57,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 322 places, 349 transitions, 705 flow [2025-03-08 22:02:57,341 INFO L124 PetriNetUnfolderBase]: 43/475 cut-off events. [2025-03-08 22:02:57,344 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 22:02:57,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 480 conditions, 475 events. 43/475 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1640 event pairs, 0 based on Foata normal form. 0/410 useless extension candidates. Maximal degree in co-relation 244. Up to 8 conditions per place. [2025-03-08 22:02:57,357 INFO L82 GeneralOperation]: Start removeDead. Operand has 322 places, 349 transitions, 705 flow [2025-03-08 22:02:57,366 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 322 places, 349 transitions, 705 flow [2025-03-08 22:02:57,374 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:02:57,391 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;@6c9604e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:02:57,391 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-08 22:02:57,419 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:02:57,421 INFO L124 PetriNetUnfolderBase]: 5/132 cut-off events. [2025-03-08 22:02:57,421 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:02:57,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:57,422 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:02:57,423 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-03-08 22:02:57,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:57,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1907500246, now seen corresponding path program 1 times [2025-03-08 22:02:57,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:57,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164448791] [2025-03-08 22:02:57,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:57,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:57,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 22:02:57,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 22:02:57,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:57,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:57,770 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-08 22:02:57,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:57,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164448791] [2025-03-08 22:02:57,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164448791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:57,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:57,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:02:57,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440332260] [2025-03-08 22:02:57,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:57,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:02:57,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:57,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:02:57,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:02:57,843 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 349 [2025-03-08 22:02:57,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 349 transitions, 705 flow. Second operand has 3 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 states have internal predecessors, (895), 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-08 22:02:57,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:57,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 349 [2025-03-08 22:02:57,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:58,066 INFO L124 PetriNetUnfolderBase]: 85/1299 cut-off events. [2025-03-08 22:02:58,066 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-08 22:02:58,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1483 conditions, 1299 events. 85/1299 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 8256 event pairs, 72 based on Foata normal form. 165/1347 useless extension candidates. Maximal degree in co-relation 1240. Up to 178 conditions per place. [2025-03-08 22:02:58,079 INFO L140 encePairwiseOnDemand]: 320/349 looper letters, 23 selfloop transitions, 2 changer transitions 1/320 dead transitions. [2025-03-08 22:02:58,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 320 transitions, 697 flow [2025-03-08 22:02:58,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:02:58,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:02:58,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 943 transitions. [2025-03-08 22:02:58,096 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9006685768863419 [2025-03-08 22:02:58,099 INFO L175 Difference]: Start difference. First operand has 322 places, 349 transitions, 705 flow. Second operand 3 states and 943 transitions. [2025-03-08 22:02:58,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 320 transitions, 697 flow [2025-03-08 22:02:58,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 320 transitions, 697 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:02:58,112 INFO L231 Difference]: Finished difference. Result has 321 places, 319 transitions, 655 flow [2025-03-08 22:02:58,116 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=655, PETRI_PLACES=321, PETRI_TRANSITIONS=319} [2025-03-08 22:02:58,118 INFO L279 CegarLoopForPetriNet]: 322 programPoint places, -1 predicate places. [2025-03-08 22:02:58,118 INFO L471 AbstractCegarLoop]: Abstraction has has 321 places, 319 transitions, 655 flow [2025-03-08 22:02:58,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 states have internal predecessors, (895), 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-08 22:02:58,119 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:58,119 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:02:58,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:02:58,120 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-03-08 22:02:58,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:58,121 INFO L85 PathProgramCache]: Analyzing trace with hash -346781450, now seen corresponding path program 1 times [2025-03-08 22:02:58,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:58,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156652743] [2025-03-08 22:02:58,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:58,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:58,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 22:02:58,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 22:02:58,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:58,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:58,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:02:58,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:58,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156652743] [2025-03-08 22:02:58,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156652743] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:02:58,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015851974] [2025-03-08 22:02:58,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:58,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:02:58,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:02:58,292 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:02:58,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 22:02:58,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 22:02:58,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 22:02:58,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:58,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:58,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 22:02:58,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:02:58,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:02:58,446 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:02:58,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:02:58,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015851974] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:02:58,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:02:58,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-08 22:02:58,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229965883] [2025-03-08 22:02:58,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:02:58,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 22:02:58,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:58,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 22:02:58,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:02:58,536 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 349 [2025-03-08 22:02:58,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 319 transitions, 655 flow. Second operand has 10 states, 10 states have (on average 295.8) internal successors, (2958), 10 states have internal predecessors, (2958), 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-08 22:02:58,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:58,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 349 [2025-03-08 22:02:58,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:58,797 INFO L124 PetriNetUnfolderBase]: 85/1305 cut-off events. [2025-03-08 22:02:58,797 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-08 22:02:58,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1508 conditions, 1305 events. 85/1305 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 8255 event pairs, 72 based on Foata normal form. 2/1191 useless extension candidates. Maximal degree in co-relation 1413. Up to 178 conditions per place. [2025-03-08 22:02:58,802 INFO L140 encePairwiseOnDemand]: 343/349 looper letters, 27 selfloop transitions, 9 changer transitions 0/327 dead transitions. [2025-03-08 22:02:58,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 327 transitions, 745 flow [2025-03-08 22:02:58,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 22:02:58,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 22:02:58,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2684 transitions. [2025-03-08 22:02:58,808 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8545049347341611 [2025-03-08 22:02:58,808 INFO L175 Difference]: Start difference. First operand has 321 places, 319 transitions, 655 flow. Second operand 9 states and 2684 transitions. [2025-03-08 22:02:58,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 327 transitions, 745 flow [2025-03-08 22:02:58,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 327 transitions, 743 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:02:58,815 INFO L231 Difference]: Finished difference. Result has 330 places, 325 transitions, 703 flow [2025-03-08 22:02:58,815 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=703, PETRI_PLACES=330, PETRI_TRANSITIONS=325} [2025-03-08 22:02:58,816 INFO L279 CegarLoopForPetriNet]: 322 programPoint places, 8 predicate places. [2025-03-08 22:02:58,816 INFO L471 AbstractCegarLoop]: Abstraction has has 330 places, 325 transitions, 703 flow [2025-03-08 22:02:58,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 295.8) internal successors, (2958), 10 states have internal predecessors, (2958), 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-08 22:02:58,818 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:58,818 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:02:58,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 22:02:59,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:02:59,022 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-03-08 22:02:59,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:59,023 INFO L85 PathProgramCache]: Analyzing trace with hash -719357578, now seen corresponding path program 2 times [2025-03-08 22:02:59,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:59,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161648761] [2025-03-08 22:02:59,024 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:02:59,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:59,036 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 117 statements into 2 equivalence classes. [2025-03-08 22:02:59,049 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 102 of 117 statements. [2025-03-08 22:02:59,049 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 22:02:59,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:59,556 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 22:02:59,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:59,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161648761] [2025-03-08 22:02:59,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161648761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:59,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:59,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:02:59,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415350090] [2025-03-08 22:02:59,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:59,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:02:59,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:59,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:02:59,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:02:59,821 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 349 [2025-03-08 22:02:59,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 325 transitions, 703 flow. Second operand has 6 states, 6 states have (on average 246.5) internal successors, (1479), 6 states have internal predecessors, (1479), 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-08 22:02:59,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:59,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 349 [2025-03-08 22:02:59,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:03:00,558 INFO L124 PetriNetUnfolderBase]: 1365/5383 cut-off events. [2025-03-08 22:03:00,559 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-08 22:03:00,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8177 conditions, 5383 events. 1365/5383 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 48037 event pairs, 1033 based on Foata normal form. 0/4935 useless extension candidates. Maximal degree in co-relation 8053. Up to 2541 conditions per place. [2025-03-08 22:03:00,579 INFO L140 encePairwiseOnDemand]: 322/349 looper letters, 107 selfloop transitions, 86 changer transitions 0/442 dead transitions. [2025-03-08 22:03:00,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 442 transitions, 1323 flow [2025-03-08 22:03:00,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:03:00,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:03:00,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1664 transitions. [2025-03-08 22:03:00,584 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7946513849092646 [2025-03-08 22:03:00,584 INFO L175 Difference]: Start difference. First operand has 330 places, 325 transitions, 703 flow. Second operand 6 states and 1664 transitions. [2025-03-08 22:03:00,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 442 transitions, 1323 flow [2025-03-08 22:03:00,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 442 transitions, 1317 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-08 22:03:00,594 INFO L231 Difference]: Finished difference. Result has 339 places, 410 transitions, 1263 flow [2025-03-08 22:03:00,595 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1263, PETRI_PLACES=339, PETRI_TRANSITIONS=410} [2025-03-08 22:03:00,596 INFO L279 CegarLoopForPetriNet]: 322 programPoint places, 17 predicate places. [2025-03-08 22:03:00,596 INFO L471 AbstractCegarLoop]: Abstraction has has 339 places, 410 transitions, 1263 flow [2025-03-08 22:03:00,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 246.5) internal successors, (1479), 6 states have internal predecessors, (1479), 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-08 22:03:00,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:03:00,597 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:03:00,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:03:00,598 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-03-08 22:03:00,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:03:00,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1988703840, now seen corresponding path program 1 times [2025-03-08 22:03:00,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:03:00,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748316436] [2025-03-08 22:03:00,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:03:00,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:03:00,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 22:03:00,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 22:03:00,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:03:00,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:03:00,686 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 22:03:00,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:03:00,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748316436] [2025-03-08 22:03:00,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748316436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:03:00,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:03:00,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:03:00,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762804759] [2025-03-08 22:03:00,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:03:00,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:03:00,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:03:00,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:03:00,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:03:00,704 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 349 [2025-03-08 22:03:00,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 410 transitions, 1263 flow. Second operand has 3 states, 3 states have (on average 299.0) internal successors, (897), 3 states have internal predecessors, (897), 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-08 22:03:00,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:03:00,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 349 [2025-03-08 22:03:00,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:03:00,980 INFO L124 PetriNetUnfolderBase]: 285/2011 cut-off events. [2025-03-08 22:03:00,980 INFO L125 PetriNetUnfolderBase]: For 153/169 co-relation queries the response was YES. [2025-03-08 22:03:00,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2966 conditions, 2011 events. 285/2011 cut-off events. For 153/169 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 14954 event pairs, 55 based on Foata normal form. 1/1852 useless extension candidates. Maximal degree in co-relation 2840. Up to 235 conditions per place. [2025-03-08 22:03:00,992 INFO L140 encePairwiseOnDemand]: 346/349 looper letters, 30 selfloop transitions, 3 changer transitions 0/418 dead transitions. [2025-03-08 22:03:00,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 418 transitions, 1345 flow [2025-03-08 22:03:00,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:03:00,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:03:00,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 924 transitions. [2025-03-08 22:03:00,994 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8825214899713467 [2025-03-08 22:03:00,994 INFO L175 Difference]: Start difference. First operand has 339 places, 410 transitions, 1263 flow. Second operand 3 states and 924 transitions. [2025-03-08 22:03:00,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 418 transitions, 1345 flow [2025-03-08 22:03:01,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 418 transitions, 1345 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:03:01,003 INFO L231 Difference]: Finished difference. Result has 342 places, 410 transitions, 1274 flow [2025-03-08 22:03:01,004 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=1263, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1274, PETRI_PLACES=342, PETRI_TRANSITIONS=410} [2025-03-08 22:03:01,005 INFO L279 CegarLoopForPetriNet]: 322 programPoint places, 20 predicate places. [2025-03-08 22:03:01,005 INFO L471 AbstractCegarLoop]: Abstraction has has 342 places, 410 transitions, 1274 flow [2025-03-08 22:03:01,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 299.0) internal successors, (897), 3 states have internal predecessors, (897), 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-08 22:03:01,005 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:03:01,005 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:03:01,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:03:01,006 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-03-08 22:03:01,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:03:01,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1042194520, now seen corresponding path program 1 times [2025-03-08 22:03:01,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:03:01,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005088799] [2025-03-08 22:03:01,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:03:01,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:03:01,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 22:03:01,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 22:03:01,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:03:01,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:03:01,198 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:03:01,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:03:01,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005088799] [2025-03-08 22:03:01,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005088799] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:03:01,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902402782] [2025-03-08 22:03:01,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:03:01,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:03:01,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:03:01,201 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:03:01,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 22:03:01,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 22:03:01,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 22:03:01,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:03:01,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:03:01,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 22:03:01,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:03:01,343 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:03:01,343 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:03:01,454 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:03:01,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902402782] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:03:01,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:03:01,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-08 22:03:01,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494555193] [2025-03-08 22:03:01,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:03:01,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 22:03:01,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:03:01,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 22:03:01,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-08 22:03:01,485 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 349 [2025-03-08 22:03:01,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 410 transitions, 1274 flow. Second operand has 18 states, 18 states have (on average 295.94444444444446) internal successors, (5327), 18 states have internal predecessors, (5327), 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-08 22:03:01,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:03:01,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 349 [2025-03-08 22:03:01,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:03:01,875 INFO L124 PetriNetUnfolderBase]: 228/1919 cut-off events. [2025-03-08 22:03:01,875 INFO L125 PetriNetUnfolderBase]: For 158/192 co-relation queries the response was YES. [2025-03-08 22:03:01,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2820 conditions, 1919 events. 228/1919 cut-off events. For 158/192 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 14264 event pairs, 72 based on Foata normal form. 4/1780 useless extension candidates. Maximal degree in co-relation 2618. Up to 232 conditions per place. [2025-03-08 22:03:01,885 INFO L140 encePairwiseOnDemand]: 343/349 looper letters, 31 selfloop transitions, 21 changer transitions 0/428 dead transitions. [2025-03-08 22:03:01,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 428 transitions, 1466 flow [2025-03-08 22:03:01,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 22:03:01,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-08 22:03:01,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 6230 transitions. [2025-03-08 22:03:01,896 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8500477554918816 [2025-03-08 22:03:01,896 INFO L175 Difference]: Start difference. First operand has 342 places, 410 transitions, 1274 flow. Second operand 21 states and 6230 transitions. [2025-03-08 22:03:01,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 428 transitions, 1466 flow [2025-03-08 22:03:01,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 428 transitions, 1460 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:03:01,904 INFO L231 Difference]: Finished difference. Result has 365 places, 423 transitions, 1398 flow [2025-03-08 22:03:01,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=1268, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1398, PETRI_PLACES=365, PETRI_TRANSITIONS=423} [2025-03-08 22:03:01,905 INFO L279 CegarLoopForPetriNet]: 322 programPoint places, 43 predicate places. [2025-03-08 22:03:01,905 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 423 transitions, 1398 flow [2025-03-08 22:03:01,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 295.94444444444446) internal successors, (5327), 18 states have internal predecessors, (5327), 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-08 22:03:01,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:03:01,908 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:03:01,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 22:03:02,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:03:02,112 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-03-08 22:03:02,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:03:02,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1873199448, now seen corresponding path program 2 times [2025-03-08 22:03:02,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:03:02,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229026134] [2025-03-08 22:03:02,113 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:03:02,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:03:02,128 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 152 statements into 2 equivalence classes. [2025-03-08 22:03:02,154 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 22:03:02,154 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:03:02,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:03:02,470 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:03:02,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:03:02,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229026134] [2025-03-08 22:03:02,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229026134] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:03:02,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500050820] [2025-03-08 22:03:02,470 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:03:02,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:03:02,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:03:02,473 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:03:02,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 22:03:02,532 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 152 statements into 2 equivalence classes. [2025-03-08 22:03:02,577 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 22:03:02,577 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:03:02,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:03:02,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 22:03:02,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:03:02,646 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:03:02,647 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:03:02,819 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:03:02,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500050820] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:03:02,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:03:02,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-08 22:03:02,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478728687] [2025-03-08 22:03:02,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:03:02,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 22:03:02,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:03:02,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 22:03:02,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-08 22:03:02,853 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 349 [2025-03-08 22:03:02,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 423 transitions, 1398 flow. Second operand has 23 states, 23 states have (on average 296.04347826086956) internal successors, (6809), 23 states have internal predecessors, (6809), 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-08 22:03:02,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:03:02,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 349 [2025-03-08 22:03:02,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:03:03,353 INFO L124 PetriNetUnfolderBase]: 228/1934 cut-off events. [2025-03-08 22:03:03,353 INFO L125 PetriNetUnfolderBase]: For 259/293 co-relation queries the response was YES. [2025-03-08 22:03:03,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2920 conditions, 1934 events. 228/1934 cut-off events. For 259/293 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 14322 event pairs, 72 based on Foata normal form. 3/1794 useless extension candidates. Maximal degree in co-relation 2618. Up to 232 conditions per place. [2025-03-08 22:03:03,360 INFO L140 encePairwiseOnDemand]: 343/349 looper letters, 34 selfloop transitions, 30 changer transitions 0/440 dead transitions. [2025-03-08 22:03:03,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 440 transitions, 1654 flow [2025-03-08 22:03:03,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-08 22:03:03,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-08 22:03:03,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 8887 transitions. [2025-03-08 22:03:03,372 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8488061127029608 [2025-03-08 22:03:03,372 INFO L175 Difference]: Start difference. First operand has 365 places, 423 transitions, 1398 flow. Second operand 30 states and 8887 transitions. [2025-03-08 22:03:03,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 394 places, 440 transitions, 1654 flow [2025-03-08 22:03:03,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 440 transitions, 1624 flow, removed 9 selfloop flow, removed 6 redundant places. [2025-03-08 22:03:03,379 INFO L231 Difference]: Finished difference. Result has 392 places, 433 transitions, 1526 flow [2025-03-08 22:03:03,380 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=1374, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1526, PETRI_PLACES=392, PETRI_TRANSITIONS=433} [2025-03-08 22:03:03,380 INFO L279 CegarLoopForPetriNet]: 322 programPoint places, 70 predicate places. [2025-03-08 22:03:03,380 INFO L471 AbstractCegarLoop]: Abstraction has has 392 places, 433 transitions, 1526 flow [2025-03-08 22:03:03,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 296.04347826086956) internal successors, (6809), 23 states have internal predecessors, (6809), 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-08 22:03:03,382 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:03:03,382 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:03:03,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 22:03:03,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:03:03,586 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-03-08 22:03:03,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:03:03,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1969999372, now seen corresponding path program 3 times [2025-03-08 22:03:03,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:03:03,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284802969] [2025-03-08 22:03:03,587 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 22:03:03,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:03:03,599 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 167 statements into 11 equivalence classes. [2025-03-08 22:03:03,657 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 22:03:03,657 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-08 22:03:03,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:03:03,657 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 22:03:03,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 22:03:03,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 22:03:03,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:03:03,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:03:03,715 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 22:03:03,716 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 22:03:03,716 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-03-08 22:03:03,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2025-03-08 22:03:03,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2025-03-08 22:03:03,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2025-03-08 22:03:03,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2025-03-08 22:03:03,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2025-03-08 22:03:03,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2025-03-08 22:03:03,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2025-03-08 22:03:03,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2025-03-08 22:03:03,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2025-03-08 22:03:03,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2025-03-08 22:03:03,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2025-03-08 22:03:03,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2025-03-08 22:03:03,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2025-03-08 22:03:03,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2025-03-08 22:03:03,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2025-03-08 22:03:03,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2025-03-08 22:03:03,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2025-03-08 22:03:03,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:03:03,720 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1] [2025-03-08 22:03:03,724 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 22:03:03,724 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-08 22:03:03,769 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-08 22:03:03,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 426 places, 466 transitions, 948 flow [2025-03-08 22:03:03,840 INFO L124 PetriNetUnfolderBase]: 72/745 cut-off events. [2025-03-08 22:03:03,841 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-03-08 22:03:03,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 757 conditions, 745 events. 72/745 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3339 event pairs, 0 based on Foata normal form. 0/637 useless extension candidates. Maximal degree in co-relation 477. Up to 12 conditions per place. [2025-03-08 22:03:03,847 INFO L82 GeneralOperation]: Start removeDead. Operand has 426 places, 466 transitions, 948 flow [2025-03-08 22:03:03,855 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 426 places, 466 transitions, 948 flow [2025-03-08 22:03:03,856 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:03:03,856 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;@6c9604e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:03:03,856 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-03-08 22:03:03,865 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:03:03,865 INFO L124 PetriNetUnfolderBase]: 5/132 cut-off events. [2025-03-08 22:03:03,865 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:03:03,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:03:03,865 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:03:03,865 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-08 22:03:03,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:03:03,865 INFO L85 PathProgramCache]: Analyzing trace with hash 768165354, now seen corresponding path program 1 times [2025-03-08 22:03:03,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:03:03,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925432597] [2025-03-08 22:03:03,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:03:03,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:03:03,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 22:03:03,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 22:03:03,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:03:03,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:03:03,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:03:03,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:03:03,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925432597] [2025-03-08 22:03:03,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925432597] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:03:03,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:03:03,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:03:03,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354325740] [2025-03-08 22:03:03,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:03:03,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:03:03,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:03:03,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:03:03,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:03:03,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 466 [2025-03-08 22:03:03,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 466 transitions, 948 flow. Second operand has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 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-08 22:03:03,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:03:03,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 466 [2025-03-08 22:03:03,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:03:05,247 INFO L124 PetriNetUnfolderBase]: 1580/11801 cut-off events. [2025-03-08 22:03:05,247 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2025-03-08 22:03:05,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14262 conditions, 11801 events. 1580/11801 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 140809 event pairs, 1464 based on Foata normal form. 2452/13346 useless extension candidates. Maximal degree in co-relation 12618. Up to 2408 conditions per place. [2025-03-08 22:03:05,317 INFO L140 encePairwiseOnDemand]: 424/466 looper letters, 33 selfloop transitions, 2 changer transitions 1/422 dead transitions. [2025-03-08 22:03:05,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 422 transitions, 930 flow [2025-03-08 22:03:05,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:03:05,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:03:05,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1245 transitions. [2025-03-08 22:03:05,320 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8905579399141631 [2025-03-08 22:03:05,320 INFO L175 Difference]: Start difference. First operand has 426 places, 466 transitions, 948 flow. Second operand 3 states and 1245 transitions. [2025-03-08 22:03:05,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 422 places, 422 transitions, 930 flow [2025-03-08 22:03:05,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 422 places, 422 transitions, 930 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:03:05,325 INFO L231 Difference]: Finished difference. Result has 423 places, 421 transitions, 868 flow [2025-03-08 22:03:05,325 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=420, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=868, PETRI_PLACES=423, PETRI_TRANSITIONS=421} [2025-03-08 22:03:05,326 INFO L279 CegarLoopForPetriNet]: 426 programPoint places, -3 predicate places. [2025-03-08 22:03:05,326 INFO L471 AbstractCegarLoop]: Abstraction has has 423 places, 421 transitions, 868 flow [2025-03-08 22:03:05,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 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-08 22:03:05,326 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:03:05,326 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:03:05,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:03:05,326 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-08 22:03:05,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:03:05,327 INFO L85 PathProgramCache]: Analyzing trace with hash 76514184, now seen corresponding path program 1 times [2025-03-08 22:03:05,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:03:05,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945179470] [2025-03-08 22:03:05,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:03:05,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:03:05,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 22:03:05,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 22:03:05,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:03:05,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:03:05,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:03:05,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:03:05,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945179470] [2025-03-08 22:03:05,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945179470] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:03:05,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605355166] [2025-03-08 22:03:05,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:03:05,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:03:05,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:03:05,393 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:03:05,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 22:03:05,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 22:03:05,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 22:03:05,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:03:05,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:03:05,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 22:03:05,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:03:05,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:03:05,495 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:03:05,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:03:05,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605355166] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:03:05,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:03:05,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-08 22:03:05,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523981719] [2025-03-08 22:03:05,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:03:05,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 22:03:05,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:03:05,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 22:03:05,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:03:05,542 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 466 [2025-03-08 22:03:05,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 423 places, 421 transitions, 868 flow. Second operand has 10 states, 10 states have (on average 388.8) internal successors, (3888), 10 states have internal predecessors, (3888), 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-08 22:03:05,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:03:05,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 466 [2025-03-08 22:03:05,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:03:07,162 INFO L124 PetriNetUnfolderBase]: 1580/11807 cut-off events. [2025-03-08 22:03:07,163 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2025-03-08 22:03:07,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14287 conditions, 11807 events. 1580/11807 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 141070 event pairs, 1464 based on Foata normal form. 2/10903 useless extension candidates. Maximal degree in co-relation 14191. Up to 2408 conditions per place. [2025-03-08 22:03:07,270 INFO L140 encePairwiseOnDemand]: 460/466 looper letters, 37 selfloop transitions, 9 changer transitions 0/429 dead transitions. [2025-03-08 22:03:07,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 429 transitions, 978 flow [2025-03-08 22:03:07,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 22:03:07,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 22:03:07,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3531 transitions. [2025-03-08 22:03:07,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8419170243204578 [2025-03-08 22:03:07,277 INFO L175 Difference]: Start difference. First operand has 423 places, 421 transitions, 868 flow. Second operand 9 states and 3531 transitions. [2025-03-08 22:03:07,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 429 transitions, 978 flow [2025-03-08 22:03:07,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 429 transitions, 976 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:03:07,284 INFO L231 Difference]: Finished difference. Result has 432 places, 427 transitions, 916 flow [2025-03-08 22:03:07,284 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=866, PETRI_DIFFERENCE_MINUEND_PLACES=421, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=916, PETRI_PLACES=432, PETRI_TRANSITIONS=427} [2025-03-08 22:03:07,285 INFO L279 CegarLoopForPetriNet]: 426 programPoint places, 6 predicate places. [2025-03-08 22:03:07,285 INFO L471 AbstractCegarLoop]: Abstraction has has 432 places, 427 transitions, 916 flow [2025-03-08 22:03:07,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 388.8) internal successors, (3888), 10 states have internal predecessors, (3888), 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-08 22:03:07,286 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:03:07,287 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:03:07,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 22:03:07,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:03:07,488 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-08 22:03:07,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:03:07,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1714853688, now seen corresponding path program 2 times [2025-03-08 22:03:07,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:03:07,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898606268] [2025-03-08 22:03:07,489 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:03:07,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:03:07,496 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 117 statements into 2 equivalence classes. [2025-03-08 22:03:07,501 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 102 of 117 statements. [2025-03-08 22:03:07,501 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 22:03:07,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:03:07,899 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 22:03:07,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:03:07,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898606268] [2025-03-08 22:03:07,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898606268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:03:07,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:03:07,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:03:07,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158627941] [2025-03-08 22:03:07,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:03:07,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:03:07,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:03:07,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:03:07,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:03:08,201 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 466 [2025-03-08 22:03:08,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 432 places, 427 transitions, 916 flow. Second operand has 6 states, 6 states have (on average 319.5) internal successors, (1917), 6 states have internal predecessors, (1917), 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-08 22:03:08,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:03:08,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 466 [2025-03-08 22:03:08,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:03:30,051 INFO L124 PetriNetUnfolderBase]: 83047/200097 cut-off events. [2025-03-08 22:03:30,052 INFO L125 PetriNetUnfolderBase]: For 1130/1130 co-relation queries the response was YES. [2025-03-08 22:03:30,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 325032 conditions, 200097 events. 83047/200097 cut-off events. For 1130/1130 co-relation queries the response was YES. Maximal size of possible extension queue 3932. Compared 2689649 event pairs, 61992 based on Foata normal form. 0/185801 useless extension candidates. Maximal degree in co-relation 324907. Up to 116807 conditions per place. [2025-03-08 22:03:31,267 INFO L140 encePairwiseOnDemand]: 419/466 looper letters, 170 selfloop transitions, 166 changer transitions 0/657 dead transitions. [2025-03-08 22:03:31,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 657 transitions, 2053 flow [2025-03-08 22:03:31,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:03:31,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:03:31,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2245 transitions. [2025-03-08 22:03:31,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8029327610872675 [2025-03-08 22:03:31,277 INFO L175 Difference]: Start difference. First operand has 432 places, 427 transitions, 916 flow. Second operand 6 states and 2245 transitions. [2025-03-08 22:03:31,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 657 transitions, 2053 flow [2025-03-08 22:03:31,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 657 transitions, 2047 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-08 22:03:31,313 INFO L231 Difference]: Finished difference. Result has 441 places, 592 transitions, 1996 flow [2025-03-08 22:03:31,313 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=910, PETRI_DIFFERENCE_MINUEND_PLACES=431, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=427, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1996, PETRI_PLACES=441, PETRI_TRANSITIONS=592} [2025-03-08 22:03:31,314 INFO L279 CegarLoopForPetriNet]: 426 programPoint places, 15 predicate places. [2025-03-08 22:03:31,314 INFO L471 AbstractCegarLoop]: Abstraction has has 441 places, 592 transitions, 1996 flow [2025-03-08 22:03:31,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 319.5) internal successors, (1917), 6 states have internal predecessors, (1917), 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-08 22:03:31,316 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:03:31,316 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:03:31,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:03:31,317 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-08 22:03:31,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:03:31,317 INFO L85 PathProgramCache]: Analyzing trace with hash -2077986254, now seen corresponding path program 1 times [2025-03-08 22:03:31,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:03:31,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18463933] [2025-03-08 22:03:31,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:03:31,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:03:31,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 22:03:31,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 22:03:31,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:03:31,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:03:31,375 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 22:03:31,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:03:31,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18463933] [2025-03-08 22:03:31,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18463933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:03:31,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:03:31,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:03:31,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143856231] [2025-03-08 22:03:31,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:03:31,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:03:31,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:03:31,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:03:31,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:03:31,394 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 466 [2025-03-08 22:03:31,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 592 transitions, 1996 flow. Second operand has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 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-08 22:03:31,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:03:31,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 466 [2025-03-08 22:03:31,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:03:38,427 INFO L124 PetriNetUnfolderBase]: 15180/58300 cut-off events. [2025-03-08 22:03:38,427 INFO L125 PetriNetUnfolderBase]: For 6608/7131 co-relation queries the response was YES. [2025-03-08 22:03:38,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93788 conditions, 58300 events. 15180/58300 cut-off events. For 6608/7131 co-relation queries the response was YES. Maximal size of possible extension queue 1177. Compared 792988 event pairs, 6624 based on Foata normal form. 1/53389 useless extension candidates. Maximal degree in co-relation 93661. Up to 13419 conditions per place. [2025-03-08 22:03:38,809 INFO L140 encePairwiseOnDemand]: 463/466 looper letters, 42 selfloop transitions, 3 changer transitions 0/602 dead transitions. [2025-03-08 22:03:38,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 602 transitions, 2112 flow [2025-03-08 22:03:38,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:03:38,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:03:38,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1214 transitions. [2025-03-08 22:03:38,812 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8683834048640916 [2025-03-08 22:03:38,812 INFO L175 Difference]: Start difference. First operand has 441 places, 592 transitions, 1996 flow. Second operand 3 states and 1214 transitions. [2025-03-08 22:03:38,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 443 places, 602 transitions, 2112 flow [2025-03-08 22:03:38,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 602 transitions, 2112 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:03:38,886 INFO L231 Difference]: Finished difference. Result has 444 places, 594 transitions, 2021 flow [2025-03-08 22:03:38,887 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=1996, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=592, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=589, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2021, PETRI_PLACES=444, PETRI_TRANSITIONS=594} [2025-03-08 22:03:38,887 INFO L279 CegarLoopForPetriNet]: 426 programPoint places, 18 predicate places. [2025-03-08 22:03:38,887 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 594 transitions, 2021 flow [2025-03-08 22:03:38,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 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-08 22:03:38,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:03:38,888 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:03:38,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:03:38,888 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-08 22:03:38,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:03:38,889 INFO L85 PathProgramCache]: Analyzing trace with hash 54823280, now seen corresponding path program 1 times [2025-03-08 22:03:38,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:03:38,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445227966] [2025-03-08 22:03:38,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:03:38,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:03:38,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 22:03:38,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 22:03:38,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:03:38,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:03:38,954 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 22:03:38,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:03:38,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445227966] [2025-03-08 22:03:38,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445227966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:03:38,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:03:38,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:03:38,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830651945] [2025-03-08 22:03:38,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:03:38,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:03:38,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:03:38,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:03:38,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:03:38,979 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 466 [2025-03-08 22:03:38,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 594 transitions, 2021 flow. Second operand has 5 states, 5 states have (on average 390.0) internal successors, (1950), 5 states have internal predecessors, (1950), 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-08 22:03:38,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:03:38,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 466 [2025-03-08 22:03:38,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand