./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_41-trylock_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_41-trylock_racefree.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 af00d5f4cc6a18cb9fd8a5151467217fe3ddb5ee0fa30b2cfbd9dd374105ee15 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:34:47,187 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:34:47,248 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:34:47,256 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:34:47,256 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:34:47,268 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:34:47,269 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:34:47,269 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:34:47,269 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:34:47,269 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:34:47,270 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:34:47,270 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:34:47,270 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:34:47,270 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:34:47,270 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:34:47,270 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:34:47,270 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:34:47,270 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:34:47,271 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:34:47,271 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:34:47,271 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:34:47,271 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:34:47,271 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:34:47,271 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:34:47,271 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:34:47,271 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:34:47,271 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:34:47,271 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:34:47,271 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:34:47,271 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:34:47,272 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:34:47,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:34:47,272 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:34:47,272 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:34:47,272 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:34:47,272 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:34:47,272 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:34:47,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:34:47,272 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:34:47,272 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:34:47,272 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:34:47,273 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:34:47,273 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-jdk21/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 -> af00d5f4cc6a18cb9fd8a5151467217fe3ddb5ee0fa30b2cfbd9dd374105ee15 [2025-02-08 05:34:47,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:34:47,535 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:34:47,536 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:34:47,537 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:34:47,537 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:34:47,538 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_41-trylock_racefree.i [2025-02-08 05:34:48,708 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ba4065db8/c1616ff92cf6474aa911564aed1ad02a/FLAG1a6787a8a [2025-02-08 05:34:49,031 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:34:49,032 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_41-trylock_racefree.i [2025-02-08 05:34:49,047 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ba4065db8/c1616ff92cf6474aa911564aed1ad02a/FLAG1a6787a8a [2025-02-08 05:34:49,287 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ba4065db8/c1616ff92cf6474aa911564aed1ad02a [2025-02-08 05:34:49,292 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:34:49,294 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:34:49,295 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:34:49,295 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:34:49,298 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:34:49,299 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:34:49" (1/1) ... [2025-02-08 05:34:49,300 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50e78690 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:34:49, skipping insertion in model container [2025-02-08 05:34:49,300 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:34:49" (1/1) ... [2025-02-08 05:34:49,317 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:34:49,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:34:49,561 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:34:49,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:34:49,623 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:34:49,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:34:49 WrapperNode [2025-02-08 05:34:49,624 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:34:49,625 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:34:49,625 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:34:49,625 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:34:49,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:34:49" (1/1) ... [2025-02-08 05:34:49,638 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:34:49" (1/1) ... [2025-02-08 05:34:49,649 INFO L138 Inliner]: procedures = 172, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 88 [2025-02-08 05:34:49,650 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:34:49,650 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:34:49,650 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:34:49,650 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:34:49,655 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:34:49" (1/1) ... [2025-02-08 05:34:49,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:34:49" (1/1) ... [2025-02-08 05:34:49,657 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:34:49" (1/1) ... [2025-02-08 05:34:49,657 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:34:49" (1/1) ... [2025-02-08 05:34:49,661 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:34:49" (1/1) ... [2025-02-08 05:34:49,662 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:34:49" (1/1) ... [2025-02-08 05:34:49,663 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:34:49" (1/1) ... [2025-02-08 05:34:49,663 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:34:49" (1/1) ... [2025-02-08 05:34:49,665 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:34:49,665 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:34:49,665 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:34:49,665 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:34:49,666 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:34:49" (1/1) ... [2025-02-08 05:34:49,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:34:49,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:34:49,688 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:34:49,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:34:49,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:34:49,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:34:49,706 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:34:49,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:34:49,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 05:34:49,706 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-08 05:34:49,706 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-08 05:34:49,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:34:49,706 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexTryLock [2025-02-08 05:34:49,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:34:49,707 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:34:49,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:34:49,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:34:49,708 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:34:49,791 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:34:49,792 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:34:49,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L706: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-02-08 05:34:49,914 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L706-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-02-08 05:34:49,968 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:34:49,968 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:34:49,990 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:34:49,991 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:34:49,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:34:49 BoogieIcfgContainer [2025-02-08 05:34:49,991 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:34:49,993 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:34:49,993 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:34:49,996 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:34:49,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:34:49" (1/3) ... [2025-02-08 05:34:49,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6469b949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:34:49, skipping insertion in model container [2025-02-08 05:34:49,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:34:49" (2/3) ... [2025-02-08 05:34:49,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6469b949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:34:49, skipping insertion in model container [2025-02-08 05:34:49,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:34:49" (3/3) ... [2025-02-08 05:34:49,997 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_41-trylock_racefree.i [2025-02-08 05:34:50,008 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:34:50,010 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_41-trylock_racefree.i that has 2 procedures, 133 locations, 1 initial locations, 7 loop locations, and 7 error locations. [2025-02-08 05:34:50,010 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:34:50,070 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-08 05:34:50,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 146 transitions, 299 flow [2025-02-08 05:34:50,149 INFO L124 PetriNetUnfolderBase]: 19/209 cut-off events. [2025-02-08 05:34:50,151 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:34:50,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 209 events. 19/209 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 683 event pairs, 0 based on Foata normal form. 0/177 useless extension candidates. Maximal degree in co-relation 115. Up to 6 conditions per place. [2025-02-08 05:34:50,156 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 146 transitions, 299 flow [2025-02-08 05:34:50,159 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 146 transitions, 299 flow [2025-02-08 05:34:50,165 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:34:50,175 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;@7146ff4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:34:50,176 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-02-08 05:34:50,187 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:34:50,187 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2025-02-08 05:34:50,187 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:34:50,187 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:50,188 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:34:50,189 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-08 05:34:50,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:50,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1685930303, now seen corresponding path program 1 times [2025-02-08 05:34:50,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:50,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892810348] [2025-02-08 05:34:50,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:34:50,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:50,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 05:34:50,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 05:34:50,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:50,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:34:50,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:34:50,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:34:50,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892810348] [2025-02-08 05:34:50,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892810348] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:34:50,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:34:50,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:34:50,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243334558] [2025-02-08 05:34:50,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:34:50,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:34:50,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:34:50,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:34:50,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:34:50,415 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 146 [2025-02-08 05:34:50,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 146 transitions, 299 flow. Second operand has 2 states, 2 states have (on average 123.0) internal successors, (246), 2 states have internal predecessors, (246), 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-02-08 05:34:50,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:34:50,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 146 [2025-02-08 05:34:50,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:34:50,515 INFO L124 PetriNetUnfolderBase]: 27/381 cut-off events. [2025-02-08 05:34:50,518 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:34:50,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 451 conditions, 381 events. 27/381 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1535 event pairs, 24 based on Foata normal form. 65/407 useless extension candidates. Maximal degree in co-relation 352. Up to 65 conditions per place. [2025-02-08 05:34:50,522 INFO L140 encePairwiseOnDemand]: 135/146 looper letters, 12 selfloop transitions, 0 changer transitions 0/133 dead transitions. [2025-02-08 05:34:50,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 133 transitions, 297 flow [2025-02-08 05:34:50,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:34:50,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:34:50,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 267 transitions. [2025-02-08 05:34:50,536 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9143835616438356 [2025-02-08 05:34:50,537 INFO L175 Difference]: Start difference. First operand has 136 places, 146 transitions, 299 flow. Second operand 2 states and 267 transitions. [2025-02-08 05:34:50,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 133 transitions, 297 flow [2025-02-08 05:34:50,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 133 transitions, 297 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:34:50,547 INFO L231 Difference]: Finished difference. Result has 135 places, 133 transitions, 273 flow [2025-02-08 05:34:50,549 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=273, PETRI_PLACES=135, PETRI_TRANSITIONS=133} [2025-02-08 05:34:50,551 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -1 predicate places. [2025-02-08 05:34:50,553 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 133 transitions, 273 flow [2025-02-08 05:34:50,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 123.0) internal successors, (246), 2 states have internal predecessors, (246), 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-02-08 05:34:50,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:50,553 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:34:50,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:34:50,554 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-08 05:34:50,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:50,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1237871305, now seen corresponding path program 1 times [2025-02-08 05:34:50,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:50,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118642784] [2025-02-08 05:34:50,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:34:50,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:50,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 05:34:50,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 05:34:50,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:50,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:34:51,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:34:51,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:34:51,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118642784] [2025-02-08 05:34:51,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118642784] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:34:51,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:34:51,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:34:51,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102999312] [2025-02-08 05:34:51,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:34:51,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:34:51,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:34:51,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:34:51,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:34:51,203 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 146 [2025-02-08 05:34:51,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 133 transitions, 273 flow. Second operand has 6 states, 6 states have (on average 105.5) internal successors, (633), 6 states have internal predecessors, (633), 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-02-08 05:34:51,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:34:51,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 146 [2025-02-08 05:34:51,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:34:51,412 INFO L124 PetriNetUnfolderBase]: 117/709 cut-off events. [2025-02-08 05:34:51,413 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:34:51,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 978 conditions, 709 events. 117/709 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4234 event pairs, 12 based on Foata normal form. 0/643 useless extension candidates. Maximal degree in co-relation 974. Up to 186 conditions per place. [2025-02-08 05:34:51,416 INFO L140 encePairwiseOnDemand]: 140/146 looper letters, 48 selfloop transitions, 5 changer transitions 0/156 dead transitions. [2025-02-08 05:34:51,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 156 transitions, 425 flow [2025-02-08 05:34:51,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:34:51,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:34:51,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 678 transitions. [2025-02-08 05:34:51,419 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.773972602739726 [2025-02-08 05:34:51,419 INFO L175 Difference]: Start difference. First operand has 135 places, 133 transitions, 273 flow. Second operand 6 states and 678 transitions. [2025-02-08 05:34:51,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 156 transitions, 425 flow [2025-02-08 05:34:51,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 156 transitions, 425 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:34:51,422 INFO L231 Difference]: Finished difference. Result has 139 places, 132 transitions, 281 flow [2025-02-08 05:34:51,423 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=281, PETRI_PLACES=139, PETRI_TRANSITIONS=132} [2025-02-08 05:34:51,423 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 3 predicate places. [2025-02-08 05:34:51,423 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 132 transitions, 281 flow [2025-02-08 05:34:51,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.5) internal successors, (633), 6 states have internal predecessors, (633), 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-02-08 05:34:51,424 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:51,424 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] [2025-02-08 05:34:51,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:34:51,424 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-08 05:34:51,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:51,425 INFO L85 PathProgramCache]: Analyzing trace with hash 106611739, now seen corresponding path program 1 times [2025-02-08 05:34:51,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:51,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731531970] [2025-02-08 05:34:51,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:34:51,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:51,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 05:34:51,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 05:34:51,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:51,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:34:51,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:34:51,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:34:51,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731531970] [2025-02-08 05:34:51,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731531970] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:34:51,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:34:51,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:34:51,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835668716] [2025-02-08 05:34:51,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:34:51,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:34:51,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:34:51,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:34:51,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:34:51,494 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 146 [2025-02-08 05:34:51,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 132 transitions, 281 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 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-02-08 05:34:51,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:34:51,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 146 [2025-02-08 05:34:51,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:34:51,576 INFO L124 PetriNetUnfolderBase]: 55/527 cut-off events. [2025-02-08 05:34:51,576 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-02-08 05:34:51,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 669 conditions, 527 events. 55/527 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2477 event pairs, 35 based on Foata normal form. 1/471 useless extension candidates. Maximal degree in co-relation 664. Up to 108 conditions per place. [2025-02-08 05:34:51,582 INFO L140 encePairwiseOnDemand]: 143/146 looper letters, 22 selfloop transitions, 2 changer transitions 0/138 dead transitions. [2025-02-08 05:34:51,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 138 transitions, 341 flow [2025-02-08 05:34:51,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:34:51,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:34:51,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2025-02-08 05:34:51,584 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8515981735159818 [2025-02-08 05:34:51,584 INFO L175 Difference]: Start difference. First operand has 139 places, 132 transitions, 281 flow. Second operand 3 states and 373 transitions. [2025-02-08 05:34:51,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 138 transitions, 341 flow [2025-02-08 05:34:51,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 138 transitions, 331 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:34:51,589 INFO L231 Difference]: Finished difference. Result has 137 places, 132 transitions, 279 flow [2025-02-08 05:34:51,589 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=279, PETRI_PLACES=137, PETRI_TRANSITIONS=132} [2025-02-08 05:34:51,590 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 1 predicate places. [2025-02-08 05:34:51,590 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 132 transitions, 279 flow [2025-02-08 05:34:51,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 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-02-08 05:34:51,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:51,590 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] [2025-02-08 05:34:51,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:34:51,591 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-08 05:34:51,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:51,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1974774065, now seen corresponding path program 1 times [2025-02-08 05:34:51,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:51,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943162178] [2025-02-08 05:34:51,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:34:51,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:51,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-08 05:34:51,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 05:34:51,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:51,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:34:51,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:34:51,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:34:51,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943162178] [2025-02-08 05:34:51,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943162178] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:34:51,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:34:51,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:34:51,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099913604] [2025-02-08 05:34:51,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:34:51,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:34:51,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:34:51,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:34:51,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:34:51,641 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 146 [2025-02-08 05:34:51,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 132 transitions, 279 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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-02-08 05:34:51,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:34:51,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 146 [2025-02-08 05:34:51,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:34:51,783 INFO L124 PetriNetUnfolderBase]: 92/803 cut-off events. [2025-02-08 05:34:51,784 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-08 05:34:51,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1033 conditions, 803 events. 92/803 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4792 event pairs, 30 based on Foata normal form. 0/732 useless extension candidates. Maximal degree in co-relation 1027. Up to 125 conditions per place. [2025-02-08 05:34:51,787 INFO L140 encePairwiseOnDemand]: 137/146 looper letters, 30 selfloop transitions, 6 changer transitions 0/145 dead transitions. [2025-02-08 05:34:51,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 145 transitions, 380 flow [2025-02-08 05:34:51,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:34:51,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:34:51,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2025-02-08 05:34:51,788 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8493150684931506 [2025-02-08 05:34:51,788 INFO L175 Difference]: Start difference. First operand has 137 places, 132 transitions, 279 flow. Second operand 3 states and 372 transitions. [2025-02-08 05:34:51,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 145 transitions, 380 flow [2025-02-08 05:34:51,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 145 transitions, 376 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:34:51,794 INFO L231 Difference]: Finished difference. Result has 137 places, 134 transitions, 313 flow [2025-02-08 05:34:51,795 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=313, PETRI_PLACES=137, PETRI_TRANSITIONS=134} [2025-02-08 05:34:51,795 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 1 predicate places. [2025-02-08 05:34:51,795 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 134 transitions, 313 flow [2025-02-08 05:34:51,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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-02-08 05:34:51,796 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:51,796 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:34:51,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:34:51,796 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-08 05:34:51,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:51,797 INFO L85 PathProgramCache]: Analyzing trace with hash 2111475211, now seen corresponding path program 1 times [2025-02-08 05:34:51,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:51,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113407164] [2025-02-08 05:34:51,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:34:51,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:51,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 05:34:51,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 05:34:51,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:51,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:34:51,814 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:34:51,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 05:34:51,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 05:34:51,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:51,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:34:51,845 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:34:51,845 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:34:51,846 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2025-02-08 05:34:51,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2025-02-08 05:34:51,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2025-02-08 05:34:51,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2025-02-08 05:34:51,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2025-02-08 05:34:51,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2025-02-08 05:34:51,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2025-02-08 05:34:51,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2025-02-08 05:34:51,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2025-02-08 05:34:51,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2025-02-08 05:34:51,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2025-02-08 05:34:51,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2025-02-08 05:34:51,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:34:51,851 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-08 05:34:51,852 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:34:51,853 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 05:34:51,876 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:34:51,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 197 transitions, 410 flow [2025-02-08 05:34:51,913 INFO L124 PetriNetUnfolderBase]: 33/350 cut-off events. [2025-02-08 05:34:51,915 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:34:51,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 362 conditions, 350 events. 33/350 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1297 event pairs, 0 based on Foata normal form. 0/295 useless extension candidates. Maximal degree in co-relation 211. Up to 9 conditions per place. [2025-02-08 05:34:51,918 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 197 transitions, 410 flow [2025-02-08 05:34:51,920 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 182 places, 197 transitions, 410 flow [2025-02-08 05:34:51,923 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:34:51,924 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;@7146ff4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:34:51,924 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-02-08 05:34:51,932 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:34:51,932 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2025-02-08 05:34:51,932 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:34:51,932 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:51,932 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:34:51,932 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:34:51,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:51,933 INFO L85 PathProgramCache]: Analyzing trace with hash -105826938, now seen corresponding path program 1 times [2025-02-08 05:34:51,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:51,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496938454] [2025-02-08 05:34:51,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:34:51,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:51,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 05:34:51,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 05:34:51,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:51,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:34:51,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:34:51,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:34:51,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496938454] [2025-02-08 05:34:51,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496938454] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:34:51,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:34:51,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:34:51,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517157477] [2025-02-08 05:34:51,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:34:51,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:34:51,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:34:51,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:34:51,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:34:51,953 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 197 [2025-02-08 05:34:51,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 197 transitions, 410 flow. Second operand has 2 states, 2 states have (on average 160.0) internal successors, (320), 2 states have internal predecessors, (320), 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-02-08 05:34:51,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:34:51,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 197 [2025-02-08 05:34:51,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:34:52,260 INFO L124 PetriNetUnfolderBase]: 421/2700 cut-off events. [2025-02-08 05:34:52,260 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2025-02-08 05:34:52,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3459 conditions, 2700 events. 421/2700 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 22267 event pairs, 414 based on Foata normal form. 716/3141 useless extension candidates. Maximal degree in co-relation 2879. Up to 716 conditions per place. [2025-02-08 05:34:52,278 INFO L140 encePairwiseOnDemand]: 180/197 looper letters, 20 selfloop transitions, 0 changer transitions 0/178 dead transitions. [2025-02-08 05:34:52,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 178 transitions, 412 flow [2025-02-08 05:34:52,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:34:52,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:34:52,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 355 transitions. [2025-02-08 05:34:52,279 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9010152284263959 [2025-02-08 05:34:52,279 INFO L175 Difference]: Start difference. First operand has 182 places, 197 transitions, 410 flow. Second operand 2 states and 355 transitions. [2025-02-08 05:34:52,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 178 transitions, 412 flow [2025-02-08 05:34:52,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 178 transitions, 412 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:34:52,282 INFO L231 Difference]: Finished difference. Result has 181 places, 178 transitions, 372 flow [2025-02-08 05:34:52,283 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=372, PETRI_PLACES=181, PETRI_TRANSITIONS=178} [2025-02-08 05:34:52,283 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, -1 predicate places. [2025-02-08 05:34:52,283 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 178 transitions, 372 flow [2025-02-08 05:34:52,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 160.0) internal successors, (320), 2 states have internal predecessors, (320), 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-02-08 05:34:52,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:52,284 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:34:52,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:34:52,284 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:34:52,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:52,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1118013276, now seen corresponding path program 1 times [2025-02-08 05:34:52,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:52,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215870777] [2025-02-08 05:34:52,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:34:52,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:52,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 05:34:52,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 05:34:52,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:52,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:34:52,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:34:52,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:34:52,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215870777] [2025-02-08 05:34:52,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215870777] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:34:52,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:34:52,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:34:52,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306434133] [2025-02-08 05:34:52,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:34:52,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:34:52,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:34:52,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:34:52,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:34:52,626 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 197 [2025-02-08 05:34:52,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 178 transitions, 372 flow. Second operand has 6 states, 6 states have (on average 142.5) internal successors, (855), 6 states have internal predecessors, (855), 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-02-08 05:34:52,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:34:52,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 197 [2025-02-08 05:34:52,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:34:53,234 INFO L124 PetriNetUnfolderBase]: 1776/6285 cut-off events. [2025-02-08 05:34:53,235 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2025-02-08 05:34:53,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9181 conditions, 6285 events. 1776/6285 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 60814 event pairs, 168 based on Foata normal form. 0/5741 useless extension candidates. Maximal degree in co-relation 9176. Up to 2020 conditions per place. [2025-02-08 05:34:53,270 INFO L140 encePairwiseOnDemand]: 191/197 looper letters, 80 selfloop transitions, 5 changer transitions 0/225 dead transitions. [2025-02-08 05:34:53,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 225 transitions, 636 flow [2025-02-08 05:34:53,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:34:53,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:34:53,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 932 transitions. [2025-02-08 05:34:53,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7884940778341794 [2025-02-08 05:34:53,277 INFO L175 Difference]: Start difference. First operand has 181 places, 178 transitions, 372 flow. Second operand 6 states and 932 transitions. [2025-02-08 05:34:53,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 225 transitions, 636 flow [2025-02-08 05:34:53,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 225 transitions, 636 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:34:53,281 INFO L231 Difference]: Finished difference. Result has 185 places, 177 transitions, 380 flow [2025-02-08 05:34:53,281 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=380, PETRI_PLACES=185, PETRI_TRANSITIONS=177} [2025-02-08 05:34:53,281 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 3 predicate places. [2025-02-08 05:34:53,283 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 177 transitions, 380 flow [2025-02-08 05:34:53,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 142.5) internal successors, (855), 6 states have internal predecessors, (855), 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-02-08 05:34:53,283 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:53,284 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] [2025-02-08 05:34:53,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:34:53,284 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:34:53,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:53,284 INFO L85 PathProgramCache]: Analyzing trace with hash 124589915, now seen corresponding path program 1 times [2025-02-08 05:34:53,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:53,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782913838] [2025-02-08 05:34:53,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:34:53,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:53,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 05:34:53,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 05:34:53,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:53,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:34:53,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:34:53,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:34:53,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782913838] [2025-02-08 05:34:53,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782913838] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:34:53,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:34:53,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:34:53,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921266677] [2025-02-08 05:34:53,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:34:53,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:34:53,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:34:53,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:34:53,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:34:53,354 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 197 [2025-02-08 05:34:53,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 177 transitions, 380 flow. Second operand has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 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-02-08 05:34:53,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:34:53,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 197 [2025-02-08 05:34:53,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:34:53,713 INFO L124 PetriNetUnfolderBase]: 797/4518 cut-off events. [2025-02-08 05:34:53,714 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2025-02-08 05:34:53,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5949 conditions, 4518 events. 797/4518 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 42850 event pairs, 703 based on Foata normal form. 1/4080 useless extension candidates. Maximal degree in co-relation 5943. Up to 1303 conditions per place. [2025-02-08 05:34:53,747 INFO L140 encePairwiseOnDemand]: 194/197 looper letters, 31 selfloop transitions, 2 changer transitions 0/184 dead transitions. [2025-02-08 05:34:53,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 184 transitions, 462 flow [2025-02-08 05:34:53,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:34:53,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:34:53,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 493 transitions. [2025-02-08 05:34:53,749 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8341793570219966 [2025-02-08 05:34:53,749 INFO L175 Difference]: Start difference. First operand has 185 places, 177 transitions, 380 flow. Second operand 3 states and 493 transitions. [2025-02-08 05:34:53,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 184 transitions, 462 flow [2025-02-08 05:34:53,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 184 transitions, 450 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:34:53,753 INFO L231 Difference]: Finished difference. Result has 183 places, 178 transitions, 382 flow [2025-02-08 05:34:53,753 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=382, PETRI_PLACES=183, PETRI_TRANSITIONS=178} [2025-02-08 05:34:53,754 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 1 predicate places. [2025-02-08 05:34:53,754 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 178 transitions, 382 flow [2025-02-08 05:34:53,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 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-02-08 05:34:53,755 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:53,755 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] [2025-02-08 05:34:53,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:34:53,755 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:34:53,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:53,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1527591107, now seen corresponding path program 1 times [2025-02-08 05:34:53,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:53,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169031889] [2025-02-08 05:34:53,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:34:53,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:53,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-08 05:34:53,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 05:34:53,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:53,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:34:53,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:34:53,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:34:53,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169031889] [2025-02-08 05:34:53,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169031889] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:34:53,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:34:53,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:34:53,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548669580] [2025-02-08 05:34:53,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:34:53,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:34:53,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:34:53,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:34:53,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:34:53,826 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 197 [2025-02-08 05:34:53,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 178 transitions, 382 flow. Second operand has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 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-02-08 05:34:53,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:34:53,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 197 [2025-02-08 05:34:53,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:34:54,931 INFO L124 PetriNetUnfolderBase]: 4085/15040 cut-off events. [2025-02-08 05:34:54,931 INFO L125 PetriNetUnfolderBase]: For 238/238 co-relation queries the response was YES. [2025-02-08 05:34:54,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21769 conditions, 15040 events. 4085/15040 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 168245 event pairs, 1409 based on Foata normal form. 0/13447 useless extension candidates. Maximal degree in co-relation 21762. Up to 3578 conditions per place. [2025-02-08 05:34:55,005 INFO L140 encePairwiseOnDemand]: 178/197 looper letters, 58 selfloop transitions, 14 changer transitions 0/211 dead transitions. [2025-02-08 05:34:55,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 211 transitions, 603 flow [2025-02-08 05:34:55,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:34:55,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:34:55,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 497 transitions. [2025-02-08 05:34:55,007 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8409475465313029 [2025-02-08 05:34:55,007 INFO L175 Difference]: Start difference. First operand has 183 places, 178 transitions, 382 flow. Second operand 3 states and 497 transitions. [2025-02-08 05:34:55,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 211 transitions, 603 flow [2025-02-08 05:34:55,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 211 transitions, 601 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:34:55,012 INFO L231 Difference]: Finished difference. Result has 186 places, 192 transitions, 502 flow [2025-02-08 05:34:55,012 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=502, PETRI_PLACES=186, PETRI_TRANSITIONS=192} [2025-02-08 05:34:55,014 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 4 predicate places. [2025-02-08 05:34:55,015 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 192 transitions, 502 flow [2025-02-08 05:34:55,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 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-02-08 05:34:55,015 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:55,015 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:34:55,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:34:55,016 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:34:55,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:55,017 INFO L85 PathProgramCache]: Analyzing trace with hash -667750100, now seen corresponding path program 1 times [2025-02-08 05:34:55,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:55,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226466286] [2025-02-08 05:34:55,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:34:55,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:55,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 05:34:55,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 05:34:55,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:55,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:34:55,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:34:55,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:34:55,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226466286] [2025-02-08 05:34:55,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226466286] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:34:55,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:34:55,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:34:55,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140830208] [2025-02-08 05:34:55,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:34:55,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:34:55,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:34:55,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:34:55,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:34:55,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 197 [2025-02-08 05:34:55,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 192 transitions, 502 flow. Second operand has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 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-02-08 05:34:55,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:34:55,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 197 [2025-02-08 05:34:55,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:34:56,484 INFO L124 PetriNetUnfolderBase]: 4061/16820 cut-off events. [2025-02-08 05:34:56,484 INFO L125 PetriNetUnfolderBase]: For 4322/4501 co-relation queries the response was YES. [2025-02-08 05:34:56,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27610 conditions, 16820 events. 4061/16820 cut-off events. For 4322/4501 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 199768 event pairs, 2519 based on Foata normal form. 45/15299 useless extension candidates. Maximal degree in co-relation 27602. Up to 5557 conditions per place. [2025-02-08 05:34:56,586 INFO L140 encePairwiseOnDemand]: 188/197 looper letters, 52 selfloop transitions, 14 changer transitions 0/216 dead transitions. [2025-02-08 05:34:56,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 216 transitions, 720 flow [2025-02-08 05:34:56,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:34:56,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:34:56,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 491 transitions. [2025-02-08 05:34:56,590 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8307952622673435 [2025-02-08 05:34:56,590 INFO L175 Difference]: Start difference. First operand has 186 places, 192 transitions, 502 flow. Second operand 3 states and 491 transitions. [2025-02-08 05:34:56,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 216 transitions, 720 flow [2025-02-08 05:34:56,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 216 transitions, 682 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:34:56,600 INFO L231 Difference]: Finished difference. Result has 188 places, 204 transitions, 600 flow [2025-02-08 05:34:56,600 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=600, PETRI_PLACES=188, PETRI_TRANSITIONS=204} [2025-02-08 05:34:56,601 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 6 predicate places. [2025-02-08 05:34:56,601 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 204 transitions, 600 flow [2025-02-08 05:34:56,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 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-02-08 05:34:56,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:56,602 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:34:56,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:34:56,602 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:34:56,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:56,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1453921832, now seen corresponding path program 1 times [2025-02-08 05:34:56,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:56,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184575642] [2025-02-08 05:34:56,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:34:56,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:56,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-08 05:34:56,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-08 05:34:56,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:56,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:34:56,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:34:56,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:34:56,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184575642] [2025-02-08 05:34:56,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184575642] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:34:56,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:34:56,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:34:56,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344350705] [2025-02-08 05:34:56,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:34:56,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:34:56,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:34:56,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:34:56,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:34:56,698 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 197 [2025-02-08 05:34:56,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 204 transitions, 600 flow. Second operand has 5 states, 5 states have (on average 153.4) internal successors, (767), 5 states have internal predecessors, (767), 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-02-08 05:34:56,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:34:56,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 197 [2025-02-08 05:34:56,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:34:58,308 INFO L124 PetriNetUnfolderBase]: 3138/17911 cut-off events. [2025-02-08 05:34:58,309 INFO L125 PetriNetUnfolderBase]: For 1434/2910 co-relation queries the response was YES. [2025-02-08 05:34:58,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25336 conditions, 17911 events. 3138/17911 cut-off events. For 1434/2910 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 231235 event pairs, 731 based on Foata normal form. 12/15907 useless extension candidates. Maximal degree in co-relation 25327. Up to 3778 conditions per place. [2025-02-08 05:34:58,417 INFO L140 encePairwiseOnDemand]: 192/197 looper letters, 56 selfloop transitions, 5 changer transitions 0/236 dead transitions. [2025-02-08 05:34:58,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 236 transitions, 786 flow [2025-02-08 05:34:58,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:34:58,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:34:58,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 968 transitions. [2025-02-08 05:34:58,419 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8189509306260575 [2025-02-08 05:34:58,419 INFO L175 Difference]: Start difference. First operand has 188 places, 204 transitions, 600 flow. Second operand 6 states and 968 transitions. [2025-02-08 05:34:58,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 236 transitions, 786 flow [2025-02-08 05:34:58,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 236 transitions, 758 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:34:58,427 INFO L231 Difference]: Finished difference. Result has 194 places, 206 transitions, 598 flow [2025-02-08 05:34:58,427 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=598, PETRI_PLACES=194, PETRI_TRANSITIONS=206} [2025-02-08 05:34:58,428 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 12 predicate places. [2025-02-08 05:34:58,428 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 206 transitions, 598 flow [2025-02-08 05:34:58,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 153.4) internal successors, (767), 5 states have internal predecessors, (767), 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-02-08 05:34:58,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:58,428 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:34:58,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:34:58,429 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:34:58,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:58,429 INFO L85 PathProgramCache]: Analyzing trace with hash 405543266, now seen corresponding path program 1 times [2025-02-08 05:34:58,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:58,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787316189] [2025-02-08 05:34:58,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:34:58,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:58,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-08 05:34:58,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-08 05:34:58,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:58,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:34:58,447 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:34:58,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-08 05:34:58,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-08 05:34:58,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:58,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:34:58,470 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:34:58,471 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:34:58,471 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-02-08 05:34:58,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2025-02-08 05:34:58,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2025-02-08 05:34:58,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2025-02-08 05:34:58,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2025-02-08 05:34:58,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2025-02-08 05:34:58,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2025-02-08 05:34:58,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2025-02-08 05:34:58,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2025-02-08 05:34:58,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2025-02-08 05:34:58,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2025-02-08 05:34:58,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2025-02-08 05:34:58,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2025-02-08 05:34:58,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2025-02-08 05:34:58,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2025-02-08 05:34:58,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2025-02-08 05:34:58,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:34:58,472 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:34:58,473 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:34:58,473 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 05:34:58,503 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:34:58,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 228 places, 248 transitions, 523 flow [2025-02-08 05:34:58,538 INFO L124 PetriNetUnfolderBase]: 50/534 cut-off events. [2025-02-08 05:34:58,538 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-08 05:34:58,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 559 conditions, 534 events. 50/534 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2148 event pairs, 1 based on Foata normal form. 0/452 useless extension candidates. Maximal degree in co-relation 358. Up to 12 conditions per place. [2025-02-08 05:34:58,548 INFO L82 GeneralOperation]: Start removeDead. Operand has 228 places, 248 transitions, 523 flow [2025-02-08 05:34:58,553 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 228 places, 248 transitions, 523 flow [2025-02-08 05:34:58,554 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:34:58,555 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;@7146ff4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:34:58,555 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-02-08 05:34:58,557 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:34:58,557 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2025-02-08 05:34:58,557 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:34:58,557 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:58,558 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:34:58,558 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-02-08 05:34:58,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:58,558 INFO L85 PathProgramCache]: Analyzing trace with hash 640632446, now seen corresponding path program 1 times [2025-02-08 05:34:58,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:58,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697546842] [2025-02-08 05:34:58,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:34:58,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:58,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 05:34:58,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 05:34:58,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:58,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:34:58,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:34:58,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:34:58,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697546842] [2025-02-08 05:34:58,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697546842] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:34:58,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:34:58,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:34:58,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264151224] [2025-02-08 05:34:58,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:34:58,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:34:58,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:34:58,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:34:58,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:34:58,577 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 248 [2025-02-08 05:34:58,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 248 transitions, 523 flow. Second operand has 2 states, 2 states have (on average 197.0) internal successors, (394), 2 states have internal predecessors, (394), 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-02-08 05:34:58,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:34:58,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 248 [2025-02-08 05:34:58,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:35:00,513 INFO L124 PetriNetUnfolderBase]: 4833/20957 cut-off events. [2025-02-08 05:35:00,513 INFO L125 PetriNetUnfolderBase]: For 940/940 co-relation queries the response was YES. [2025-02-08 05:35:00,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28382 conditions, 20957 events. 4833/20957 cut-off events. For 940/940 co-relation queries the response was YES. Maximal size of possible extension queue 462. Compared 253617 event pairs, 4795 based on Foata normal form. 6977/25936 useless extension candidates. Maximal degree in co-relation 23854. Up to 6995 conditions per place. [2025-02-08 05:35:00,686 INFO L140 encePairwiseOnDemand]: 225/248 looper letters, 28 selfloop transitions, 0 changer transitions 0/223 dead transitions. [2025-02-08 05:35:00,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 223 transitions, 529 flow [2025-02-08 05:35:00,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:35:00,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:35:00,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 443 transitions. [2025-02-08 05:35:00,687 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8931451612903226 [2025-02-08 05:35:00,687 INFO L175 Difference]: Start difference. First operand has 228 places, 248 transitions, 523 flow. Second operand 2 states and 443 transitions. [2025-02-08 05:35:00,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 223 transitions, 529 flow [2025-02-08 05:35:00,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 223 transitions, 529 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:35:00,693 INFO L231 Difference]: Finished difference. Result has 227 places, 223 transitions, 473 flow [2025-02-08 05:35:00,693 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=473, PETRI_PLACES=227, PETRI_TRANSITIONS=223} [2025-02-08 05:35:00,694 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -1 predicate places. [2025-02-08 05:35:00,694 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 223 transitions, 473 flow [2025-02-08 05:35:00,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 197.0) internal successors, (394), 2 states have internal predecessors, (394), 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-02-08 05:35:00,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:35:00,694 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:35:00,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:35:00,694 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-02-08 05:35:00,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:35:00,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1205950804, now seen corresponding path program 1 times [2025-02-08 05:35:00,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:35:00,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995854461] [2025-02-08 05:35:00,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:35:00,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:35:00,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 05:35:00,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 05:35:00,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:35:00,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:35:00,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:35:00,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:35:00,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995854461] [2025-02-08 05:35:00,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995854461] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:35:00,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:35:00,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:35:00,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406512633] [2025-02-08 05:35:00,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:35:00,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:35:00,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:35:00,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:35:00,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:35:00,963 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 248 [2025-02-08 05:35:00,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 223 transitions, 473 flow. Second operand has 6 states, 6 states have (on average 179.5) internal successors, (1077), 6 states have internal predecessors, (1077), 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-02-08 05:35:00,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:35:00,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 248 [2025-02-08 05:35:00,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:35:07,148 INFO L124 PetriNetUnfolderBase]: 19693/69333 cut-off events. [2025-02-08 05:35:07,149 INFO L125 PetriNetUnfolderBase]: For 1105/1105 co-relation queries the response was YES. [2025-02-08 05:35:07,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97775 conditions, 69333 events. 19693/69333 cut-off events. For 1105/1105 co-relation queries the response was YES. Maximal size of possible extension queue 1375. Compared 953312 event pairs, 7382 based on Foata normal form. 0/63359 useless extension candidates. Maximal degree in co-relation 97769. Up to 20137 conditions per place. [2025-02-08 05:35:07,617 INFO L140 encePairwiseOnDemand]: 242/248 looper letters, 112 selfloop transitions, 5 changer transitions 0/294 dead transitions. [2025-02-08 05:35:07,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 294 transitions, 849 flow [2025-02-08 05:35:07,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:35:07,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:35:07,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1186 transitions. [2025-02-08 05:35:07,620 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7970430107526881 [2025-02-08 05:35:07,620 INFO L175 Difference]: Start difference. First operand has 227 places, 223 transitions, 473 flow. Second operand 6 states and 1186 transitions. [2025-02-08 05:35:07,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 294 transitions, 849 flow [2025-02-08 05:35:07,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 294 transitions, 849 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:35:07,625 INFO L231 Difference]: Finished difference. Result has 231 places, 222 transitions, 481 flow [2025-02-08 05:35:07,625 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=471, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=481, PETRI_PLACES=231, PETRI_TRANSITIONS=222} [2025-02-08 05:35:07,625 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, 3 predicate places. [2025-02-08 05:35:07,626 INFO L471 AbstractCegarLoop]: Abstraction has has 231 places, 222 transitions, 481 flow [2025-02-08 05:35:07,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 179.5) internal successors, (1077), 6 states have internal predecessors, (1077), 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-02-08 05:35:07,626 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:35:07,626 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] [2025-02-08 05:35:07,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:35:07,627 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-02-08 05:35:07,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:35:07,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1444313765, now seen corresponding path program 1 times [2025-02-08 05:35:07,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:35:07,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113170583] [2025-02-08 05:35:07,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:35:07,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:35:07,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 05:35:07,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 05:35:07,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:35:07,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:35:07,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:35:07,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:35:07,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113170583] [2025-02-08 05:35:07,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113170583] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:35:07,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:35:07,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:35:07,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236792081] [2025-02-08 05:35:07,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:35:07,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:35:07,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:35:07,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:35:07,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:35:07,664 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 248 [2025-02-08 05:35:07,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 222 transitions, 481 flow. Second operand has 3 states, 3 states have (on average 192.0) internal successors, (576), 3 states have internal predecessors, (576), 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-02-08 05:35:07,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:35:07,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 248 [2025-02-08 05:35:07,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:35:10,958 INFO L124 PetriNetUnfolderBase]: 8969/36534 cut-off events. [2025-02-08 05:35:10,958 INFO L125 PetriNetUnfolderBase]: For 1351/1351 co-relation queries the response was YES. [2025-02-08 05:35:11,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50261 conditions, 36534 events. 8969/36534 cut-off events. For 1351/1351 co-relation queries the response was YES. Maximal size of possible extension queue 763. Compared 478730 event pairs, 5659 based on Foata normal form. 1/33236 useless extension candidates. Maximal degree in co-relation 50254. Up to 12802 conditions per place. [2025-02-08 05:35:11,208 INFO L140 encePairwiseOnDemand]: 245/248 looper letters, 39 selfloop transitions, 2 changer transitions 0/229 dead transitions. [2025-02-08 05:35:11,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 229 transitions, 579 flow [2025-02-08 05:35:11,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:35:11,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:35:11,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 612 transitions. [2025-02-08 05:35:11,210 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8225806451612904 [2025-02-08 05:35:11,210 INFO L175 Difference]: Start difference. First operand has 231 places, 222 transitions, 481 flow. Second operand 3 states and 612 transitions. [2025-02-08 05:35:11,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 229 transitions, 579 flow [2025-02-08 05:35:11,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 229 transitions, 567 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:35:11,214 INFO L231 Difference]: Finished difference. Result has 229 places, 223 transitions, 483 flow [2025-02-08 05:35:11,214 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=471, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=483, PETRI_PLACES=229, PETRI_TRANSITIONS=223} [2025-02-08 05:35:11,215 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, 1 predicate places. [2025-02-08 05:35:11,215 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 223 transitions, 483 flow [2025-02-08 05:35:11,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 192.0) internal successors, (576), 3 states have internal predecessors, (576), 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-02-08 05:35:11,215 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:35:11,215 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] [2025-02-08 05:35:11,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:35:11,215 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-02-08 05:35:11,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:35:11,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1059652084, now seen corresponding path program 1 times [2025-02-08 05:35:11,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:35:11,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776570229] [2025-02-08 05:35:11,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:35:11,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:35:11,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-08 05:35:11,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 05:35:11,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:35:11,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:35:11,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:35:11,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:35:11,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776570229] [2025-02-08 05:35:11,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776570229] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:35:11,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:35:11,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:35:11,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943464790] [2025-02-08 05:35:11,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:35:11,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:35:11,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:35:11,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:35:11,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:35:11,277 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 248 [2025-02-08 05:35:11,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 223 transitions, 483 flow. Second operand has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 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-02-08 05:35:11,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:35:11,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 248 [2025-02-08 05:35:11,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand