./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 798a7b37 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-?-798a7b3-m [2025-03-04 06:51:04,525 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:51:04,584 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:51:04,588 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:51:04,590 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:51:04,611 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:51:04,612 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:51:04,612 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:51:04,612 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:51:04,613 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:51:04,613 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:51:04,613 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:51:04,614 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:51:04,614 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:51:04,614 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:51:04,614 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:51:04,614 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:51:04,614 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:51:04,614 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:51:04,614 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:51:04,615 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:51:04,615 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:51:04,615 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:51:04,615 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:51:04,615 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:51:04,615 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:51:04,615 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:51:04,615 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:51:04,615 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:51:04,615 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:51:04,616 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:51:04,616 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:51:04,616 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:51:04,616 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:51:04,616 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:51:04,616 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:51:04,616 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:51:04,616 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:51:04,616 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:51:04,616 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:51:04,616 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:51:04,616 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:51:04,616 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-04 06:51:04,860 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:51:04,866 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:51:04,867 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:51:04,868 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:51:04,868 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:51:04,869 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-04 06:51:06,010 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4cf64002/ddf690b93ef94e22ac113fdea89b445d/FLAGa6fe3678a [2025-03-04 06:51:06,330 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:51:06,331 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_82-list_racefree.i [2025-03-04 06:51:06,342 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4cf64002/ddf690b93ef94e22ac113fdea89b445d/FLAGa6fe3678a [2025-03-04 06:51:06,587 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4cf64002/ddf690b93ef94e22ac113fdea89b445d [2025-03-04 06:51:06,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:51:06,590 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:51:06,591 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:51:06,591 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:51:06,594 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:51:06,595 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:51:06" (1/1) ... [2025-03-04 06:51:06,595 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 04.03 06:51:06, skipping insertion in model container [2025-03-04 06:51:06,596 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:51:06" (1/1) ... [2025-03-04 06:51:06,627 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:51:06,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:51:06,914 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:51:06,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:51:07,015 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:51:07,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:07 WrapperNode [2025-03-04 06:51:07,016 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:51:07,017 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:51:07,017 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:51:07,017 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:51:07,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:07" (1/1) ... [2025-03-04 06:51:07,041 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:07" (1/1) ... [2025-03-04 06:51:07,085 INFO L138 Inliner]: procedures = 279, calls = 68, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 324 [2025-03-04 06:51:07,089 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:51:07,089 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:51:07,089 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:51:07,089 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:51:07,094 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:07" (1/1) ... [2025-03-04 06:51:07,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:07" (1/1) ... [2025-03-04 06:51:07,100 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:07" (1/1) ... [2025-03-04 06:51:07,105 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:07" (1/1) ... [2025-03-04 06:51:07,124 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:07" (1/1) ... [2025-03-04 06:51:07,127 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:07" (1/1) ... [2025-03-04 06:51:07,130 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:07" (1/1) ... [2025-03-04 06:51:07,131 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:07" (1/1) ... [2025-03-04 06:51:07,134 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:51:07,134 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:51:07,135 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:51:07,135 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:51:07,135 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:07" (1/1) ... [2025-03-04 06:51:07,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:51:07,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:51:07,165 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-04 06:51:07,167 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-04 06:51:07,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 06:51:07,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-04 06:51:07,187 INFO L130 BoogieDeclarations]: Found specification of procedure t1_fun [2025-03-04 06:51:07,187 INFO L138 BoogieDeclarations]: Found implementation of procedure t1_fun [2025-03-04 06:51:07,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 06:51:07,187 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 06:51:07,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:51:07,187 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2025-03-04 06:51:07,187 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2025-03-04 06:51:07,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:51:07,187 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 06:51:07,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:51:07,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:51:07,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-04 06:51:07,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:51:07,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:51:07,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:51:07,190 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:51:07,323 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:51:07,324 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:51:07,867 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1044: havoc main_~#t1_ids~0#1.base, main_~#t1_ids~0#1.offset; [2025-03-04 06:51:07,868 INFO L1325 $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-04 06:51:07,868 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1045: havoc main_~#t2_ids~0#1.base, main_~#t2_ids~0#1.offset; [2025-03-04 06:51:07,868 INFO L1325 $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-04 06:51:07,869 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:51:07,869 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:51:07,902 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:51:07,902 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:51:07,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:51:07 BoogieIcfgContainer [2025-03-04 06:51:07,902 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:51:07,904 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:51:07,904 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:51:07,907 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:51:07,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:51:06" (1/3) ... [2025-03-04 06:51:07,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b976191 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:51:07, skipping insertion in model container [2025-03-04 06:51:07,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:07" (2/3) ... [2025-03-04 06:51:07,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b976191 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:51:07, skipping insertion in model container [2025-03-04 06:51:07,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:51:07" (3/3) ... [2025-03-04 06:51:07,911 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_82-list_racefree.i [2025-03-04 06:51:07,923 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:51:07,925 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-04 06:51:07,925 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:51:08,027 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-04 06:51:08,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 345 places, 360 transitions, 740 flow [2025-03-04 06:51:08,275 INFO L124 PetriNetUnfolderBase]: 40/672 cut-off events. [2025-03-04 06:51:08,277 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-04 06:51:08,292 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-04 06:51:08,292 INFO L82 GeneralOperation]: Start removeDead. Operand has 345 places, 360 transitions, 740 flow [2025-03-04 06:51:08,300 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 345 places, 360 transitions, 740 flow [2025-03-04 06:51:08,311 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:51:08,319 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;@3b90cc49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:51:08,319 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-03-04 06:51:08,324 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:51:08,325 INFO L124 PetriNetUnfolderBase]: 0/35 cut-off events. [2025-03-04 06:51:08,325 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:51:08,325 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:08,326 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:51:08,328 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-04 06:51:08,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:08,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1342238474, now seen corresponding path program 1 times [2025-03-04 06:51:08,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:08,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505397554] [2025-03-04 06:51:08,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:08,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:08,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 06:51:08,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 06:51:08,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:08,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:08,524 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-04 06:51:08,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:08,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505397554] [2025-03-04 06:51:08,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505397554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:08,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:08,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:51:08,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688717092] [2025-03-04 06:51:08,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:08,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:51:08,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:08,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:51:08,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:51:08,583 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 360 [2025-03-04 06:51:08,587 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-04 06:51:08,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:08,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 360 [2025-03-04 06:51:08,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:09,065 INFO L124 PetriNetUnfolderBase]: 210/2372 cut-off events. [2025-03-04 06:51:09,065 INFO L125 PetriNetUnfolderBase]: For 120/120 co-relation queries the response was YES. [2025-03-04 06:51:09,074 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-04 06:51:09,085 INFO L140 encePairwiseOnDemand]: 344/360 looper letters, 25 selfloop transitions, 2 changer transitions 0/344 dead transitions. [2025-03-04 06:51:09,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 344 transitions, 762 flow [2025-03-04 06:51:09,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:51:09,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:51:09,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 995 transitions. [2025-03-04 06:51:09,103 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9212962962962963 [2025-03-04 06:51:09,104 INFO L175 Difference]: Start difference. First operand has 345 places, 360 transitions, 740 flow. Second operand 3 states and 995 transitions. [2025-03-04 06:51:09,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 344 transitions, 762 flow [2025-03-04 06:51:09,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 344 transitions, 762 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:51:09,117 INFO L231 Difference]: Finished difference. Result has 344 places, 344 transitions, 712 flow [2025-03-04 06:51:09,121 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-04 06:51:09,124 INFO L279 CegarLoopForPetriNet]: 345 programPoint places, -1 predicate places. [2025-03-04 06:51:09,124 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 344 transitions, 712 flow [2025-03-04 06:51:09,125 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-04 06:51:09,125 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:09,125 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-04 06:51:09,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:51:09,126 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-04 06:51:09,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:09,126 INFO L85 PathProgramCache]: Analyzing trace with hash 2038444268, now seen corresponding path program 1 times [2025-03-04 06:51:09,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:09,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426506774] [2025-03-04 06:51:09,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:09,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:09,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 06:51:09,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 06:51:09,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:09,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:09,230 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-04 06:51:09,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:09,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426506774] [2025-03-04 06:51:09,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426506774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:09,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:09,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:51:09,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896007954] [2025-03-04 06:51:09,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:09,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:51:09,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:09,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:51:09,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:51:09,250 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 360 [2025-03-04 06:51:09,252 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-04 06:51:09,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:09,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 360 [2025-03-04 06:51:09,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:09,585 INFO L124 PetriNetUnfolderBase]: 118/1985 cut-off events. [2025-03-04 06:51:09,586 INFO L125 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2025-03-04 06:51:09,596 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-04 06:51:09,607 INFO L140 encePairwiseOnDemand]: 356/360 looper letters, 24 selfloop transitions, 1 changer transitions 0/341 dead transitions. [2025-03-04 06:51:09,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 341 transitions, 756 flow [2025-03-04 06:51:09,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:51:09,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:51:09,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 982 transitions. [2025-03-04 06:51:09,611 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9092592592592592 [2025-03-04 06:51:09,611 INFO L175 Difference]: Start difference. First operand has 344 places, 344 transitions, 712 flow. Second operand 3 states and 982 transitions. [2025-03-04 06:51:09,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 341 transitions, 756 flow [2025-03-04 06:51:09,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 341 transitions, 752 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:51:09,623 INFO L231 Difference]: Finished difference. Result has 341 places, 341 transitions, 704 flow [2025-03-04 06:51:09,623 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-04 06:51:09,624 INFO L279 CegarLoopForPetriNet]: 345 programPoint places, -4 predicate places. [2025-03-04 06:51:09,624 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 341 transitions, 704 flow [2025-03-04 06:51:09,625 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-04 06:51:09,625 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:09,625 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-04 06:51:09,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:51:09,625 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-04 06:51:09,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:09,626 INFO L85 PathProgramCache]: Analyzing trace with hash 475468037, now seen corresponding path program 1 times [2025-03-04 06:51:09,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:09,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81611945] [2025-03-04 06:51:09,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:09,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:09,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 06:51:09,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 06:51:09,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:09,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:10,105 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-04 06:51:10,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:10,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81611945] [2025-03-04 06:51:10,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81611945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:10,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:10,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:51:10,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002515890] [2025-03-04 06:51:10,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:10,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:51:10,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:10,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:51:10,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:51:10,469 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 360 [2025-03-04 06:51:10,471 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-04 06:51:10,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:10,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 360 [2025-03-04 06:51:10,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:17,083 INFO L124 PetriNetUnfolderBase]: 23474/62699 cut-off events. [2025-03-04 06:51:17,084 INFO L125 PetriNetUnfolderBase]: For 409/409 co-relation queries the response was YES. [2025-03-04 06:51:17,243 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-04 06:51:17,492 INFO L140 encePairwiseOnDemand]: 354/360 looper letters, 87 selfloop transitions, 5 changer transitions 0/340 dead transitions. [2025-03-04 06:51:17,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 340 transitions, 886 flow [2025-03-04 06:51:17,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:51:17,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:51:17,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1611 transitions. [2025-03-04 06:51:17,504 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7458333333333333 [2025-03-04 06:51:17,504 INFO L175 Difference]: Start difference. First operand has 341 places, 341 transitions, 704 flow. Second operand 6 states and 1611 transitions. [2025-03-04 06:51:17,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 340 transitions, 886 flow [2025-03-04 06:51:17,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 340 transitions, 885 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:51:17,522 INFO L231 Difference]: Finished difference. Result has 344 places, 340 transitions, 711 flow [2025-03-04 06:51:17,523 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-04 06:51:17,524 INFO L279 CegarLoopForPetriNet]: 345 programPoint places, -1 predicate places. [2025-03-04 06:51:17,525 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 340 transitions, 711 flow [2025-03-04 06:51:17,526 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-04 06:51:17,526 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:17,526 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-04 06:51:17,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:51:17,527 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-04 06:51:17,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:17,529 INFO L85 PathProgramCache]: Analyzing trace with hash -289956469, now seen corresponding path program 1 times [2025-03-04 06:51:17,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:17,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064561013] [2025-03-04 06:51:17,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:17,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:17,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 06:51:17,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 06:51:17,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:17,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:17,846 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-04 06:51:17,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:17,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064561013] [2025-03-04 06:51:17,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064561013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:17,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:17,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:51:17,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585329134] [2025-03-04 06:51:17,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:17,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:51:17,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:17,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:51:17,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:51:18,180 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 360 [2025-03-04 06:51:18,182 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-04 06:51:18,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:18,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 360 [2025-03-04 06:51:18,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:24,158 INFO L124 PetriNetUnfolderBase]: 23463/62230 cut-off events. [2025-03-04 06:51:24,159 INFO L125 PetriNetUnfolderBase]: For 409/409 co-relation queries the response was YES. [2025-03-04 06:51:24,276 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-04 06:51:24,473 INFO L140 encePairwiseOnDemand]: 354/360 looper letters, 87 selfloop transitions, 5 changer transitions 0/339 dead transitions. [2025-03-04 06:51:24,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 339 transitions, 893 flow [2025-03-04 06:51:24,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:51:24,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:51:24,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1611 transitions. [2025-03-04 06:51:24,478 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7458333333333333 [2025-03-04 06:51:24,478 INFO L175 Difference]: Start difference. First operand has 344 places, 340 transitions, 711 flow. Second operand 6 states and 1611 transitions. [2025-03-04 06:51:24,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 339 transitions, 893 flow [2025-03-04 06:51:24,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 339 transitions, 883 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:51:24,487 INFO L231 Difference]: Finished difference. Result has 343 places, 339 transitions, 709 flow [2025-03-04 06:51:24,488 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-04 06:51:24,489 INFO L279 CegarLoopForPetriNet]: 345 programPoint places, -2 predicate places. [2025-03-04 06:51:24,490 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 339 transitions, 709 flow [2025-03-04 06:51:24,491 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-04 06:51:24,491 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:24,491 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-04 06:51:24,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:51:24,491 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-04 06:51:24,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:24,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1775729795, now seen corresponding path program 1 times [2025-03-04 06:51:24,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:24,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324067276] [2025-03-04 06:51:24,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:24,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:24,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 06:51:24,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 06:51:24,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:24,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:24,836 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-04 06:51:24,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:24,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324067276] [2025-03-04 06:51:24,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324067276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:24,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:24,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:51:24,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270375680] [2025-03-04 06:51:24,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:24,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:51:24,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:24,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:51:24,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:51:25,080 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 360 [2025-03-04 06:51:25,082 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-04 06:51:25,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:25,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 360 [2025-03-04 06:51:25,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:31,670 INFO L124 PetriNetUnfolderBase]: 27407/72039 cut-off events. [2025-03-04 06:51:31,671 INFO L125 PetriNetUnfolderBase]: For 409/409 co-relation queries the response was YES. [2025-03-04 06:51:31,802 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-04 06:51:32,004 INFO L140 encePairwiseOnDemand]: 333/360 looper letters, 107 selfloop transitions, 86 changer transitions 0/432 dead transitions. [2025-03-04 06:51:32,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 432 transitions, 1281 flow [2025-03-04 06:51:32,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:51:32,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:51:32,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1670 transitions. [2025-03-04 06:51:32,008 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7731481481481481 [2025-03-04 06:51:32,008 INFO L175 Difference]: Start difference. First operand has 343 places, 339 transitions, 709 flow. Second operand 6 states and 1670 transitions. [2025-03-04 06:51:32,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 432 transitions, 1281 flow [2025-03-04 06:51:32,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 432 transitions, 1271 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:51:32,025 INFO L231 Difference]: Finished difference. Result has 348 places, 424 transitions, 1265 flow [2025-03-04 06:51:32,025 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-04 06:51:32,028 INFO L279 CegarLoopForPetriNet]: 345 programPoint places, 3 predicate places. [2025-03-04 06:51:32,028 INFO L471 AbstractCegarLoop]: Abstraction has has 348 places, 424 transitions, 1265 flow [2025-03-04 06:51:32,029 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-04 06:51:32,029 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:32,029 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-04 06:51:32,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:51:32,029 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-04 06:51:32,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:32,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1095722820, now seen corresponding path program 1 times [2025-03-04 06:51:32,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:32,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605355166] [2025-03-04 06:51:32,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:32,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:32,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 06:51:32,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 06:51:32,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:32,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:32,232 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-04 06:51:32,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:32,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605355166] [2025-03-04 06:51:32,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605355166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:32,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:32,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:51:32,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001064040] [2025-03-04 06:51:32,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:32,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:51:32,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:32,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:51:32,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:51:32,256 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 322 out of 360 [2025-03-04 06:51:32,257 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-04 06:51:32,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:32,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 322 of 360 [2025-03-04 06:51:32,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:32,583 INFO L124 PetriNetUnfolderBase]: 310/2425 cut-off events. [2025-03-04 06:51:32,583 INFO L125 PetriNetUnfolderBase]: For 230/253 co-relation queries the response was YES. [2025-03-04 06:51:32,609 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-04 06:51:32,621 INFO L140 encePairwiseOnDemand]: 357/360 looper letters, 24 selfloop transitions, 3 changer transitions 0/426 dead transitions. [2025-03-04 06:51:32,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 426 transitions, 1323 flow [2025-03-04 06:51:32,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:51:32,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:51:32,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 993 transitions. [2025-03-04 06:51:32,624 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9194444444444444 [2025-03-04 06:51:32,624 INFO L175 Difference]: Start difference. First operand has 348 places, 424 transitions, 1265 flow. Second operand 3 states and 993 transitions. [2025-03-04 06:51:32,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 426 transitions, 1323 flow [2025-03-04 06:51:32,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 426 transitions, 1323 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:51:32,636 INFO L231 Difference]: Finished difference. Result has 351 places, 424 transitions, 1276 flow [2025-03-04 06:51:32,637 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-04 06:51:32,639 INFO L279 CegarLoopForPetriNet]: 345 programPoint places, 6 predicate places. [2025-03-04 06:51:32,639 INFO L471 AbstractCegarLoop]: Abstraction has has 351 places, 424 transitions, 1276 flow [2025-03-04 06:51:32,640 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-04 06:51:32,640 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:32,640 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-04 06:51:32,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:51:32,640 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-04 06:51:32,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:32,641 INFO L85 PathProgramCache]: Analyzing trace with hash 920000066, now seen corresponding path program 1 times [2025-03-04 06:51:32,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:32,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023895563] [2025-03-04 06:51:32,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:32,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:32,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-04 06:51:32,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 06:51:32,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:32,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:51:32,674 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:51:32,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-04 06:51:32,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 06:51:32,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:32,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:51:32,727 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:51:32,728 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:51:32,728 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 38 remaining) [2025-03-04 06:51:32,730 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr7ASSERT_VIOLATIONDATA_RACE (36 of 38 remaining) [2025-03-04 06:51:32,730 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr6ASSERT_VIOLATIONDATA_RACE (35 of 38 remaining) [2025-03-04 06:51:32,730 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr5ASSERT_VIOLATIONDATA_RACE (34 of 38 remaining) [2025-03-04 06:51:32,730 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr3ASSERT_VIOLATIONDATA_RACE (33 of 38 remaining) [2025-03-04 06:51:32,731 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr4ASSERT_VIOLATIONDATA_RACE (32 of 38 remaining) [2025-03-04 06:51:32,731 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr1ASSERT_VIOLATIONDATA_RACE (31 of 38 remaining) [2025-03-04 06:51:32,731 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr2ASSERT_VIOLATIONDATA_RACE (30 of 38 remaining) [2025-03-04 06:51:32,731 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr0ASSERT_VIOLATIONDATA_RACE (29 of 38 remaining) [2025-03-04 06:51:32,731 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (28 of 38 remaining) [2025-03-04 06:51:32,731 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (27 of 38 remaining) [2025-03-04 06:51:32,731 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (26 of 38 remaining) [2025-03-04 06:51:32,731 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (25 of 38 remaining) [2025-03-04 06:51:32,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (24 of 38 remaining) [2025-03-04 06:51:32,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (23 of 38 remaining) [2025-03-04 06:51:32,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (22 of 38 remaining) [2025-03-04 06:51:32,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (21 of 38 remaining) [2025-03-04 06:51:32,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 38 remaining) [2025-03-04 06:51:32,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr5ASSERT_VIOLATIONDATA_RACE (19 of 38 remaining) [2025-03-04 06:51:32,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr4ASSERT_VIOLATIONDATA_RACE (18 of 38 remaining) [2025-03-04 06:51:32,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr3ASSERT_VIOLATIONDATA_RACE (17 of 38 remaining) [2025-03-04 06:51:32,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr2ASSERT_VIOLATIONDATA_RACE (16 of 38 remaining) [2025-03-04 06:51:32,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr1ASSERT_VIOLATIONDATA_RACE (15 of 38 remaining) [2025-03-04 06:51:32,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr0ASSERT_VIOLATIONDATA_RACE (14 of 38 remaining) [2025-03-04 06:51:32,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr7ASSERT_VIOLATIONDATA_RACE (13 of 38 remaining) [2025-03-04 06:51:32,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr6ASSERT_VIOLATIONDATA_RACE (12 of 38 remaining) [2025-03-04 06:51:32,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr5ASSERT_VIOLATIONDATA_RACE (11 of 38 remaining) [2025-03-04 06:51:32,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr3ASSERT_VIOLATIONDATA_RACE (10 of 38 remaining) [2025-03-04 06:51:32,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr4ASSERT_VIOLATIONDATA_RACE (9 of 38 remaining) [2025-03-04 06:51:32,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr1ASSERT_VIOLATIONDATA_RACE (8 of 38 remaining) [2025-03-04 06:51:32,734 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr2ASSERT_VIOLATIONDATA_RACE (7 of 38 remaining) [2025-03-04 06:51:32,734 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr0ASSERT_VIOLATIONDATA_RACE (6 of 38 remaining) [2025-03-04 06:51:32,734 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr5ASSERT_VIOLATIONDATA_RACE (5 of 38 remaining) [2025-03-04 06:51:32,734 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr4ASSERT_VIOLATIONDATA_RACE (4 of 38 remaining) [2025-03-04 06:51:32,734 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 38 remaining) [2025-03-04 06:51:32,734 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 38 remaining) [2025-03-04 06:51:32,734 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 38 remaining) [2025-03-04 06:51:32,734 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 38 remaining) [2025-03-04 06:51:32,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:51:32,735 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:51:32,738 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:51:32,738 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 06:51:32,840 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-03-04 06:51:32,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 551 places, 582 transitions, 1208 flow [2025-03-04 06:51:33,237 INFO L124 PetriNetUnfolderBase]: 153/1911 cut-off events. [2025-03-04 06:51:33,238 INFO L125 PetriNetUnfolderBase]: For 72/90 co-relation queries the response was YES. [2025-03-04 06:51:33,276 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 13329 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-04 06:51:33,276 INFO L82 GeneralOperation]: Start removeDead. Operand has 551 places, 582 transitions, 1208 flow [2025-03-04 06:51:33,293 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 551 places, 582 transitions, 1208 flow [2025-03-04 06:51:33,294 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:51:33,294 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;@3b90cc49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:51:33,294 INFO L334 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2025-03-04 06:51:33,296 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:51:33,297 INFO L124 PetriNetUnfolderBase]: 0/35 cut-off events. [2025-03-04 06:51:33,297 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:51:33,297 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:33,297 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-04 06:51:33,297 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-04 06:51:33,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:33,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1824993486, now seen corresponding path program 1 times [2025-03-04 06:51:33,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:33,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414556770] [2025-03-04 06:51:33,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:33,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:33,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 06:51:33,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 06:51:33,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:33,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:33,327 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-04 06:51:33,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:33,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414556770] [2025-03-04 06:51:33,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414556770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:33,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:33,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:51:33,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911190007] [2025-03-04 06:51:33,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:33,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:51:33,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:33,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:51:33,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:51:33,349 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 506 out of 582 [2025-03-04 06:51:33,351 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-04 06:51:33,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:33,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 506 of 582 [2025-03-04 06:51:33,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand