./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_82-list_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 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_82-list_racefree.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6ac894f5c6207d1329786eb676509b79ca36f8c33f880cc59ffa30652ab92765 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:21:21,107 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:21:21,159 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:21:21,163 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:21:21,163 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:21:21,176 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:21:21,176 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:21:21,176 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:21:21,177 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:21:21,177 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:21:21,177 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:21:21,177 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:21:21,177 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:21:21,177 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:21:21,177 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:21:21,178 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:21:21,178 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:21:21,178 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:21:21,178 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:21:21,178 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:21:21,178 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:21:21,178 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:21:21,178 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:21:21,178 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:21:21,178 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:21:21,178 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:21:21,178 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:21:21,178 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:21:21,179 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:21:21,179 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:21:21,179 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:21:21,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:21:21,179 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:21:21,179 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:21:21,179 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:21:21,179 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:21:21,179 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:21:21,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:21:21,179 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:21:21,179 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:21:21,179 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:21:21,179 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:21:21,179 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 -> 6ac894f5c6207d1329786eb676509b79ca36f8c33f880cc59ffa30652ab92765 [2025-03-13 22:21:21,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:21:21,440 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:21:21,441 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:21:21,442 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:21:21,442 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:21:21,443 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_82-list_racefree.i [2025-03-13 22:21:22,588 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e98db9ac0/03fcdbea64974c048056db029cbc1805/FLAGc17a493c2 [2025-03-13 22:21:22,965 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:21:22,966 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_82-list_racefree.i [2025-03-13 22:21:22,979 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e98db9ac0/03fcdbea64974c048056db029cbc1805/FLAGc17a493c2 [2025-03-13 22:21:23,170 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e98db9ac0/03fcdbea64974c048056db029cbc1805 [2025-03-13 22:21:23,172 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:21:23,173 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:21:23,174 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:21:23,174 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:21:23,177 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:21:23,178 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:21:23" (1/1) ... [2025-03-13 22:21:23,178 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5403b61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:23, skipping insertion in model container [2025-03-13 22:21:23,178 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:21:23" (1/1) ... [2025-03-13 22:21:23,203 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:21:23,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:21:23,608 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:21:23,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:21:23,696 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:21:23,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:23 WrapperNode [2025-03-13 22:21:23,697 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:21:23,697 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:21:23,697 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:21:23,697 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:21:23,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:23" (1/1) ... [2025-03-13 22:21:23,713 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:23" (1/1) ... [2025-03-13 22:21:23,736 INFO L138 Inliner]: procedures = 279, calls = 68, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 324 [2025-03-13 22:21:23,736 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:21:23,737 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:21:23,737 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:21:23,737 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:21:23,746 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:23" (1/1) ... [2025-03-13 22:21:23,747 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:23" (1/1) ... [2025-03-13 22:21:23,753 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:23" (1/1) ... [2025-03-13 22:21:23,756 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:23" (1/1) ... [2025-03-13 22:21:23,775 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:23" (1/1) ... [2025-03-13 22:21:23,777 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:23" (1/1) ... [2025-03-13 22:21:23,779 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:23" (1/1) ... [2025-03-13 22:21:23,779 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:23" (1/1) ... [2025-03-13 22:21:23,784 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:21:23,785 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:21:23,785 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:21:23,785 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:21:23,787 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:23" (1/1) ... [2025-03-13 22:21:23,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:21:23,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:21:23,811 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-13 22:21:23,815 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-13 22:21:23,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-13 22:21:23,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-13 22:21:23,832 INFO L130 BoogieDeclarations]: Found specification of procedure t1_fun [2025-03-13 22:21:23,832 INFO L138 BoogieDeclarations]: Found implementation of procedure t1_fun [2025-03-13 22:21:23,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-13 22:21:23,832 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 22:21:23,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:21:23,832 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2025-03-13 22:21:23,833 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2025-03-13 22:21:23,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:21:23,833 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 22:21:23,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 22:21:23,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:21:23,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-13 22:21:23,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:21:23,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:21:23,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:21:23,835 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:21:23,965 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:21:23,966 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:21:24,414 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L1044: havoc main_~#t1_ids~0#1.base, main_~#t1_ids~0#1.offset; [2025-03-13 22:21:24,414 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L1044-1: SUMMARY for call ULTIMATE.dealloc(main_~#t1_ids~0#1.base, main_~#t1_ids~0#1.offset); srcloc: null [2025-03-13 22:21:24,414 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L1045: havoc main_~#t2_ids~0#1.base, main_~#t2_ids~0#1.offset; [2025-03-13 22:21:24,414 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L1045-1: SUMMARY for call ULTIMATE.dealloc(main_~#t2_ids~0#1.base, main_~#t2_ids~0#1.offset); srcloc: null [2025-03-13 22:21:24,415 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:21:24,416 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:21:24,416 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:21:24,443 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:21:24,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:21:24 BoogieIcfgContainer [2025-03-13 22:21:24,447 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:21:24,448 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:21:24,448 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:21:24,451 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:21:24,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:21:23" (1/3) ... [2025-03-13 22:21:24,452 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e8d59a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:21:24, skipping insertion in model container [2025-03-13 22:21:24,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:23" (2/3) ... [2025-03-13 22:21:24,452 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e8d59a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:21:24, skipping insertion in model container [2025-03-13 22:21:24,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:21:24" (3/3) ... [2025-03-13 22:21:24,453 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_82-list_racefree.i [2025-03-13 22:21:24,463 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:21:24,465 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_82-list_racefree.i that has 3 procedures, 339 locations, 1 initial locations, 9 loop locations, and 22 error locations. [2025-03-13 22:21:24,465 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:21:24,556 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-13 22:21:24,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 345 places, 360 transitions, 740 flow [2025-03-13 22:21:24,782 INFO L124 PetriNetUnfolderBase]: 40/672 cut-off events. [2025-03-13 22:21:24,785 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-13 22:21:24,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 672 events. 40/672 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3069 event pairs, 0 based on Foata normal form. 0/584 useless extension candidates. Maximal degree in co-relation 337. Up to 8 conditions per place. [2025-03-13 22:21:24,795 INFO L82 GeneralOperation]: Start removeDead. Operand has 345 places, 360 transitions, 740 flow [2025-03-13 22:21:24,803 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 345 places, 360 transitions, 740 flow [2025-03-13 22:21:24,811 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:21:24,819 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;@18b8ec79, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:21:24,820 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-03-13 22:21:24,826 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:21:24,827 INFO L124 PetriNetUnfolderBase]: 0/35 cut-off events. [2025-03-13 22:21:24,827 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:21:24,827 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:21:24,827 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:21:24,828 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-13 22:21:24,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:21:24,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1342238474, now seen corresponding path program 1 times [2025-03-13 22:21:24,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:21:24,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604352419] [2025-03-13 22:21:24,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:21:24,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:21:24,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-13 22:21:24,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-13 22:21:24,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:21:24,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:21:25,031 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-13 22:21:25,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:21:25,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604352419] [2025-03-13 22:21:25,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604352419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:21:25,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:21:25,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:21:25,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859775778] [2025-03-13 22:21:25,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:21:25,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:21:25,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:21:25,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:21:25,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:21:25,083 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 360 [2025-03-13 22:21:25,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 360 transitions, 740 flow. Second operand has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 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-13 22:21:25,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:21:25,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 360 [2025-03-13 22:21:25,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:21:25,533 INFO L124 PetriNetUnfolderBase]: 210/2372 cut-off events. [2025-03-13 22:21:25,534 INFO L125 PetriNetUnfolderBase]: For 120/120 co-relation queries the response was YES. [2025-03-13 22:21:25,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2760 conditions, 2372 events. 210/2372 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 18032 event pairs, 158 based on Foata normal form. 108/2249 useless extension candidates. Maximal degree in co-relation 1876. Up to 333 conditions per place. [2025-03-13 22:21:25,549 INFO L140 encePairwiseOnDemand]: 344/360 looper letters, 25 selfloop transitions, 2 changer transitions 0/344 dead transitions. [2025-03-13 22:21:25,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 344 transitions, 762 flow [2025-03-13 22:21:25,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:21:25,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:21:25,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 995 transitions. [2025-03-13 22:21:25,562 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9212962962962963 [2025-03-13 22:21:25,563 INFO L175 Difference]: Start difference. First operand has 345 places, 360 transitions, 740 flow. Second operand 3 states and 995 transitions. [2025-03-13 22:21:25,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 344 transitions, 762 flow [2025-03-13 22:21:25,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 344 transitions, 762 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:21:25,574 INFO L231 Difference]: Finished difference. Result has 344 places, 344 transitions, 712 flow [2025-03-13 22:21:25,577 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=708, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=342, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=712, PETRI_PLACES=344, PETRI_TRANSITIONS=344} [2025-03-13 22:21:25,579 INFO L279 CegarLoopForPetriNet]: 345 programPoint places, -1 predicate places. [2025-03-13 22:21:25,579 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 344 transitions, 712 flow [2025-03-13 22:21:25,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 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-13 22:21:25,580 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:21:25,580 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] [2025-03-13 22:21:25,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:21:25,581 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-13 22:21:25,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:21:25,581 INFO L85 PathProgramCache]: Analyzing trace with hash 2038444268, now seen corresponding path program 1 times [2025-03-13 22:21:25,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:21:25,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378196495] [2025-03-13 22:21:25,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:21:25,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:21:25,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-13 22:21:25,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-13 22:21:25,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:21:25,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:21:25,680 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-13 22:21:25,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:21:25,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378196495] [2025-03-13 22:21:25,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378196495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:21:25,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:21:25,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:21:25,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7927562] [2025-03-13 22:21:25,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:21:25,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:21:25,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:21:25,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:21:25,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:21:25,702 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 360 [2025-03-13 22:21:25,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 344 transitions, 712 flow. Second operand has 3 states, 3 states have (on average 319.0) internal successors, (957), 3 states have internal predecessors, (957), 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-13 22:21:25,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:21:25,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 360 [2025-03-13 22:21:25,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:21:25,989 INFO L124 PetriNetUnfolderBase]: 118/1985 cut-off events. [2025-03-13 22:21:25,990 INFO L125 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2025-03-13 22:21:26,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2264 conditions, 1985 events. 118/1985 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 12994 event pairs, 84 based on Foata normal form. 0/1794 useless extension candidates. Maximal degree in co-relation 2219. Up to 213 conditions per place. [2025-03-13 22:21:26,010 INFO L140 encePairwiseOnDemand]: 356/360 looper letters, 24 selfloop transitions, 1 changer transitions 0/341 dead transitions. [2025-03-13 22:21:26,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 341 transitions, 756 flow [2025-03-13 22:21:26,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:21:26,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:21:26,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 982 transitions. [2025-03-13 22:21:26,014 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9092592592592592 [2025-03-13 22:21:26,014 INFO L175 Difference]: Start difference. First operand has 344 places, 344 transitions, 712 flow. Second operand 3 states and 982 transitions. [2025-03-13 22:21:26,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 341 transitions, 756 flow [2025-03-13 22:21:26,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 341 transitions, 752 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:21:26,025 INFO L231 Difference]: Finished difference. Result has 341 places, 341 transitions, 704 flow [2025-03-13 22:21:26,026 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=704, PETRI_PLACES=341, PETRI_TRANSITIONS=341} [2025-03-13 22:21:26,027 INFO L279 CegarLoopForPetriNet]: 345 programPoint places, -4 predicate places. [2025-03-13 22:21:26,027 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 341 transitions, 704 flow [2025-03-13 22:21:26,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.0) internal successors, (957), 3 states have internal predecessors, (957), 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-13 22:21:26,027 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:21:26,028 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] [2025-03-13 22:21:26,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:21:26,030 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-13 22:21:26,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:21:26,031 INFO L85 PathProgramCache]: Analyzing trace with hash 475468037, now seen corresponding path program 1 times [2025-03-13 22:21:26,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:21:26,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940116573] [2025-03-13 22:21:26,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:21:26,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:21:26,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-13 22:21:26,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-13 22:21:26,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:21:26,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:21:26,557 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-13 22:21:26,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:21:26,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940116573] [2025-03-13 22:21:26,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940116573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:21:26,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:21:26,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:21:26,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522705484] [2025-03-13 22:21:26,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:21:26,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:21:26,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:21:26,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:21:26,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:21:26,941 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 360 [2025-03-13 22:21:26,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 341 transitions, 704 flow. Second operand has 6 states, 6 states have (on average 254.33333333333334) internal successors, (1526), 6 states have internal predecessors, (1526), 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-13 22:21:26,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:21:26,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 360 [2025-03-13 22:21:26,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:21:33,726 INFO L124 PetriNetUnfolderBase]: 23474/62699 cut-off events. [2025-03-13 22:21:33,726 INFO L125 PetriNetUnfolderBase]: For 409/409 co-relation queries the response was YES. [2025-03-13 22:21:33,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98592 conditions, 62699 events. 23474/62699 cut-off events. For 409/409 co-relation queries the response was YES. Maximal size of possible extension queue 1097. Compared 737294 event pairs, 22570 based on Foata normal form. 0/58442 useless extension candidates. Maximal degree in co-relation 98548. Up to 35705 conditions per place. [2025-03-13 22:21:34,020 INFO L140 encePairwiseOnDemand]: 354/360 looper letters, 87 selfloop transitions, 5 changer transitions 0/340 dead transitions. [2025-03-13 22:21:34,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 340 transitions, 886 flow [2025-03-13 22:21:34,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:21:34,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:21:34,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1611 transitions. [2025-03-13 22:21:34,024 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7458333333333333 [2025-03-13 22:21:34,024 INFO L175 Difference]: Start difference. First operand has 341 places, 341 transitions, 704 flow. Second operand 6 states and 1611 transitions. [2025-03-13 22:21:34,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 340 transitions, 886 flow [2025-03-13 22:21:34,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 340 transitions, 885 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:21:34,037 INFO L231 Difference]: Finished difference. Result has 344 places, 340 transitions, 711 flow [2025-03-13 22:21:34,038 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=711, PETRI_PLACES=344, PETRI_TRANSITIONS=340} [2025-03-13 22:21:34,039 INFO L279 CegarLoopForPetriNet]: 345 programPoint places, -1 predicate places. [2025-03-13 22:21:34,039 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 340 transitions, 711 flow [2025-03-13 22:21:34,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 254.33333333333334) internal successors, (1526), 6 states have internal predecessors, (1526), 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-13 22:21:34,040 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:21:34,040 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] [2025-03-13 22:21:34,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:21:34,040 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-13 22:21:34,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:21:34,042 INFO L85 PathProgramCache]: Analyzing trace with hash -289956469, now seen corresponding path program 1 times [2025-03-13 22:21:34,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:21:34,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655409781] [2025-03-13 22:21:34,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:21:34,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:21:34,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-13 22:21:34,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-13 22:21:34,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:21:34,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:21:34,323 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-13 22:21:34,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:21:34,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655409781] [2025-03-13 22:21:34,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655409781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:21:34,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:21:34,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:21:34,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324067276] [2025-03-13 22:21:34,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:21:34,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:21:34,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:21:34,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:21:34,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:21:34,655 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 360 [2025-03-13 22:21:34,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 340 transitions, 711 flow. Second operand has 6 states, 6 states have (on average 254.33333333333334) internal successors, (1526), 6 states have internal predecessors, (1526), 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-13 22:21:34,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:21:34,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 360 [2025-03-13 22:21:34,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:21:40,135 INFO L124 PetriNetUnfolderBase]: 23463/62230 cut-off events. [2025-03-13 22:21:40,136 INFO L125 PetriNetUnfolderBase]: For 409/409 co-relation queries the response was YES. [2025-03-13 22:21:40,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98166 conditions, 62230 events. 23463/62230 cut-off events. For 409/409 co-relation queries the response was YES. Maximal size of possible extension queue 1098. Compared 728778 event pairs, 22570 based on Foata normal form. 0/57919 useless extension candidates. Maximal degree in co-relation 98122. Up to 35743 conditions per place. [2025-03-13 22:21:40,572 INFO L140 encePairwiseOnDemand]: 354/360 looper letters, 87 selfloop transitions, 5 changer transitions 0/339 dead transitions. [2025-03-13 22:21:40,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 339 transitions, 893 flow [2025-03-13 22:21:40,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:21:40,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:21:40,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1611 transitions. [2025-03-13 22:21:40,579 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7458333333333333 [2025-03-13 22:21:40,580 INFO L175 Difference]: Start difference. First operand has 344 places, 340 transitions, 711 flow. Second operand 6 states and 1611 transitions. [2025-03-13 22:21:40,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 339 transitions, 893 flow [2025-03-13 22:21:40,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 339 transitions, 883 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:21:40,591 INFO L231 Difference]: Finished difference. Result has 343 places, 339 transitions, 709 flow [2025-03-13 22:21:40,592 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=709, PETRI_PLACES=343, PETRI_TRANSITIONS=339} [2025-03-13 22:21:40,596 INFO L279 CegarLoopForPetriNet]: 345 programPoint places, -2 predicate places. [2025-03-13 22:21:40,596 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 339 transitions, 709 flow [2025-03-13 22:21:40,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 254.33333333333334) internal successors, (1526), 6 states have internal predecessors, (1526), 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-13 22:21:40,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:21:40,598 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] [2025-03-13 22:21:40,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:21:40,598 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-13 22:21:40,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:21:40,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1775729795, now seen corresponding path program 1 times [2025-03-13 22:21:40,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:21:40,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310123353] [2025-03-13 22:21:40,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:21:40,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:21:40,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-13 22:21:40,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-13 22:21:40,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:21:40,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:21:41,111 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-13 22:21:41,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:21:41,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310123353] [2025-03-13 22:21:41,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310123353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:21:41,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:21:41,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:21:41,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230337535] [2025-03-13 22:21:41,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:21:41,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:21:41,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:21:41,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:21:41,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:21:41,391 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 360 [2025-03-13 22:21:41,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 339 transitions, 709 flow. Second operand has 6 states, 6 states have (on average 248.83333333333334) internal successors, (1493), 6 states have internal predecessors, (1493), 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-13 22:21:41,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:21:41,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 360 [2025-03-13 22:21:41,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:21:48,147 INFO L124 PetriNetUnfolderBase]: 27407/72039 cut-off events. [2025-03-13 22:21:48,148 INFO L125 PetriNetUnfolderBase]: For 409/409 co-relation queries the response was YES. [2025-03-13 22:21:48,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114007 conditions, 72039 events. 27407/72039 cut-off events. For 409/409 co-relation queries the response was YES. Maximal size of possible extension queue 1382. Compared 873583 event pairs, 26112 based on Foata normal form. 0/66974 useless extension candidates. Maximal degree in co-relation 113962. Up to 41627 conditions per place. [2025-03-13 22:21:48,651 INFO L140 encePairwiseOnDemand]: 333/360 looper letters, 107 selfloop transitions, 86 changer transitions 0/432 dead transitions. [2025-03-13 22:21:48,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 432 transitions, 1281 flow [2025-03-13 22:21:48,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:21:48,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:21:48,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1670 transitions. [2025-03-13 22:21:48,655 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7731481481481481 [2025-03-13 22:21:48,655 INFO L175 Difference]: Start difference. First operand has 343 places, 339 transitions, 709 flow. Second operand 6 states and 1670 transitions. [2025-03-13 22:21:48,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 432 transitions, 1281 flow [2025-03-13 22:21:48,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 432 transitions, 1271 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:21:48,669 INFO L231 Difference]: Finished difference. Result has 348 places, 424 transitions, 1265 flow [2025-03-13 22:21:48,670 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1265, PETRI_PLACES=348, PETRI_TRANSITIONS=424} [2025-03-13 22:21:48,671 INFO L279 CegarLoopForPetriNet]: 345 programPoint places, 3 predicate places. [2025-03-13 22:21:48,671 INFO L471 AbstractCegarLoop]: Abstraction has has 348 places, 424 transitions, 1265 flow [2025-03-13 22:21:48,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 248.83333333333334) internal successors, (1493), 6 states have internal predecessors, (1493), 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-13 22:21:48,673 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:21:48,673 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] [2025-03-13 22:21:48,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:21:48,673 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-13 22:21:48,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:21:48,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1095722820, now seen corresponding path program 1 times [2025-03-13 22:21:48,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:21:48,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035450905] [2025-03-13 22:21:48,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:21:48,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:21:48,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-13 22:21:48,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-13 22:21:48,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:21:48,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:21:48,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 22:21:48,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:21:48,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035450905] [2025-03-13 22:21:48,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035450905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:21:48,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:21:48,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:21:48,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023895563] [2025-03-13 22:21:48,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:21:48,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:21:48,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:21:48,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:21:48,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:21:48,772 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 322 out of 360 [2025-03-13 22:21:48,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 424 transitions, 1265 flow. Second operand has 3 states, 3 states have (on average 323.3333333333333) internal successors, (970), 3 states have internal predecessors, (970), 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-13 22:21:48,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:21:48,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 322 of 360 [2025-03-13 22:21:48,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:21:49,001 INFO L124 PetriNetUnfolderBase]: 310/2425 cut-off events. [2025-03-13 22:21:49,002 INFO L125 PetriNetUnfolderBase]: For 230/253 co-relation queries the response was YES. [2025-03-13 22:21:49,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3350 conditions, 2425 events. 310/2425 cut-off events. For 230/253 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 17799 event pairs, 114 based on Foata normal form. 1/2231 useless extension candidates. Maximal degree in co-relation 3301. Up to 251 conditions per place. [2025-03-13 22:21:49,015 INFO L140 encePairwiseOnDemand]: 357/360 looper letters, 24 selfloop transitions, 3 changer transitions 0/426 dead transitions. [2025-03-13 22:21:49,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 426 transitions, 1323 flow [2025-03-13 22:21:49,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:21:49,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:21:49,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 993 transitions. [2025-03-13 22:21:49,021 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9194444444444444 [2025-03-13 22:21:49,021 INFO L175 Difference]: Start difference. First operand has 348 places, 424 transitions, 1265 flow. Second operand 3 states and 993 transitions. [2025-03-13 22:21:49,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 426 transitions, 1323 flow [2025-03-13 22:21:49,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 426 transitions, 1323 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:21:49,039 INFO L231 Difference]: Finished difference. Result has 351 places, 424 transitions, 1276 flow [2025-03-13 22:21:49,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=1265, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1276, PETRI_PLACES=351, PETRI_TRANSITIONS=424} [2025-03-13 22:21:49,042 INFO L279 CegarLoopForPetriNet]: 345 programPoint places, 6 predicate places. [2025-03-13 22:21:49,042 INFO L471 AbstractCegarLoop]: Abstraction has has 351 places, 424 transitions, 1276 flow [2025-03-13 22:21:49,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 323.3333333333333) internal successors, (970), 3 states have internal predecessors, (970), 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-13 22:21:49,043 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:21:49,043 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] [2025-03-13 22:21:49,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:21:49,045 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [t2_funErr7ASSERT_VIOLATIONDATA_RACE, t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE, t2_funErr3ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-13 22:21:49,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:21:49,046 INFO L85 PathProgramCache]: Analyzing trace with hash 920000066, now seen corresponding path program 1 times [2025-03-13 22:21:49,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:21:49,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284146935] [2025-03-13 22:21:49,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:21:49,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:21:49,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-13 22:21:49,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-13 22:21:49,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:21:49,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:21:49,093 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:21:49,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-13 22:21:49,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-13 22:21:49,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:21:49,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:21:49,148 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:21:49,148 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:21:49,149 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 38 remaining) [2025-03-13 22:21:49,152 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr7ASSERT_VIOLATIONDATA_RACE (36 of 38 remaining) [2025-03-13 22:21:49,152 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr6ASSERT_VIOLATIONDATA_RACE (35 of 38 remaining) [2025-03-13 22:21:49,152 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr5ASSERT_VIOLATIONDATA_RACE (34 of 38 remaining) [2025-03-13 22:21:49,152 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr3ASSERT_VIOLATIONDATA_RACE (33 of 38 remaining) [2025-03-13 22:21:49,152 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr4ASSERT_VIOLATIONDATA_RACE (32 of 38 remaining) [2025-03-13 22:21:49,152 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr1ASSERT_VIOLATIONDATA_RACE (31 of 38 remaining) [2025-03-13 22:21:49,152 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr2ASSERT_VIOLATIONDATA_RACE (30 of 38 remaining) [2025-03-13 22:21:49,152 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr0ASSERT_VIOLATIONDATA_RACE (29 of 38 remaining) [2025-03-13 22:21:49,153 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (28 of 38 remaining) [2025-03-13 22:21:49,153 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (27 of 38 remaining) [2025-03-13 22:21:49,153 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (26 of 38 remaining) [2025-03-13 22:21:49,153 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (25 of 38 remaining) [2025-03-13 22:21:49,153 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (24 of 38 remaining) [2025-03-13 22:21:49,153 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (23 of 38 remaining) [2025-03-13 22:21:49,153 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (22 of 38 remaining) [2025-03-13 22:21:49,153 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (21 of 38 remaining) [2025-03-13 22:21:49,153 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 38 remaining) [2025-03-13 22:21:49,153 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr5ASSERT_VIOLATIONDATA_RACE (19 of 38 remaining) [2025-03-13 22:21:49,153 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr4ASSERT_VIOLATIONDATA_RACE (18 of 38 remaining) [2025-03-13 22:21:49,153 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr3ASSERT_VIOLATIONDATA_RACE (17 of 38 remaining) [2025-03-13 22:21:49,153 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr2ASSERT_VIOLATIONDATA_RACE (16 of 38 remaining) [2025-03-13 22:21:49,153 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr1ASSERT_VIOLATIONDATA_RACE (15 of 38 remaining) [2025-03-13 22:21:49,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr0ASSERT_VIOLATIONDATA_RACE (14 of 38 remaining) [2025-03-13 22:21:49,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr7ASSERT_VIOLATIONDATA_RACE (13 of 38 remaining) [2025-03-13 22:21:49,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr6ASSERT_VIOLATIONDATA_RACE (12 of 38 remaining) [2025-03-13 22:21:49,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr5ASSERT_VIOLATIONDATA_RACE (11 of 38 remaining) [2025-03-13 22:21:49,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr3ASSERT_VIOLATIONDATA_RACE (10 of 38 remaining) [2025-03-13 22:21:49,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr4ASSERT_VIOLATIONDATA_RACE (9 of 38 remaining) [2025-03-13 22:21:49,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr1ASSERT_VIOLATIONDATA_RACE (8 of 38 remaining) [2025-03-13 22:21:49,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr2ASSERT_VIOLATIONDATA_RACE (7 of 38 remaining) [2025-03-13 22:21:49,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr0ASSERT_VIOLATIONDATA_RACE (6 of 38 remaining) [2025-03-13 22:21:49,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr5ASSERT_VIOLATIONDATA_RACE (5 of 38 remaining) [2025-03-13 22:21:49,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr4ASSERT_VIOLATIONDATA_RACE (4 of 38 remaining) [2025-03-13 22:21:49,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 38 remaining) [2025-03-13 22:21:49,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 38 remaining) [2025-03-13 22:21:49,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 38 remaining) [2025-03-13 22:21:49,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 38 remaining) [2025-03-13 22:21:49,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:21:49,156 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:21:49,160 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:21:49,161 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-13 22:21:49,242 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-03-13 22:21:49,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 551 places, 582 transitions, 1208 flow [2025-03-13 22:21:49,554 INFO L124 PetriNetUnfolderBase]: 153/1911 cut-off events. [2025-03-13 22:21:49,555 INFO L125 PetriNetUnfolderBase]: For 72/90 co-relation queries the response was YES. [2025-03-13 22:21:49,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2000 conditions, 1911 events. 153/1911 cut-off events. For 72/90 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 13327 event pairs, 2 based on Foata normal form. 0/1649 useless extension candidates. Maximal degree in co-relation 1193. Up to 32 conditions per place. [2025-03-13 22:21:49,588 INFO L82 GeneralOperation]: Start removeDead. Operand has 551 places, 582 transitions, 1208 flow [2025-03-13 22:21:49,602 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 551 places, 582 transitions, 1208 flow [2025-03-13 22:21:49,602 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:21:49,603 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;@18b8ec79, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:21:49,603 INFO L334 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2025-03-13 22:21:49,604 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:21:49,604 INFO L124 PetriNetUnfolderBase]: 0/35 cut-off events. [2025-03-13 22:21:49,605 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:21:49,605 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:21:49,605 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:21:49,605 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-13 22:21:49,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:21:49,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1824993486, now seen corresponding path program 1 times [2025-03-13 22:21:49,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:21:49,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218070520] [2025-03-13 22:21:49,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:21:49,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:21:49,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-13 22:21:49,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-13 22:21:49,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:21:49,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:21:49,628 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-13 22:21:49,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:21:49,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218070520] [2025-03-13 22:21:49,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218070520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:21:49,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:21:49,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:21:49,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126101531] [2025-03-13 22:21:49,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:21:49,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:21:49,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:21:49,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:21:49,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:21:49,652 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 506 out of 582 [2025-03-13 22:21:49,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 551 places, 582 transitions, 1208 flow. Second operand has 3 states, 3 states have (on average 507.3333333333333) internal successors, (1522), 3 states have internal predecessors, (1522), 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-13 22:21:49,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:21:49,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 506 of 582 [2025-03-13 22:21:49,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:20,266 INFO L124 PetriNetUnfolderBase]: 32379/166266 cut-off events. [2025-03-13 22:22:20,267 INFO L125 PetriNetUnfolderBase]: For 14948/14948 co-relation queries the response was YES. [2025-03-13 22:22:22,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212388 conditions, 166266 events. 32379/166266 cut-off events. For 14948/14948 co-relation queries the response was YES. Maximal size of possible extension queue 2829. Compared 2797828 event pairs, 28344 based on Foata normal form. 14958/166981 useless extension candidates. Maximal degree in co-relation 64557. Up to 40592 conditions per place. [2025-03-13 22:22:23,425 INFO L140 encePairwiseOnDemand]: 553/582 looper letters, 45 selfloop transitions, 2 changer transitions 0/551 dead transitions. [2025-03-13 22:22:23,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 548 places, 551 transitions, 1240 flow [2025-03-13 22:22:23,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:22:23,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:22:23,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1592 transitions. [2025-03-13 22:22:23,428 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9117983963344788 [2025-03-13 22:22:23,428 INFO L175 Difference]: Start difference. First operand has 551 places, 582 transitions, 1208 flow. Second operand 3 states and 1592 transitions. [2025-03-13 22:22:23,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 548 places, 551 transitions, 1240 flow [2025-03-13 22:22:23,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 548 places, 551 transitions, 1240 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:22:23,438 INFO L231 Difference]: Finished difference. Result has 548 places, 551 transitions, 1150 flow [2025-03-13 22:22:23,438 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=582, PETRI_DIFFERENCE_MINUEND_FLOW=1146, PETRI_DIFFERENCE_MINUEND_PLACES=546, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=551, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=549, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1150, PETRI_PLACES=548, PETRI_TRANSITIONS=551} [2025-03-13 22:22:23,439 INFO L279 CegarLoopForPetriNet]: 551 programPoint places, -3 predicate places. [2025-03-13 22:22:23,439 INFO L471 AbstractCegarLoop]: Abstraction has has 548 places, 551 transitions, 1150 flow [2025-03-13 22:22:23,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 507.3333333333333) internal successors, (1522), 3 states have internal predecessors, (1522), 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-13 22:22:23,440 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:23,440 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] [2025-03-13 22:22:23,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:22:23,440 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 48 more)] === [2025-03-13 22:22:23,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:23,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1662542256, now seen corresponding path program 1 times [2025-03-13 22:22:23,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:23,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22351326] [2025-03-13 22:22:23,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:23,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:23,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-13 22:22:23,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-13 22:22:23,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:23,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:23,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:22:23,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:23,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22351326] [2025-03-13 22:22:23,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22351326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:23,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:23,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:22:23,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419447722] [2025-03-13 22:22:23,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:23,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:22:23,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:23,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:22:23,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:22:23,479 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 582 [2025-03-13 22:22:23,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 548 places, 551 transitions, 1150 flow. Second operand has 3 states, 3 states have (on average 503.0) internal successors, (1509), 3 states have internal predecessors, (1509), 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-13 22:22:23,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:23,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 582 [2025-03-13 22:22:23,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand