./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 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_81-list_racing.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 3de6ec2acea23c0ab47fbc2e02ad0931145060ca78b80531ef692b3505f9553b --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:36:02,717 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:36:02,773 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:36:02,776 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:36:02,777 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:36:02,799 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:36:02,799 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:36:02,799 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:36:02,800 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:36:02,800 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:36:02,800 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:36:02,800 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:36:02,800 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:36:02,800 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:36:02,800 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:36:02,800 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:36:02,800 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:36:02,800 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:36:02,800 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:36:02,800 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:36:02,800 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:36:02,800 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:36:02,801 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:36:02,801 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:36:02,801 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:36:02,801 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:36:02,801 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:36:02,801 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:36:02,801 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:36:02,801 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:36:02,801 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:36:02,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:36:02,801 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:36:02,801 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:36:02,801 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:36:02,801 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:36:02,801 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:36:02,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:36:02,801 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:36:02,801 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:36:02,801 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:36:02,802 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:36:02,802 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 -> 3de6ec2acea23c0ab47fbc2e02ad0931145060ca78b80531ef692b3505f9553b [2025-02-08 05:36:03,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:36:03,010 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:36:03,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:36:03,013 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:36:03,013 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:36:03,014 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_81-list_racing.i [2025-02-08 05:36:04,158 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cc7a845b2/107b3f58fadd4775a4b88b624388cd93/FLAG92bd4760c [2025-02-08 05:36:04,483 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:36:04,484 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_81-list_racing.i [2025-02-08 05:36:04,498 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cc7a845b2/107b3f58fadd4775a4b88b624388cd93/FLAG92bd4760c [2025-02-08 05:36:04,512 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cc7a845b2/107b3f58fadd4775a4b88b624388cd93 [2025-02-08 05:36:04,514 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:36:04,515 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:36:04,517 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:36:04,517 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:36:04,524 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:36:04,524 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:36:04" (1/1) ... [2025-02-08 05:36:04,525 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@718da415 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:04, skipping insertion in model container [2025-02-08 05:36:04,525 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:36:04" (1/1) ... [2025-02-08 05:36:04,543 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:36:04,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:36:04,933 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:36:04,997 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:36:05,041 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:36:05,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:05 WrapperNode [2025-02-08 05:36:05,043 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:36:05,043 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:36:05,043 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:36:05,044 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:36:05,048 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:36:05" (1/1) ... [2025-02-08 05:36:05,060 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:36:05" (1/1) ... [2025-02-08 05:36:05,083 INFO L138 Inliner]: procedures = 279, calls = 60, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 366 [2025-02-08 05:36:05,083 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:36:05,088 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:36:05,088 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:36:05,088 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:36:05,094 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:05" (1/1) ... [2025-02-08 05:36:05,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:05" (1/1) ... [2025-02-08 05:36:05,103 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:05" (1/1) ... [2025-02-08 05:36:05,107 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:05" (1/1) ... [2025-02-08 05:36:05,121 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:05" (1/1) ... [2025-02-08 05:36:05,123 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:05" (1/1) ... [2025-02-08 05:36:05,128 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:05" (1/1) ... [2025-02-08 05:36:05,129 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:05" (1/1) ... [2025-02-08 05:36:05,131 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:36:05,132 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:36:05,132 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:36:05,132 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:36:05,133 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:05" (1/1) ... [2025-02-08 05:36:05,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:36:05,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:36:05,169 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:36:05,180 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:36:05,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 05:36:05,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 05:36:05,193 INFO L130 BoogieDeclarations]: Found specification of procedure t1_fun [2025-02-08 05:36:05,193 INFO L138 BoogieDeclarations]: Found implementation of procedure t1_fun [2025-02-08 05:36:05,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:36:05,193 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:36:05,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:36:05,193 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2025-02-08 05:36:05,193 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2025-02-08 05:36:05,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:36:05,193 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:36:05,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:36:05,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:36:05,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 05:36:05,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:36:05,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:36:05,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:36:05,195 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:36:05,329 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:36:05,330 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:36:05,816 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1043: havoc main_~#t2_ids~0#1.base, main_~#t2_ids~0#1.offset; [2025-02-08 05:36:05,816 INFO L1324 $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-02-08 05:36:05,816 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1042: havoc main_~#t1_ids~0#1.base, main_~#t1_ids~0#1.offset; [2025-02-08 05:36:05,816 INFO L1324 $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-02-08 05:36:05,817 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:36:05,817 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:36:05,844 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:36:05,844 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:36:05,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:36:05 BoogieIcfgContainer [2025-02-08 05:36:05,844 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:36:05,846 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:36:05,846 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:36:05,849 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:36:05,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:36:04" (1/3) ... [2025-02-08 05:36:05,850 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7058376d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:36:05, skipping insertion in model container [2025-02-08 05:36:05,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:05" (2/3) ... [2025-02-08 05:36:05,850 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7058376d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:36:05, skipping insertion in model container [2025-02-08 05:36:05,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:36:05" (3/3) ... [2025-02-08 05:36:05,851 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_81-list_racing.i [2025-02-08 05:36:05,861 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:36:05,862 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_81-list_racing.i that has 3 procedures, 390 locations, 1 initial locations, 10 loop locations, and 22 error locations. [2025-02-08 05:36:05,862 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:36:05,977 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-08 05:36:06,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 396 places, 411 transitions, 842 flow [2025-02-08 05:36:06,175 INFO L124 PetriNetUnfolderBase]: 40/724 cut-off events. [2025-02-08 05:36:06,177 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-08 05:36:06,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 741 conditions, 724 events. 40/724 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3116 event pairs, 0 based on Foata normal form. 0/636 useless extension candidates. Maximal degree in co-relation 382. Up to 8 conditions per place. [2025-02-08 05:36:06,189 INFO L82 GeneralOperation]: Start removeDead. Operand has 396 places, 411 transitions, 842 flow [2025-02-08 05:36:06,196 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 396 places, 411 transitions, 842 flow [2025-02-08 05:36:06,201 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:36:06,209 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;@6982141, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:36:06,210 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-02-08 05:36:06,244 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:36:06,245 INFO L124 PetriNetUnfolderBase]: 0/85 cut-off events. [2025-02-08 05:36:06,245 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:36:06,246 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:36:06,246 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-02-08 05:36:06,247 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [t2_funErr7ASSERT_VIOLATIONDATA_RACE, t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE, t2_funErr4ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-02-08 05:36:06,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:36:06,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1948814336, now seen corresponding path program 1 times [2025-02-08 05:36:06,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:36:06,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340081481] [2025-02-08 05:36:06,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:36:06,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:36:06,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-08 05:36:06,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-08 05:36:06,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:36:06,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:36:06,491 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:36:06,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:36:06,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340081481] [2025-02-08 05:36:06,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340081481] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:36:06,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:36:06,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:36:06,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383562805] [2025-02-08 05:36:06,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:36:06,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:36:06,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:36:06,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:36:06,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:36:06,557 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 371 out of 411 [2025-02-08 05:36:06,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 411 transitions, 842 flow. Second operand has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 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:36:06,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:36:06,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 411 [2025-02-08 05:36:06,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:36:07,016 INFO L124 PetriNetUnfolderBase]: 184/2408 cut-off events. [2025-02-08 05:36:07,016 INFO L125 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES. [2025-02-08 05:36:07,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2742 conditions, 2408 events. 184/2408 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 17884 event pairs, 132 based on Foata normal form. 156/2333 useless extension candidates. Maximal degree in co-relation 1828. Up to 283 conditions per place. [2025-02-08 05:36:07,032 INFO L140 encePairwiseOnDemand]: 395/411 looper letters, 23 selfloop transitions, 2 changer transitions 0/395 dead transitions. [2025-02-08 05:36:07,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 395 transitions, 860 flow [2025-02-08 05:36:07,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:36:07,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:36:07,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1152 transitions. [2025-02-08 05:36:07,050 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9343065693430657 [2025-02-08 05:36:07,054 INFO L175 Difference]: Start difference. First operand has 396 places, 411 transitions, 842 flow. Second operand 3 states and 1152 transitions. [2025-02-08 05:36:07,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 395 transitions, 860 flow [2025-02-08 05:36:07,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 395 transitions, 860 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:36:07,068 INFO L231 Difference]: Finished difference. Result has 395 places, 395 transitions, 814 flow [2025-02-08 05:36:07,072 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=411, PETRI_DIFFERENCE_MINUEND_FLOW=810, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=814, PETRI_PLACES=395, PETRI_TRANSITIONS=395} [2025-02-08 05:36:07,075 INFO L279 CegarLoopForPetriNet]: 396 programPoint places, -1 predicate places. [2025-02-08 05:36:07,076 INFO L471 AbstractCegarLoop]: Abstraction has has 395 places, 395 transitions, 814 flow [2025-02-08 05:36:07,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 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:36:07,077 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:36:07,077 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-02-08 05:36:07,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:36:07,078 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [t2_funErr7ASSERT_VIOLATIONDATA_RACE, t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE, t2_funErr4ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-02-08 05:36:07,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:36:07,079 INFO L85 PathProgramCache]: Analyzing trace with hash -705306169, now seen corresponding path program 1 times [2025-02-08 05:36:07,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:36:07,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367713093] [2025-02-08 05:36:07,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:36:07,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:36:07,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-08 05:36:07,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-08 05:36:07,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:36:07,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:36:07,194 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:36:07,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:36:07,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367713093] [2025-02-08 05:36:07,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367713093] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:36:07,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:36:07,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:36:07,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862952032] [2025-02-08 05:36:07,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:36:07,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:36:07,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:36:07,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:36:07,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:36:07,228 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 371 out of 411 [2025-02-08 05:36:07,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 395 transitions, 814 flow. Second operand has 3 states, 3 states have (on average 372.0) internal successors, (1116), 3 states have internal predecessors, (1116), 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:36:07,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:36:07,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 411 [2025-02-08 05:36:07,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:36:07,545 INFO L124 PetriNetUnfolderBase]: 104/1872 cut-off events. [2025-02-08 05:36:07,546 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2025-02-08 05:36:07,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2119 conditions, 1872 events. 104/1872 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 11451 event pairs, 72 based on Foata normal form. 0/1696 useless extension candidates. Maximal degree in co-relation 2024. Up to 185 conditions per place. [2025-02-08 05:36:07,562 INFO L140 encePairwiseOnDemand]: 407/411 looper letters, 22 selfloop transitions, 1 changer transitions 0/392 dead transitions. [2025-02-08 05:36:07,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 392 transitions, 854 flow [2025-02-08 05:36:07,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:36:07,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:36:07,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1139 transitions. [2025-02-08 05:36:07,569 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9237631792376317 [2025-02-08 05:36:07,569 INFO L175 Difference]: Start difference. First operand has 395 places, 395 transitions, 814 flow. Second operand 3 states and 1139 transitions. [2025-02-08 05:36:07,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 394 places, 392 transitions, 854 flow [2025-02-08 05:36:07,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 392 places, 392 transitions, 850 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:36:07,576 INFO L231 Difference]: Finished difference. Result has 392 places, 392 transitions, 806 flow [2025-02-08 05:36:07,577 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=411, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=390, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=806, PETRI_PLACES=392, PETRI_TRANSITIONS=392} [2025-02-08 05:36:07,577 INFO L279 CegarLoopForPetriNet]: 396 programPoint places, -4 predicate places. [2025-02-08 05:36:07,577 INFO L471 AbstractCegarLoop]: Abstraction has has 392 places, 392 transitions, 806 flow [2025-02-08 05:36:07,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.0) internal successors, (1116), 3 states have internal predecessors, (1116), 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:36:07,578 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:36:07,578 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-02-08 05:36:07,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:36:07,579 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [t2_funErr7ASSERT_VIOLATIONDATA_RACE, t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE, t2_funErr4ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-02-08 05:36:07,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:36:07,579 INFO L85 PathProgramCache]: Analyzing trace with hash 289994766, now seen corresponding path program 1 times [2025-02-08 05:36:07,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:36:07,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115613713] [2025-02-08 05:36:07,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:36:07,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:36:07,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-08 05:36:07,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 05:36:07,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:36:07,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:36:08,124 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:36:08,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:36:08,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115613713] [2025-02-08 05:36:08,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115613713] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:36:08,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:36:08,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:36:08,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691198714] [2025-02-08 05:36:08,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:36:08,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:36:08,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:36:08,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:36:08,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:36:08,478 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 411 [2025-02-08 05:36:08,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 392 transitions, 806 flow. Second operand has 6 states, 6 states have (on average 307.3333333333333) internal successors, (1844), 6 states have internal predecessors, (1844), 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:36:08,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:36:08,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 411 [2025-02-08 05:36:08,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:36:15,470 INFO L124 PetriNetUnfolderBase]: 22282/61168 cut-off events. [2025-02-08 05:36:15,470 INFO L125 PetriNetUnfolderBase]: For 421/421 co-relation queries the response was YES. [2025-02-08 05:36:15,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95235 conditions, 61168 events. 22282/61168 cut-off events. For 421/421 co-relation queries the response was YES. Maximal size of possible extension queue 1103. Compared 724041 event pairs, 21418 based on Foata normal form. 0/57030 useless extension candidates. Maximal degree in co-relation 95141. Up to 33875 conditions per place. [2025-02-08 05:36:15,766 INFO L140 encePairwiseOnDemand]: 405/411 looper letters, 85 selfloop transitions, 5 changer transitions 0/391 dead transitions. [2025-02-08 05:36:15,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 391 transitions, 984 flow [2025-02-08 05:36:15,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:36:15,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:36:15,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1927 transitions. [2025-02-08 05:36:15,772 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7814274128142741 [2025-02-08 05:36:15,772 INFO L175 Difference]: Start difference. First operand has 392 places, 392 transitions, 806 flow. Second operand 6 states and 1927 transitions. [2025-02-08 05:36:15,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 391 transitions, 984 flow [2025-02-08 05:36:15,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 391 transitions, 983 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:36:15,783 INFO L231 Difference]: Finished difference. Result has 395 places, 391 transitions, 813 flow [2025-02-08 05:36:15,784 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=411, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=390, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=813, PETRI_PLACES=395, PETRI_TRANSITIONS=391} [2025-02-08 05:36:15,785 INFO L279 CegarLoopForPetriNet]: 396 programPoint places, -1 predicate places. [2025-02-08 05:36:15,785 INFO L471 AbstractCegarLoop]: Abstraction has has 395 places, 391 transitions, 813 flow [2025-02-08 05:36:15,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 307.3333333333333) internal successors, (1844), 6 states have internal predecessors, (1844), 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:36:15,786 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:36:15,786 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-02-08 05:36:15,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:36:15,786 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [t2_funErr7ASSERT_VIOLATIONDATA_RACE, t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE, t2_funErr4ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-02-08 05:36:15,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:36:15,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1807891798, now seen corresponding path program 1 times [2025-02-08 05:36:15,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:36:15,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307804054] [2025-02-08 05:36:15,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:36:15,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:36:15,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-08 05:36:15,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-08 05:36:15,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:36:15,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:36:16,128 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:36:16,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:36:16,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307804054] [2025-02-08 05:36:16,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307804054] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:36:16,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:36:16,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:36:16,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937654617] [2025-02-08 05:36:16,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:36:16,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:36:16,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:36:16,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:36:16,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:36:16,433 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 411 [2025-02-08 05:36:16,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 391 transitions, 813 flow. Second operand has 6 states, 6 states have (on average 307.3333333333333) internal successors, (1844), 6 states have internal predecessors, (1844), 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:36:16,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:36:16,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 411 [2025-02-08 05:36:16,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:36:22,353 INFO L124 PetriNetUnfolderBase]: 22282/61167 cut-off events. [2025-02-08 05:36:22,354 INFO L125 PetriNetUnfolderBase]: For 421/421 co-relation queries the response was YES. [2025-02-08 05:36:22,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95239 conditions, 61167 events. 22282/61167 cut-off events. For 421/421 co-relation queries the response was YES. Maximal size of possible extension queue 1103. Compared 724079 event pairs, 21418 based on Foata normal form. 0/57030 useless extension candidates. Maximal degree in co-relation 95145. Up to 33875 conditions per place. [2025-02-08 05:36:22,683 INFO L140 encePairwiseOnDemand]: 405/411 looper letters, 85 selfloop transitions, 5 changer transitions 0/390 dead transitions. [2025-02-08 05:36:22,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 390 transitions, 991 flow [2025-02-08 05:36:22,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:36:22,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:36:22,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1927 transitions. [2025-02-08 05:36:22,686 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7814274128142741 [2025-02-08 05:36:22,687 INFO L175 Difference]: Start difference. First operand has 395 places, 391 transitions, 813 flow. Second operand 6 states and 1927 transitions. [2025-02-08 05:36:22,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 390 transitions, 991 flow [2025-02-08 05:36:22,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 394 places, 390 transitions, 981 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:36:22,695 INFO L231 Difference]: Finished difference. Result has 394 places, 390 transitions, 811 flow [2025-02-08 05:36:22,695 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=411, PETRI_DIFFERENCE_MINUEND_FLOW=801, PETRI_DIFFERENCE_MINUEND_PLACES=389, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=811, PETRI_PLACES=394, PETRI_TRANSITIONS=390} [2025-02-08 05:36:22,697 INFO L279 CegarLoopForPetriNet]: 396 programPoint places, -2 predicate places. [2025-02-08 05:36:22,697 INFO L471 AbstractCegarLoop]: Abstraction has has 394 places, 390 transitions, 811 flow [2025-02-08 05:36:22,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 307.3333333333333) internal successors, (1844), 6 states have internal predecessors, (1844), 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:36:22,698 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:36:22,698 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-02-08 05:36:22,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:36:22,698 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [t2_funErr7ASSERT_VIOLATIONDATA_RACE, t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE, t2_funErr4ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-02-08 05:36:22,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:36:22,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1424929058, now seen corresponding path program 1 times [2025-02-08 05:36:22,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:36:22,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25395802] [2025-02-08 05:36:22,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:36:22,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:36:22,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-08 05:36:22,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-08 05:36:22,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:36:22,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:36:23,129 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:36:23,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:36:23,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25395802] [2025-02-08 05:36:23,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25395802] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:36:23,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:36:23,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:36:23,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114641228] [2025-02-08 05:36:23,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:36:23,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:36:23,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:36:23,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:36:23,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:36:23,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 411 [2025-02-08 05:36:23,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 390 transitions, 811 flow. Second operand has 6 states, 6 states have (on average 301.8333333333333) internal successors, (1811), 6 states have internal predecessors, (1811), 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:36:23,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:36:23,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 411 [2025-02-08 05:36:23,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:36:31,151 INFO L124 PetriNetUnfolderBase]: 26036/70842 cut-off events. [2025-02-08 05:36:31,151 INFO L125 PetriNetUnfolderBase]: For 421/421 co-relation queries the response was YES. [2025-02-08 05:36:31,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110650 conditions, 70842 events. 26036/70842 cut-off events. For 421/421 co-relation queries the response was YES. Maximal size of possible extension queue 1375. Compared 867446 event pairs, 24776 based on Foata normal form. 0/65983 useless extension candidates. Maximal degree in co-relation 110555. Up to 39463 conditions per place. [2025-02-08 05:36:31,487 INFO L140 encePairwiseOnDemand]: 384/411 looper letters, 105 selfloop transitions, 86 changer transitions 0/483 dead transitions. [2025-02-08 05:36:31,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 483 transitions, 1379 flow [2025-02-08 05:36:31,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:36:31,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:36:31,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1986 transitions. [2025-02-08 05:36:31,491 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.805352798053528 [2025-02-08 05:36:31,491 INFO L175 Difference]: Start difference. First operand has 394 places, 390 transitions, 811 flow. Second operand 6 states and 1986 transitions. [2025-02-08 05:36:31,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 483 transitions, 1379 flow [2025-02-08 05:36:31,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 394 places, 483 transitions, 1369 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:36:31,502 INFO L231 Difference]: Finished difference. Result has 399 places, 475 transitions, 1367 flow [2025-02-08 05:36:31,503 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=411, PETRI_DIFFERENCE_MINUEND_FLOW=801, PETRI_DIFFERENCE_MINUEND_PLACES=389, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1367, PETRI_PLACES=399, PETRI_TRANSITIONS=475} [2025-02-08 05:36:31,503 INFO L279 CegarLoopForPetriNet]: 396 programPoint places, 3 predicate places. [2025-02-08 05:36:31,503 INFO L471 AbstractCegarLoop]: Abstraction has has 399 places, 475 transitions, 1367 flow [2025-02-08 05:36:31,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 301.8333333333333) internal successors, (1811), 6 states have internal predecessors, (1811), 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:36:31,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:36:31,504 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:31,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:36:31,505 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [t2_funErr7ASSERT_VIOLATIONDATA_RACE, t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE, t2_funErr4ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-02-08 05:36:31,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:36:31,505 INFO L85 PathProgramCache]: Analyzing trace with hash -526030014, now seen corresponding path program 1 times [2025-02-08 05:36:31,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:36:31,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074008423] [2025-02-08 05:36:31,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:36:31,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:36:31,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-08 05:36:31,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-08 05:36:31,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:36:31,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:36:31,573 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:36:31,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:36:31,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074008423] [2025-02-08 05:36:31,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074008423] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:36:31,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:36:31,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:36:31,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377001318] [2025-02-08 05:36:31,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:36:31,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:36:31,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:36:31,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:36:31,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:36:31,595 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 375 out of 411 [2025-02-08 05:36:31,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 475 transitions, 1367 flow. Second operand has 3 states, 3 states have (on average 376.3333333333333) internal successors, (1129), 3 states have internal predecessors, (1129), 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:36:31,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:36:31,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 375 of 411 [2025-02-08 05:36:31,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:36:31,960 INFO L124 PetriNetUnfolderBase]: 309/2483 cut-off events. [2025-02-08 05:36:31,961 INFO L125 PetriNetUnfolderBase]: For 218/241 co-relation queries the response was YES. [2025-02-08 05:36:31,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3385 conditions, 2483 events. 309/2483 cut-off events. For 218/241 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 17039 event pairs, 94 based on Foata normal form. 1/2289 useless extension candidates. Maximal degree in co-relation 3286. Up to 237 conditions per place. [2025-02-08 05:36:31,970 INFO L140 encePairwiseOnDemand]: 408/411 looper letters, 22 selfloop transitions, 3 changer transitions 0/477 dead transitions. [2025-02-08 05:36:31,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 477 transitions, 1421 flow [2025-02-08 05:36:31,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:36:31,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:36:31,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1150 transitions. [2025-02-08 05:36:31,972 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9326845093268451 [2025-02-08 05:36:31,972 INFO L175 Difference]: Start difference. First operand has 399 places, 475 transitions, 1367 flow. Second operand 3 states and 1150 transitions. [2025-02-08 05:36:31,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 477 transitions, 1421 flow [2025-02-08 05:36:31,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 477 transitions, 1421 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:36:31,981 INFO L231 Difference]: Finished difference. Result has 402 places, 475 transitions, 1378 flow [2025-02-08 05:36:31,982 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=411, PETRI_DIFFERENCE_MINUEND_FLOW=1367, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=472, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1378, PETRI_PLACES=402, PETRI_TRANSITIONS=475} [2025-02-08 05:36:31,982 INFO L279 CegarLoopForPetriNet]: 396 programPoint places, 6 predicate places. [2025-02-08 05:36:31,983 INFO L471 AbstractCegarLoop]: Abstraction has has 402 places, 475 transitions, 1378 flow [2025-02-08 05:36:31,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 376.3333333333333) internal successors, (1129), 3 states have internal predecessors, (1129), 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:36:31,983 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:36:31,984 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-02-08 05:36:31,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:36:31,984 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [t2_funErr7ASSERT_VIOLATIONDATA_RACE, t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE, t2_funErr4ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-02-08 05:36:31,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:36:31,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1849782868, now seen corresponding path program 1 times [2025-02-08 05:36:31,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:36:31,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445523759] [2025-02-08 05:36:31,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:36:31,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:36:32,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-08 05:36:32,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-08 05:36:32,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:36:32,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:36:32,022 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:36:32,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-08 05:36:32,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-08 05:36:32,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:36:32,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:36:32,092 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:36:32,092 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:36:32,093 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 38 remaining) [2025-02-08 05:36:32,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr7ASSERT_VIOLATIONDATA_RACE (36 of 38 remaining) [2025-02-08 05:36:32,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr6ASSERT_VIOLATIONDATA_RACE (35 of 38 remaining) [2025-02-08 05:36:32,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr5ASSERT_VIOLATIONDATA_RACE (34 of 38 remaining) [2025-02-08 05:36:32,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr4ASSERT_VIOLATIONDATA_RACE (33 of 38 remaining) [2025-02-08 05:36:32,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr3ASSERT_VIOLATIONDATA_RACE (32 of 38 remaining) [2025-02-08 05:36:32,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr1ASSERT_VIOLATIONDATA_RACE (31 of 38 remaining) [2025-02-08 05:36:32,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr2ASSERT_VIOLATIONDATA_RACE (30 of 38 remaining) [2025-02-08 05:36:32,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr0ASSERT_VIOLATIONDATA_RACE (29 of 38 remaining) [2025-02-08 05:36:32,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (28 of 38 remaining) [2025-02-08 05:36:32,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (27 of 38 remaining) [2025-02-08 05:36:32,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (26 of 38 remaining) [2025-02-08 05:36:32,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (25 of 38 remaining) [2025-02-08 05:36:32,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (24 of 38 remaining) [2025-02-08 05:36:32,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (23 of 38 remaining) [2025-02-08 05:36:32,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (22 of 38 remaining) [2025-02-08 05:36:32,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (21 of 38 remaining) [2025-02-08 05:36:32,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 38 remaining) [2025-02-08 05:36:32,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr5ASSERT_VIOLATIONDATA_RACE (19 of 38 remaining) [2025-02-08 05:36:32,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr4ASSERT_VIOLATIONDATA_RACE (18 of 38 remaining) [2025-02-08 05:36:32,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr3ASSERT_VIOLATIONDATA_RACE (17 of 38 remaining) [2025-02-08 05:36:32,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr2ASSERT_VIOLATIONDATA_RACE (16 of 38 remaining) [2025-02-08 05:36:32,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr1ASSERT_VIOLATIONDATA_RACE (15 of 38 remaining) [2025-02-08 05:36:32,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr0ASSERT_VIOLATIONDATA_RACE (14 of 38 remaining) [2025-02-08 05:36:32,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr7ASSERT_VIOLATIONDATA_RACE (13 of 38 remaining) [2025-02-08 05:36:32,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr6ASSERT_VIOLATIONDATA_RACE (12 of 38 remaining) [2025-02-08 05:36:32,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr5ASSERT_VIOLATIONDATA_RACE (11 of 38 remaining) [2025-02-08 05:36:32,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr4ASSERT_VIOLATIONDATA_RACE (10 of 38 remaining) [2025-02-08 05:36:32,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr3ASSERT_VIOLATIONDATA_RACE (9 of 38 remaining) [2025-02-08 05:36:32,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr1ASSERT_VIOLATIONDATA_RACE (8 of 38 remaining) [2025-02-08 05:36:32,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr2ASSERT_VIOLATIONDATA_RACE (7 of 38 remaining) [2025-02-08 05:36:32,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr0ASSERT_VIOLATIONDATA_RACE (6 of 38 remaining) [2025-02-08 05:36:32,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr5ASSERT_VIOLATIONDATA_RACE (5 of 38 remaining) [2025-02-08 05:36:32,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr4ASSERT_VIOLATIONDATA_RACE (4 of 38 remaining) [2025-02-08 05:36:32,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 38 remaining) [2025-02-08 05:36:32,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 38 remaining) [2025-02-08 05:36:32,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 38 remaining) [2025-02-08 05:36:32,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 38 remaining) [2025-02-08 05:36:32,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:36:32,097 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:36:32,099 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:36:32,099 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 05:36:32,181 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-02-08 05:36:32,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 603 places, 634 transitions, 1312 flow [2025-02-08 05:36:32,471 INFO L124 PetriNetUnfolderBase]: 153/1967 cut-off events. [2025-02-08 05:36:32,472 INFO L125 PetriNetUnfolderBase]: For 72/90 co-relation queries the response was YES. [2025-02-08 05:36:32,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2056 conditions, 1967 events. 153/1967 cut-off events. For 72/90 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 13379 event pairs, 2 based on Foata normal form. 0/1705 useless extension candidates. Maximal degree in co-relation 1247. Up to 32 conditions per place. [2025-02-08 05:36:32,521 INFO L82 GeneralOperation]: Start removeDead. Operand has 603 places, 634 transitions, 1312 flow [2025-02-08 05:36:32,540 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 603 places, 634 transitions, 1312 flow [2025-02-08 05:36:32,541 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:36:32,542 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;@6982141, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:36:32,543 INFO L334 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2025-02-08 05:36:32,547 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:36:32,547 INFO L124 PetriNetUnfolderBase]: 0/85 cut-off events. [2025-02-08 05:36:32,547 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:36:32,548 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:36:32,548 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-02-08 05:36:32,548 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [t2_funErr7ASSERT_VIOLATIONDATA_RACE, t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE, t2_funErr4ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-02-08 05:36:32,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:36:32,549 INFO L85 PathProgramCache]: Analyzing trace with hash -356312968, now seen corresponding path program 1 times [2025-02-08 05:36:32,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:36:32,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168830488] [2025-02-08 05:36:32,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:36:32,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:36:32,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-08 05:36:32,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-08 05:36:32,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:36:32,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:36:32,579 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:36:32,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:36:32,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168830488] [2025-02-08 05:36:32,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168830488] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:36:32,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:36:32,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:36:32,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112846400] [2025-02-08 05:36:32,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:36:32,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:36:32,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:36:32,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:36:32,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:36:32,601 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 562 out of 634 [2025-02-08 05:36:32,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 603 places, 634 transitions, 1312 flow. Second operand has 3 states, 3 states have (on average 563.3333333333334) internal successors, (1690), 3 states have internal predecessors, (1690), 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:36:32,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:36:32,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 562 of 634 [2025-02-08 05:36:32,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand