./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_81-list_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_81-list_racing.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3de6ec2acea23c0ab47fbc2e02ad0931145060ca78b80531ef692b3505f9553b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:09:47,297 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:09:47,348 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:09:47,353 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:09:47,353 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:09:47,374 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:09:47,374 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:09:47,374 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:09:47,374 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:09:47,375 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:09:47,375 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:09:47,375 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:09:47,375 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:09:47,375 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:09:47,375 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:09:47,375 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:09:47,375 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:09:47,375 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:09:47,375 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:09:47,375 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:09:47,377 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:09:47,377 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:09:47,377 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:09:47,377 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:09:47,377 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:09:47,377 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:09:47,377 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:09:47,377 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:09:47,377 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:09:47,377 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:09:47,378 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:09:47,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:09:47,378 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:09:47,378 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:09:47,378 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:09:47,378 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:09:47,378 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:09:47,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:09:47,378 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:09:47,378 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:09:47,378 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:09:47,378 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:09:47,378 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3de6ec2acea23c0ab47fbc2e02ad0931145060ca78b80531ef692b3505f9553b [2025-03-17 11:09:47,607 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:09:47,613 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:09:47,615 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:09:47,616 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:09:47,616 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:09:47,617 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_81-list_racing.i [2025-03-17 11:09:48,816 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5f4bcccf/a1b7e8770811414a850ae949441b37b9/FLAGa474e0f5a [2025-03-17 11:09:49,147 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:09:49,148 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_81-list_racing.i [2025-03-17 11:09:49,167 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5f4bcccf/a1b7e8770811414a850ae949441b37b9/FLAGa474e0f5a [2025-03-17 11:09:49,395 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5f4bcccf/a1b7e8770811414a850ae949441b37b9 [2025-03-17 11:09:49,397 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:09:49,398 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:09:49,400 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:09:49,400 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:09:49,404 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:09:49,405 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:09:49" (1/1) ... [2025-03-17 11:09:49,405 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6332adaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:09:49, skipping insertion in model container [2025-03-17 11:09:49,407 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:09:49" (1/1) ... [2025-03-17 11:09:49,432 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:09:49,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:09:49,809 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:09:49,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:09:49,909 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:09:49,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:09:49 WrapperNode [2025-03-17 11:09:49,911 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:09:49,912 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:09:49,912 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:09:49,912 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:09:49,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:09:49" (1/1) ... [2025-03-17 11:09:49,939 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:09:49" (1/1) ... [2025-03-17 11:09:49,971 INFO L138 Inliner]: procedures = 279, calls = 60, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 366 [2025-03-17 11:09:49,972 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:09:49,973 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:09:49,974 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:09:49,974 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:09:49,979 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:09:49" (1/1) ... [2025-03-17 11:09:49,979 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:09:49" (1/1) ... [2025-03-17 11:09:49,986 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:09:49" (1/1) ... [2025-03-17 11:09:49,986 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:09:49" (1/1) ... [2025-03-17 11:09:50,008 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:09:49" (1/1) ... [2025-03-17 11:09:50,010 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:09:49" (1/1) ... [2025-03-17 11:09:50,013 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:09:49" (1/1) ... [2025-03-17 11:09:50,014 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:09:49" (1/1) ... [2025-03-17 11:09:50,022 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:09:50,023 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:09:50,025 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:09:50,025 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:09:50,026 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:09:49" (1/1) ... [2025-03-17 11:09:50,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:09:50,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:09:50,062 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 11:09:50,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 11:09:50,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 11:09:50,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-17 11:09:50,084 INFO L130 BoogieDeclarations]: Found specification of procedure t1_fun [2025-03-17 11:09:50,084 INFO L138 BoogieDeclarations]: Found implementation of procedure t1_fun [2025-03-17 11:09:50,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 11:09:50,084 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 11:09:50,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 11:09:50,084 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2025-03-17 11:09:50,084 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2025-03-17 11:09:50,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 11:09:50,084 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 11:09:50,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:09:50,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:09:50,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-17 11:09:50,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:09:50,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:09:50,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:09:50,086 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 11:09:50,225 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:09:50,227 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:09:50,746 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1043: havoc main_~#t2_ids~0#1.base, main_~#t2_ids~0#1.offset; [2025-03-17 11:09:50,747 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1043-1: SUMMARY for call ULTIMATE.dealloc(main_~#t2_ids~0#1.base, main_~#t2_ids~0#1.offset); srcloc: null [2025-03-17 11:09:50,747 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1042: havoc main_~#t1_ids~0#1.base, main_~#t1_ids~0#1.offset; [2025-03-17 11:09:50,747 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1042-1: SUMMARY for call ULTIMATE.dealloc(main_~#t1_ids~0#1.base, main_~#t1_ids~0#1.offset); srcloc: null [2025-03-17 11:09:50,748 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:09:50,748 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:09:50,774 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:09:50,775 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:09:50,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:09:50 BoogieIcfgContainer [2025-03-17 11:09:50,775 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:09:50,777 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:09:50,777 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:09:50,780 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:09:50,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:09:49" (1/3) ... [2025-03-17 11:09:50,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14167c8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:09:50, skipping insertion in model container [2025-03-17 11:09:50,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:09:49" (2/3) ... [2025-03-17 11:09:50,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14167c8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:09:50, skipping insertion in model container [2025-03-17 11:09:50,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:09:50" (3/3) ... [2025-03-17 11:09:50,783 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_81-list_racing.i [2025-03-17 11:09:50,794 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:09:50,796 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_81-list_racing.i that has 3 procedures, 385 locations, 1 initial locations, 9 loop locations, and 22 error locations. [2025-03-17 11:09:50,796 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:09:50,900 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-17 11:09:50,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 391 places, 406 transitions, 832 flow [2025-03-17 11:09:51,131 INFO L124 PetriNetUnfolderBase]: 40/714 cut-off events. [2025-03-17 11:09:51,133 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-17 11:09:51,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 731 conditions, 714 events. 40/714 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3035 event pairs, 0 based on Foata normal form. 0/626 useless extension candidates. Maximal degree in co-relation 377. Up to 8 conditions per place. [2025-03-17 11:09:51,151 INFO L82 GeneralOperation]: Start removeDead. Operand has 391 places, 406 transitions, 832 flow [2025-03-17 11:09:51,160 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 391 places, 406 transitions, 832 flow [2025-03-17 11:09:51,170 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:09:51,182 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;@72745240, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:09:51,182 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-03-17 11:09:51,191 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:09:51,192 INFO L124 PetriNetUnfolderBase]: 0/85 cut-off events. [2025-03-17 11:09:51,192 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:09:51,192 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:09:51,193 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:09:51,194 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [t2_funErr7ASSERT_VIOLATIONDATA_RACE, t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE, t2_funErr3ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-17 11:09:51,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:09:51,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1944716554, now seen corresponding path program 1 times [2025-03-17 11:09:51,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:09:51,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078984198] [2025-03-17 11:09:51,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:09:51,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:09:51,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-17 11:09:51,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 11:09:51,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:09:51,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:09:51,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:09:51,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:09:51,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078984198] [2025-03-17 11:09:51,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078984198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:09:51,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:09:51,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:09:51,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526742353] [2025-03-17 11:09:51,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:09:51,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:09:51,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:09:51,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:09:51,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:09:51,535 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 406 [2025-03-17 11:09:51,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 406 transitions, 832 flow. Second operand has 3 states, 3 states have (on average 367.3333333333333) internal successors, (1102), 3 states have internal predecessors, (1102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:09:51,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:09:51,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 406 [2025-03-17 11:09:51,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:09:52,021 INFO L124 PetriNetUnfolderBase]: 184/2348 cut-off events. [2025-03-17 11:09:52,022 INFO L125 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES. [2025-03-17 11:09:52,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2682 conditions, 2348 events. 184/2348 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 17376 event pairs, 132 based on Foata normal form. 108/2225 useless extension candidates. Maximal degree in co-relation 1788. Up to 283 conditions per place. [2025-03-17 11:09:52,039 INFO L140 encePairwiseOnDemand]: 390/406 looper letters, 23 selfloop transitions, 2 changer transitions 0/390 dead transitions. [2025-03-17 11:09:52,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 390 transitions, 850 flow [2025-03-17 11:09:52,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:09:52,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:09:52,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1137 transitions. [2025-03-17 11:09:52,060 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9334975369458128 [2025-03-17 11:09:52,062 INFO L175 Difference]: Start difference. First operand has 391 places, 406 transitions, 832 flow. Second operand 3 states and 1137 transitions. [2025-03-17 11:09:52,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 390 transitions, 850 flow [2025-03-17 11:09:52,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 390 transitions, 850 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:09:52,076 INFO L231 Difference]: Finished difference. Result has 390 places, 390 transitions, 804 flow [2025-03-17 11:09:52,080 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=406, PETRI_DIFFERENCE_MINUEND_FLOW=800, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=804, PETRI_PLACES=390, PETRI_TRANSITIONS=390} [2025-03-17 11:09:52,082 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -1 predicate places. [2025-03-17 11:09:52,084 INFO L471 AbstractCegarLoop]: Abstraction has has 390 places, 390 transitions, 804 flow [2025-03-17 11:09:52,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 367.3333333333333) internal successors, (1102), 3 states have internal predecessors, (1102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:09:52,085 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:09:52,085 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:09:52,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:09:52,085 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [t2_funErr7ASSERT_VIOLATIONDATA_RACE, t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE, t2_funErr3ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-17 11:09:52,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:09:52,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1227007545, now seen corresponding path program 1 times [2025-03-17 11:09:52,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:09:52,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781906508] [2025-03-17 11:09:52,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:09:52,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:09:52,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 11:09:52,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 11:09:52,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:09:52,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:09:52,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:09:52,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:09:52,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781906508] [2025-03-17 11:09:52,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781906508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:09:52,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:09:52,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:09:52,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007312398] [2025-03-17 11:09:52,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:09:52,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:09:52,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:09:52,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:09:52,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:09:52,224 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 406 [2025-03-17 11:09:52,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 390 transitions, 804 flow. Second operand has 3 states, 3 states have (on average 367.0) internal successors, (1101), 3 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:09:52,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:09:52,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 406 [2025-03-17 11:09:52,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:09:52,530 INFO L124 PetriNetUnfolderBase]: 104/1857 cut-off events. [2025-03-17 11:09:52,531 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2025-03-17 11:09:52,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2104 conditions, 1857 events. 104/1857 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 11476 event pairs, 72 based on Foata normal form. 0/1681 useless extension candidates. Maximal degree in co-relation 2009. Up to 185 conditions per place. [2025-03-17 11:09:52,562 INFO L140 encePairwiseOnDemand]: 402/406 looper letters, 22 selfloop transitions, 1 changer transitions 0/387 dead transitions. [2025-03-17 11:09:52,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 387 transitions, 844 flow [2025-03-17 11:09:52,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:09:52,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:09:52,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1124 transitions. [2025-03-17 11:09:52,566 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.922824302134647 [2025-03-17 11:09:52,568 INFO L175 Difference]: Start difference. First operand has 390 places, 390 transitions, 804 flow. Second operand 3 states and 1124 transitions. [2025-03-17 11:09:52,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 387 transitions, 844 flow [2025-03-17 11:09:52,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 387 transitions, 840 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:09:52,573 INFO L231 Difference]: Finished difference. Result has 387 places, 387 transitions, 796 flow [2025-03-17 11:09:52,574 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=406, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=796, PETRI_PLACES=387, PETRI_TRANSITIONS=387} [2025-03-17 11:09:52,574 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -4 predicate places. [2025-03-17 11:09:52,574 INFO L471 AbstractCegarLoop]: Abstraction has has 387 places, 387 transitions, 796 flow [2025-03-17 11:09:52,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 367.0) internal successors, (1101), 3 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:09:52,575 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:09:52,575 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:09:52,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:09:52,575 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [t2_funErr7ASSERT_VIOLATIONDATA_RACE, t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE, t2_funErr3ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-17 11:09:52,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:09:52,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1437225716, now seen corresponding path program 1 times [2025-03-17 11:09:52,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:09:52,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353255430] [2025-03-17 11:09:52,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:09:52,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:09:52,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 11:09:52,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 11:09:52,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:09:52,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:09:53,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:09:53,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:09:53,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353255430] [2025-03-17 11:09:53,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353255430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:09:53,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:09:53,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:09:53,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995312121] [2025-03-17 11:09:53,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:09:53,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:09:53,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:09:53,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:09:53,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:09:53,679 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 406 [2025-03-17 11:09:53,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 387 transitions, 796 flow. Second operand has 6 states, 6 states have (on average 302.3333333333333) internal successors, (1814), 6 states have internal predecessors, (1814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:09:53,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:09:53,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 406 [2025-03-17 11:09:53,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:10:00,337 INFO L124 PetriNetUnfolderBase]: 22213/58863 cut-off events. [2025-03-17 11:10:00,337 INFO L125 PetriNetUnfolderBase]: For 445/445 co-relation queries the response was YES. [2025-03-17 11:10:00,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92958 conditions, 58863 events. 22213/58863 cut-off events. For 445/445 co-relation queries the response was YES. Maximal size of possible extension queue 1136. Compared 682586 event pairs, 21418 based on Foata normal form. 0/54722 useless extension candidates. Maximal degree in co-relation 92864. Up to 33895 conditions per place. [2025-03-17 11:10:00,899 INFO L140 encePairwiseOnDemand]: 400/406 looper letters, 85 selfloop transitions, 5 changer transitions 0/386 dead transitions. [2025-03-17 11:10:00,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 386 transitions, 974 flow [2025-03-17 11:10:00,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:10:00,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:10:00,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1897 transitions. [2025-03-17 11:10:00,910 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7787356321839081 [2025-03-17 11:10:00,910 INFO L175 Difference]: Start difference. First operand has 387 places, 387 transitions, 796 flow. Second operand 6 states and 1897 transitions. [2025-03-17 11:10:00,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 386 transitions, 974 flow [2025-03-17 11:10:00,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 386 transitions, 973 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:10:00,931 INFO L231 Difference]: Finished difference. Result has 390 places, 386 transitions, 803 flow [2025-03-17 11:10:00,932 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=406, PETRI_DIFFERENCE_MINUEND_FLOW=793, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=803, PETRI_PLACES=390, PETRI_TRANSITIONS=386} [2025-03-17 11:10:00,933 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -1 predicate places. [2025-03-17 11:10:00,933 INFO L471 AbstractCegarLoop]: Abstraction has has 390 places, 386 transitions, 803 flow [2025-03-17 11:10:00,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 302.3333333333333) internal successors, (1814), 6 states have internal predecessors, (1814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:10:00,934 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:10:00,940 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:10:00,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:10:00,940 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [t2_funErr7ASSERT_VIOLATIONDATA_RACE, t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE, t2_funErr3ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-17 11:10:00,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:10:00,941 INFO L85 PathProgramCache]: Analyzing trace with hash -374690702, now seen corresponding path program 1 times [2025-03-17 11:10:00,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:10:00,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494462606] [2025-03-17 11:10:00,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:10:00,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:10:00,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 11:10:00,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 11:10:00,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:10:00,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:10:01,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:10:01,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:10:01,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494462606] [2025-03-17 11:10:01,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494462606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:10:01,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:10:01,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:10:01,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147153469] [2025-03-17 11:10:01,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:10:01,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:10:01,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:10:01,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:10:01,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:10:01,725 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 406 [2025-03-17 11:10:01,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 386 transitions, 803 flow. Second operand has 6 states, 6 states have (on average 302.3333333333333) internal successors, (1814), 6 states have internal predecessors, (1814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:10:01,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:10:01,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 406 [2025-03-17 11:10:01,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:10:07,784 INFO L124 PetriNetUnfolderBase]: 22213/58862 cut-off events. [2025-03-17 11:10:07,785 INFO L125 PetriNetUnfolderBase]: For 445/445 co-relation queries the response was YES. [2025-03-17 11:10:07,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92962 conditions, 58862 events. 22213/58862 cut-off events. For 445/445 co-relation queries the response was YES. Maximal size of possible extension queue 1136. Compared 682769 event pairs, 21418 based on Foata normal form. 0/54722 useless extension candidates. Maximal degree in co-relation 92868. Up to 33895 conditions per place. [2025-03-17 11:10:08,069 INFO L140 encePairwiseOnDemand]: 400/406 looper letters, 85 selfloop transitions, 5 changer transitions 0/385 dead transitions. [2025-03-17 11:10:08,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 385 transitions, 981 flow [2025-03-17 11:10:08,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:10:08,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:10:08,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1897 transitions. [2025-03-17 11:10:08,073 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7787356321839081 [2025-03-17 11:10:08,073 INFO L175 Difference]: Start difference. First operand has 390 places, 386 transitions, 803 flow. Second operand 6 states and 1897 transitions. [2025-03-17 11:10:08,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 394 places, 385 transitions, 981 flow [2025-03-17 11:10:08,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 385 transitions, 971 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:10:08,079 INFO L231 Difference]: Finished difference. Result has 389 places, 385 transitions, 801 flow [2025-03-17 11:10:08,080 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=406, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=384, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=801, PETRI_PLACES=389, PETRI_TRANSITIONS=385} [2025-03-17 11:10:08,081 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -2 predicate places. [2025-03-17 11:10:08,081 INFO L471 AbstractCegarLoop]: Abstraction has has 389 places, 385 transitions, 801 flow [2025-03-17 11:10:08,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 302.3333333333333) internal successors, (1814), 6 states have internal predecessors, (1814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:10:08,082 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:10:08,082 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:10:08,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:10:08,083 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [t2_funErr7ASSERT_VIOLATIONDATA_RACE, t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE, t2_funErr3ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-17 11:10:08,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:10:08,083 INFO L85 PathProgramCache]: Analyzing trace with hash 533276990, now seen corresponding path program 1 times [2025-03-17 11:10:08,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:10:08,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142537573] [2025-03-17 11:10:08,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:10:08,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:10:08,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 11:10:08,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 11:10:08,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:10:08,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:10:08,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:10:08,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:10:08,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142537573] [2025-03-17 11:10:08,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142537573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:10:08,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:10:08,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:10:08,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746388579] [2025-03-17 11:10:08,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:10:08,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:10:08,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:10:08,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:10:08,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:10:08,820 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 406 [2025-03-17 11:10:08,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 385 transitions, 801 flow. Second operand has 6 states, 6 states have (on average 296.8333333333333) internal successors, (1781), 6 states have internal predecessors, (1781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:10:08,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:10:08,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 406 [2025-03-17 11:10:08,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:10:15,831 INFO L124 PetriNetUnfolderBase]: 25955/68192 cut-off events. [2025-03-17 11:10:15,832 INFO L125 PetriNetUnfolderBase]: For 445/445 co-relation queries the response was YES. [2025-03-17 11:10:15,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108030 conditions, 68192 events. 25955/68192 cut-off events. For 445/445 co-relation queries the response was YES. Maximal size of possible extension queue 1407. Compared 819498 event pairs, 24795 based on Foata normal form. 0/63324 useless extension candidates. Maximal degree in co-relation 107935. Up to 39485 conditions per place. [2025-03-17 11:10:16,194 INFO L140 encePairwiseOnDemand]: 379/406 looper letters, 105 selfloop transitions, 86 changer transitions 0/478 dead transitions. [2025-03-17 11:10:16,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 478 transitions, 1369 flow [2025-03-17 11:10:16,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:10:16,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:10:16,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1956 transitions. [2025-03-17 11:10:16,198 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8029556650246306 [2025-03-17 11:10:16,199 INFO L175 Difference]: Start difference. First operand has 389 places, 385 transitions, 801 flow. Second operand 6 states and 1956 transitions. [2025-03-17 11:10:16,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 394 places, 478 transitions, 1369 flow [2025-03-17 11:10:16,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 478 transitions, 1359 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:10:16,218 INFO L231 Difference]: Finished difference. Result has 394 places, 470 transitions, 1357 flow [2025-03-17 11:10:16,219 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=406, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=384, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1357, PETRI_PLACES=394, PETRI_TRANSITIONS=470} [2025-03-17 11:10:16,220 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, 3 predicate places. [2025-03-17 11:10:16,221 INFO L471 AbstractCegarLoop]: Abstraction has has 394 places, 470 transitions, 1357 flow [2025-03-17 11:10:16,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 296.8333333333333) internal successors, (1781), 6 states have internal predecessors, (1781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:10:16,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:10:16,222 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:10:16,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:10:16,223 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [t2_funErr7ASSERT_VIOLATIONDATA_RACE, t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE, t2_funErr3ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-17 11:10:16,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:10:16,223 INFO L85 PathProgramCache]: Analyzing trace with hash -867726598, now seen corresponding path program 1 times [2025-03-17 11:10:16,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:10:16,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618000847] [2025-03-17 11:10:16,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:10:16,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:10:16,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 11:10:16,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 11:10:16,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:10:16,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:10:16,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:10:16,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:10:16,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618000847] [2025-03-17 11:10:16,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618000847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:10:16,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:10:16,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:10:16,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127510397] [2025-03-17 11:10:16,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:10:16,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:10:16,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:10:16,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:10:16,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:10:16,343 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 406 [2025-03-17 11:10:16,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 470 transitions, 1357 flow. Second operand has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:10:16,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:10:16,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 406 [2025-03-17 11:10:16,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:10:16,650 INFO L124 PetriNetUnfolderBase]: 309/2438 cut-off events. [2025-03-17 11:10:16,650 INFO L125 PetriNetUnfolderBase]: For 218/241 co-relation queries the response was YES. [2025-03-17 11:10:16,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3340 conditions, 2438 events. 309/2438 cut-off events. For 218/241 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 16812 event pairs, 94 based on Foata normal form. 1/2244 useless extension candidates. Maximal degree in co-relation 3241. Up to 237 conditions per place. [2025-03-17 11:10:16,664 INFO L140 encePairwiseOnDemand]: 403/406 looper letters, 22 selfloop transitions, 3 changer transitions 0/472 dead transitions. [2025-03-17 11:10:16,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 472 transitions, 1411 flow [2025-03-17 11:10:16,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:10:16,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:10:16,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1135 transitions. [2025-03-17 11:10:16,667 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9318555008210181 [2025-03-17 11:10:16,667 INFO L175 Difference]: Start difference. First operand has 394 places, 470 transitions, 1357 flow. Second operand 3 states and 1135 transitions. [2025-03-17 11:10:16,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 472 transitions, 1411 flow [2025-03-17 11:10:16,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 472 transitions, 1411 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:10:16,679 INFO L231 Difference]: Finished difference. Result has 397 places, 470 transitions, 1368 flow [2025-03-17 11:10:16,680 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=406, PETRI_DIFFERENCE_MINUEND_FLOW=1357, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=470, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=467, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1368, PETRI_PLACES=397, PETRI_TRANSITIONS=470} [2025-03-17 11:10:16,680 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, 6 predicate places. [2025-03-17 11:10:16,680 INFO L471 AbstractCegarLoop]: Abstraction has has 397 places, 470 transitions, 1368 flow [2025-03-17 11:10:16,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:10:16,681 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:10:16,682 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:10:16,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:10:16,682 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [t2_funErr7ASSERT_VIOLATIONDATA_RACE, t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE, t2_funErr3ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-17 11:10:16,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:10:16,683 INFO L85 PathProgramCache]: Analyzing trace with hash 855888369, now seen corresponding path program 1 times [2025-03-17 11:10:16,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:10:16,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134999326] [2025-03-17 11:10:16,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:10:16,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:10:16,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 11:10:16,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 11:10:16,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:10:16,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:10:16,725 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:10:16,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 11:10:16,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 11:10:16,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:10:16,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:10:16,792 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:10:16,792 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:10:16,793 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 38 remaining) [2025-03-17 11:10:16,794 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr7ASSERT_VIOLATIONDATA_RACE (36 of 38 remaining) [2025-03-17 11:10:16,794 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr6ASSERT_VIOLATIONDATA_RACE (35 of 38 remaining) [2025-03-17 11:10:16,795 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr5ASSERT_VIOLATIONDATA_RACE (34 of 38 remaining) [2025-03-17 11:10:16,795 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr3ASSERT_VIOLATIONDATA_RACE (33 of 38 remaining) [2025-03-17 11:10:16,795 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr4ASSERT_VIOLATIONDATA_RACE (32 of 38 remaining) [2025-03-17 11:10:16,795 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr1ASSERT_VIOLATIONDATA_RACE (31 of 38 remaining) [2025-03-17 11:10:16,795 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr2ASSERT_VIOLATIONDATA_RACE (30 of 38 remaining) [2025-03-17 11:10:16,795 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr0ASSERT_VIOLATIONDATA_RACE (29 of 38 remaining) [2025-03-17 11:10:16,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (28 of 38 remaining) [2025-03-17 11:10:16,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (27 of 38 remaining) [2025-03-17 11:10:16,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (26 of 38 remaining) [2025-03-17 11:10:16,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (25 of 38 remaining) [2025-03-17 11:10:16,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (24 of 38 remaining) [2025-03-17 11:10:16,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (23 of 38 remaining) [2025-03-17 11:10:16,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (22 of 38 remaining) [2025-03-17 11:10:16,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (21 of 38 remaining) [2025-03-17 11:10:16,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 38 remaining) [2025-03-17 11:10:16,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr5ASSERT_VIOLATIONDATA_RACE (19 of 38 remaining) [2025-03-17 11:10:16,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr4ASSERT_VIOLATIONDATA_RACE (18 of 38 remaining) [2025-03-17 11:10:16,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr3ASSERT_VIOLATIONDATA_RACE (17 of 38 remaining) [2025-03-17 11:10:16,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr2ASSERT_VIOLATIONDATA_RACE (16 of 38 remaining) [2025-03-17 11:10:16,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr1ASSERT_VIOLATIONDATA_RACE (15 of 38 remaining) [2025-03-17 11:10:16,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr0ASSERT_VIOLATIONDATA_RACE (14 of 38 remaining) [2025-03-17 11:10:16,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr7ASSERT_VIOLATIONDATA_RACE (13 of 38 remaining) [2025-03-17 11:10:16,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr6ASSERT_VIOLATIONDATA_RACE (12 of 38 remaining) [2025-03-17 11:10:16,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr5ASSERT_VIOLATIONDATA_RACE (11 of 38 remaining) [2025-03-17 11:10:16,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr3ASSERT_VIOLATIONDATA_RACE (10 of 38 remaining) [2025-03-17 11:10:16,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr4ASSERT_VIOLATIONDATA_RACE (9 of 38 remaining) [2025-03-17 11:10:16,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr1ASSERT_VIOLATIONDATA_RACE (8 of 38 remaining) [2025-03-17 11:10:16,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr2ASSERT_VIOLATIONDATA_RACE (7 of 38 remaining) [2025-03-17 11:10:16,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr0ASSERT_VIOLATIONDATA_RACE (6 of 38 remaining) [2025-03-17 11:10:16,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr5ASSERT_VIOLATIONDATA_RACE (5 of 38 remaining) [2025-03-17 11:10:16,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr4ASSERT_VIOLATIONDATA_RACE (4 of 38 remaining) [2025-03-17 11:10:16,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 38 remaining) [2025-03-17 11:10:16,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 38 remaining) [2025-03-17 11:10:16,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 38 remaining) [2025-03-17 11:10:16,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 38 remaining) [2025-03-17 11:10:16,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:10:16,799 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:10:16,801 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 11:10:16,801 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-17 11:10:16,894 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-03-17 11:10:16,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 593 places, 624 transitions, 1292 flow [2025-03-17 11:10:17,309 INFO L124 PetriNetUnfolderBase]: 153/1937 cut-off events. [2025-03-17 11:10:17,309 INFO L125 PetriNetUnfolderBase]: For 72/90 co-relation queries the response was YES. [2025-03-17 11:10:17,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2026 conditions, 1937 events. 153/1937 cut-off events. For 72/90 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 13125 event pairs, 2 based on Foata normal form. 0/1675 useless extension candidates. Maximal degree in co-relation 1227. Up to 32 conditions per place. [2025-03-17 11:10:17,341 INFO L82 GeneralOperation]: Start removeDead. Operand has 593 places, 624 transitions, 1292 flow [2025-03-17 11:10:17,362 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 593 places, 624 transitions, 1292 flow [2025-03-17 11:10:17,363 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:10:17,363 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;@72745240, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:10:17,364 INFO L334 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2025-03-17 11:10:17,369 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:10:17,370 INFO L124 PetriNetUnfolderBase]: 0/85 cut-off events. [2025-03-17 11:10:17,371 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:10:17,371 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:10:17,371 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:10:17,371 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [t2_funErr7ASSERT_VIOLATIONDATA_RACE, t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE, t2_funErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-17 11:10:17,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:10:17,372 INFO L85 PathProgramCache]: Analyzing trace with hash 681846264, now seen corresponding path program 1 times [2025-03-17 11:10:17,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:10:17,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408418993] [2025-03-17 11:10:17,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:10:17,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:10:17,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-17 11:10:17,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 11:10:17,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:10:17,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:10:17,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:10:17,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:10:17,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408418993] [2025-03-17 11:10:17,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408418993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:10:17,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:10:17,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:10:17,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139933878] [2025-03-17 11:10:17,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:10:17,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:10:17,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:10:17,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:10:17,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:10:17,526 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 552 out of 624 [2025-03-17 11:10:17,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 593 places, 624 transitions, 1292 flow. Second operand has 3 states, 3 states have (on average 553.3333333333334) internal successors, (1660), 3 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:10:17,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:10:17,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 552 of 624 [2025-03-17 11:10:17,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand