./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_93-evilcollapse_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_93-evilcollapse_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 dad265ed8a17f32bb0a174302dfe188f9a15f60b81cc9c28a67851ab05270da2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:51:39,500 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:51:39,550 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:39,554 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:51:39,554 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:51:39,567 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:51:39,567 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:51:39,568 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:51:39,568 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:51:39,568 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:51:39,568 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:51:39,568 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:51:39,568 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:51:39,568 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:51:39,568 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:51:39,568 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:51:39,568 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:51:39,569 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:51:39,569 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:51:39,569 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:51:39,569 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:51:39,569 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:51:39,569 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:51:39,569 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:51:39,569 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:51:39,569 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:51:39,569 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:51:39,569 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:51:39,569 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:51:39,569 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:51:39,569 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:51:39,569 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:51:39,569 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:51:39,569 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:51:39,570 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:51:39,570 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:51:39,570 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:51:39,570 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:51:39,570 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:51:39,570 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:51:39,570 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:51:39,570 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:51:39,570 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 -> dad265ed8a17f32bb0a174302dfe188f9a15f60b81cc9c28a67851ab05270da2 [2025-03-04 06:51:39,806 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:51:39,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:51:39,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:51:39,816 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:51:39,816 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:51:39,817 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_93-evilcollapse_racefree.i [2025-03-04 06:51:40,953 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84e5f841f/21147630bd0b4d248b6c91ea249637d2/FLAGf66de3957 [2025-03-04 06:51:41,265 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:51:41,265 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_93-evilcollapse_racefree.i [2025-03-04 06:51:41,284 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84e5f841f/21147630bd0b4d248b6c91ea249637d2/FLAGf66de3957 [2025-03-04 06:51:41,531 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84e5f841f/21147630bd0b4d248b6c91ea249637d2 [2025-03-04 06:51:41,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:51:41,534 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:51:41,535 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:51:41,536 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:51:41,539 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:51:41,539 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:51:41" (1/1) ... [2025-03-04 06:51:41,540 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6df821b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:41, skipping insertion in model container [2025-03-04 06:51:41,540 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:51:41" (1/1) ... [2025-03-04 06:51:41,566 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:51:41,819 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-04 06:51:41,823 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-04 06:51:41,824 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-04 06:51:41,825 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-04 06:51:41,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:51:41,885 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:51:41,930 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-04 06:51:41,932 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-04 06:51:41,933 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-04 06:51:41,933 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-04 06:51:41,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:51:41,995 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:51:41,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:41 WrapperNode [2025-03-04 06:51:41,996 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:51:41,996 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:51:41,996 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:51:41,997 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:51:42,000 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:41" (1/1) ... [2025-03-04 06:51:42,015 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:41" (1/1) ... [2025-03-04 06:51:42,044 INFO L138 Inliner]: procedures = 281, calls = 126, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 412 [2025-03-04 06:51:42,045 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:51:42,045 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:51:42,045 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:51:42,045 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:51:42,051 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:41" (1/1) ... [2025-03-04 06:51:42,052 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:41" (1/1) ... [2025-03-04 06:51:42,062 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:41" (1/1) ... [2025-03-04 06:51:42,063 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:41" (1/1) ... [2025-03-04 06:51:42,093 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:41" (1/1) ... [2025-03-04 06:51:42,094 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:41" (1/1) ... [2025-03-04 06:51:42,101 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:41" (1/1) ... [2025-03-04 06:51:42,102 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:41" (1/1) ... [2025-03-04 06:51:42,110 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:51:42,111 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:51:42,111 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:51:42,111 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:51:42,116 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:41" (1/1) ... [2025-03-04 06:51:42,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:51:42,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:51:42,148 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:42,151 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:42,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 06:51:42,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-04 06:51:42,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 06:51:42,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-04 06:51:42,169 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 06:51:42,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:51:42,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:51:42,169 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 06:51:42,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:51:42,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:51:42,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-04 06:51:42,170 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 06:51:42,171 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 06:51:42,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:51:42,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:51:42,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:51:42,172 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:42,302 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:51:42,304 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:51:42,854 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1082: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-04 06:51:42,854 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1082-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-04 06:51:42,988 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:51:42,988 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:51:43,010 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:51:43,010 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:51:43,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:51:43 BoogieIcfgContainer [2025-03-04 06:51:43,010 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:51:43,012 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:51:43,012 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:51:43,019 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:51:43,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:51:41" (1/3) ... [2025-03-04 06:51:43,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3949c04b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:51:43, skipping insertion in model container [2025-03-04 06:51:43,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:41" (2/3) ... [2025-03-04 06:51:43,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3949c04b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:51:43, skipping insertion in model container [2025-03-04 06:51:43,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:51:43" (3/3) ... [2025-03-04 06:51:43,020 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_93-evilcollapse_racefree.i [2025-03-04 06:51:43,032 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:51:43,033 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_93-evilcollapse_racefree.i that has 2 procedures, 450 locations, 1 initial locations, 10 loop locations, and 21 error locations. [2025-03-04 06:51:43,034 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:51:43,141 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 06:51:43,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 453 places, 472 transitions, 951 flow [2025-03-04 06:51:43,338 INFO L124 PetriNetUnfolderBase]: 22/502 cut-off events. [2025-03-04 06:51:43,340 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:51:43,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 507 conditions, 502 events. 22/502 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1155 event pairs, 0 based on Foata normal form. 0/454 useless extension candidates. Maximal degree in co-relation 322. Up to 4 conditions per place. [2025-03-04 06:51:43,348 INFO L82 GeneralOperation]: Start removeDead. Operand has 453 places, 472 transitions, 951 flow [2025-03-04 06:51:43,353 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 453 places, 472 transitions, 951 flow [2025-03-04 06:51:43,359 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:51:43,369 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;@7270a5e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:51:43,371 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-03-04 06:51:43,395 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:51:43,395 INFO L124 PetriNetUnfolderBase]: 0/124 cut-off events. [2025-03-04 06:51:43,395 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:51:43,395 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:43,396 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:51:43,396 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-04 06:51:43,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:43,401 INFO L85 PathProgramCache]: Analyzing trace with hash 603167492, now seen corresponding path program 1 times [2025-03-04 06:51:43,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:43,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429303306] [2025-03-04 06:51:43,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:43,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:43,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 06:51:43,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 06:51:43,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:43,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:44,369 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:44,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:44,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429303306] [2025-03-04 06:51:44,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429303306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:44,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:44,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:51:44,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273788345] [2025-03-04 06:51:44,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:44,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:51:44,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:44,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:51:44,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:51:44,877 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 356 out of 472 [2025-03-04 06:51:44,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 453 places, 472 transitions, 951 flow. Second operand has 6 states, 6 states have (on average 357.3333333333333) internal successors, (2144), 6 states have internal predecessors, (2144), 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:44,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:44,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 356 of 472 [2025-03-04 06:51:44,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:45,317 INFO L124 PetriNetUnfolderBase]: 320/1662 cut-off events. [2025-03-04 06:51:45,317 INFO L125 PetriNetUnfolderBase]: For 7/15 co-relation queries the response was YES. [2025-03-04 06:51:45,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2360 conditions, 1662 events. 320/1662 cut-off events. For 7/15 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 9998 event pairs, 288 based on Foata normal form. 79/1606 useless extension candidates. Maximal degree in co-relation 1963. Up to 682 conditions per place. [2025-03-04 06:51:45,335 INFO L140 encePairwiseOnDemand]: 445/472 looper letters, 88 selfloop transitions, 10 changer transitions 2/453 dead transitions. [2025-03-04 06:51:45,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 453 transitions, 1109 flow [2025-03-04 06:51:45,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:51:45,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:51:45,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2251 transitions. [2025-03-04 06:51:45,362 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7948446327683616 [2025-03-04 06:51:45,365 INFO L175 Difference]: Start difference. First operand has 453 places, 472 transitions, 951 flow. Second operand 6 states and 2251 transitions. [2025-03-04 06:51:45,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 453 transitions, 1109 flow [2025-03-04 06:51:45,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 454 places, 453 transitions, 1109 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:51:45,382 INFO L231 Difference]: Finished difference. Result has 454 places, 451 transitions, 929 flow [2025-03-04 06:51:45,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=913, PETRI_DIFFERENCE_MINUEND_PLACES=449, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=929, PETRI_PLACES=454, PETRI_TRANSITIONS=451} [2025-03-04 06:51:45,391 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, 1 predicate places. [2025-03-04 06:51:45,391 INFO L471 AbstractCegarLoop]: Abstraction has has 454 places, 451 transitions, 929 flow [2025-03-04 06:51:45,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 357.3333333333333) internal successors, (2144), 6 states have internal predecessors, (2144), 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:45,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:45,393 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:51:45,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:51:45,393 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-04 06:51:45,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:45,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1805401345, now seen corresponding path program 1 times [2025-03-04 06:51:45,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:45,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793398221] [2025-03-04 06:51:45,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:45,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:45,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 06:51:45,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 06:51:45,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:45,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:45,874 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:45,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:45,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793398221] [2025-03-04 06:51:45,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793398221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:45,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:45,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:51:45,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624009094] [2025-03-04 06:51:45,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:45,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:51:45,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:45,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:51:45,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:51:46,344 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 356 out of 472 [2025-03-04 06:51:46,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 451 transitions, 929 flow. Second operand has 6 states, 6 states have (on average 357.3333333333333) internal successors, (2144), 6 states have internal predecessors, (2144), 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:46,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:46,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 356 of 472 [2025-03-04 06:51:46,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:46,709 INFO L124 PetriNetUnfolderBase]: 320/1658 cut-off events. [2025-03-04 06:51:46,709 INFO L125 PetriNetUnfolderBase]: For 15/23 co-relation queries the response was YES. [2025-03-04 06:51:46,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2367 conditions, 1658 events. 320/1658 cut-off events. For 15/23 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10036 event pairs, 288 based on Foata normal form. 0/1527 useless extension candidates. Maximal degree in co-relation 2192. Up to 682 conditions per place. [2025-03-04 06:51:46,717 INFO L140 encePairwiseOnDemand]: 460/472 looper letters, 88 selfloop transitions, 10 changer transitions 0/449 dead transitions. [2025-03-04 06:51:46,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 449 transitions, 1121 flow [2025-03-04 06:51:46,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:51:46,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:51:46,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2236 transitions. [2025-03-04 06:51:46,721 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.78954802259887 [2025-03-04 06:51:46,721 INFO L175 Difference]: Start difference. First operand has 454 places, 451 transitions, 929 flow. Second operand 6 states and 2236 transitions. [2025-03-04 06:51:46,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 449 transitions, 1121 flow [2025-03-04 06:51:46,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 449 transitions, 1101 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:51:46,729 INFO L231 Difference]: Finished difference. Result has 450 places, 449 transitions, 925 flow [2025-03-04 06:51:46,730 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=905, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=439, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=925, PETRI_PLACES=450, PETRI_TRANSITIONS=449} [2025-03-04 06:51:46,730 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, -3 predicate places. [2025-03-04 06:51:46,731 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 449 transitions, 925 flow [2025-03-04 06:51:46,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 357.3333333333333) internal successors, (2144), 6 states have internal predecessors, (2144), 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:46,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:46,732 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:51:46,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:51:46,732 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-04 06:51:46,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:46,737 INFO L85 PathProgramCache]: Analyzing trace with hash 2046444812, now seen corresponding path program 1 times [2025-03-04 06:51:46,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:46,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770161233] [2025-03-04 06:51:46,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:46,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:46,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 06:51:46,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 06:51:46,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:46,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:46,862 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:46,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:46,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770161233] [2025-03-04 06:51:46,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770161233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:46,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:46,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:51:46,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119824978] [2025-03-04 06:51:46,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:46,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:51:46,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:46,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:51:46,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:51:46,876 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 440 out of 472 [2025-03-04 06:51:46,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 449 transitions, 925 flow. Second operand has 3 states, 3 states have (on average 441.3333333333333) internal successors, (1324), 3 states have internal predecessors, (1324), 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:46,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:46,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 440 of 472 [2025-03-04 06:51:46,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:46,951 INFO L124 PetriNetUnfolderBase]: 16/627 cut-off events. [2025-03-04 06:51:46,951 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-03-04 06:51:46,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 688 conditions, 627 events. 16/627 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1824 event pairs, 8 based on Foata normal form. 1/585 useless extension candidates. Maximal degree in co-relation 465. Up to 34 conditions per place. [2025-03-04 06:51:46,953 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 15 selfloop transitions, 2 changer transitions 0/450 dead transitions. [2025-03-04 06:51:46,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 450 transitions, 961 flow [2025-03-04 06:51:46,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:51:46,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:51:46,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1338 transitions. [2025-03-04 06:51:46,956 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9449152542372882 [2025-03-04 06:51:46,956 INFO L175 Difference]: Start difference. First operand has 450 places, 449 transitions, 925 flow. Second operand 3 states and 1338 transitions. [2025-03-04 06:51:46,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 450 transitions, 961 flow [2025-03-04 06:51:46,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 450 transitions, 941 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:51:46,965 INFO L231 Difference]: Finished difference. Result has 448 places, 450 transitions, 917 flow [2025-03-04 06:51:46,966 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=905, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=917, PETRI_PLACES=448, PETRI_TRANSITIONS=450} [2025-03-04 06:51:46,966 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, -5 predicate places. [2025-03-04 06:51:46,966 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 450 transitions, 917 flow [2025-03-04 06:51:46,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 441.3333333333333) internal successors, (1324), 3 states have internal predecessors, (1324), 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:46,967 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:46,968 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:51:46,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:51:46,968 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-04 06:51:46,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:46,969 INFO L85 PathProgramCache]: Analyzing trace with hash -32389628, now seen corresponding path program 1 times [2025-03-04 06:51:46,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:46,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967878609] [2025-03-04 06:51:46,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:46,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:46,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 06:51:47,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 06:51:47,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:47,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:47,412 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:47,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:47,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967878609] [2025-03-04 06:51:47,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967878609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:47,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:47,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:51:47,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033367907] [2025-03-04 06:51:47,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:47,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:51:47,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:47,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:51:47,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:51:47,726 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 355 out of 472 [2025-03-04 06:51:47,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 450 transitions, 917 flow. Second operand has 6 states, 6 states have (on average 357.6666666666667) internal successors, (2146), 6 states have internal predecessors, (2146), 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:47,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:47,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 355 of 472 [2025-03-04 06:51:47,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:47,942 INFO L124 PetriNetUnfolderBase]: 321/1780 cut-off events. [2025-03-04 06:51:47,942 INFO L125 PetriNetUnfolderBase]: For 16/24 co-relation queries the response was YES. [2025-03-04 06:51:47,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2533 conditions, 1780 events. 321/1780 cut-off events. For 16/24 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10589 event pairs, 288 based on Foata normal form. 0/1645 useless extension candidates. Maximal degree in co-relation 2261. Up to 730 conditions per place. [2025-03-04 06:51:47,948 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 95 selfloop transitions, 5 changer transitions 0/449 dead transitions. [2025-03-04 06:51:47,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 449 transitions, 1115 flow [2025-03-04 06:51:47,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:51:47,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:51:47,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2231 transitions. [2025-03-04 06:51:47,953 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7877824858757062 [2025-03-04 06:51:47,953 INFO L175 Difference]: Start difference. First operand has 448 places, 450 transitions, 917 flow. Second operand 6 states and 2231 transitions. [2025-03-04 06:51:47,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 449 transitions, 1115 flow [2025-03-04 06:51:47,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 449 transitions, 1113 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:51:47,958 INFO L231 Difference]: Finished difference. Result has 451 places, 449 transitions, 923 flow [2025-03-04 06:51:47,959 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=913, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=923, PETRI_PLACES=451, PETRI_TRANSITIONS=449} [2025-03-04 06:51:47,960 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, -2 predicate places. [2025-03-04 06:51:47,960 INFO L471 AbstractCegarLoop]: Abstraction has has 451 places, 449 transitions, 923 flow [2025-03-04 06:51:47,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 357.6666666666667) internal successors, (2146), 6 states have internal predecessors, (2146), 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:47,961 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:47,961 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:51:47,962 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-04 06:51:47,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:47,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1384782310, now seen corresponding path program 1 times [2025-03-04 06:51:47,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:47,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211121334] [2025-03-04 06:51:47,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:47,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:47,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 06:51:47,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 06:51:47,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:47,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:48,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:51:48,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:48,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211121334] [2025-03-04 06:51:48,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211121334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:48,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:48,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:51:48,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531417291] [2025-03-04 06:51:48,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:48,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:51:48,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:48,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:51:48,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:51:48,059 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 440 out of 472 [2025-03-04 06:51:48,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 451 places, 449 transitions, 923 flow. Second operand has 3 states, 3 states have (on average 441.3333333333333) internal successors, (1324), 3 states have internal predecessors, (1324), 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:48,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:48,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 440 of 472 [2025-03-04 06:51:48,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:48,160 INFO L124 PetriNetUnfolderBase]: 16/813 cut-off events. [2025-03-04 06:51:48,161 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-03-04 06:51:48,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 884 conditions, 813 events. 16/813 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1845 event pairs, 8 based on Foata normal form. 2/766 useless extension candidates. Maximal degree in co-relation 660. Up to 38 conditions per place. [2025-03-04 06:51:48,163 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 15 selfloop transitions, 2 changer transitions 0/450 dead transitions. [2025-03-04 06:51:48,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 450 transitions, 959 flow [2025-03-04 06:51:48,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:51:48,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:51:48,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1338 transitions. [2025-03-04 06:51:48,168 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9449152542372882 [2025-03-04 06:51:48,169 INFO L175 Difference]: Start difference. First operand has 451 places, 449 transitions, 923 flow. Second operand 3 states and 1338 transitions. [2025-03-04 06:51:48,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 450 transitions, 959 flow [2025-03-04 06:51:48,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 450 transitions, 949 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:51:48,176 INFO L231 Difference]: Finished difference. Result has 449 places, 450 transitions, 925 flow [2025-03-04 06:51:48,177 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=913, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=925, PETRI_PLACES=449, PETRI_TRANSITIONS=450} [2025-03-04 06:51:48,178 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, -4 predicate places. [2025-03-04 06:51:48,179 INFO L471 AbstractCegarLoop]: Abstraction has has 449 places, 450 transitions, 925 flow [2025-03-04 06:51:48,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 441.3333333333333) internal successors, (1324), 3 states have internal predecessors, (1324), 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:48,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:48,180 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:51:48,180 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-04 06:51:48,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:48,181 INFO L85 PathProgramCache]: Analyzing trace with hash 85501322, now seen corresponding path program 1 times [2025-03-04 06:51:48,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:48,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972349132] [2025-03-04 06:51:48,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:48,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:48,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-04 06:51:48,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-04 06:51:48,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:48,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:48,713 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:48,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:48,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972349132] [2025-03-04 06:51:48,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972349132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:48,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:48,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:51:48,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161503256] [2025-03-04 06:51:48,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:48,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:51:48,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:48,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:51:48,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:51:49,227 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 472 [2025-03-04 06:51:49,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 450 transitions, 925 flow. Second operand has 6 states, 6 states have (on average 392.5) internal successors, (2355), 6 states have internal predecessors, (2355), 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:49,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:49,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 472 [2025-03-04 06:51:49,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:49,445 INFO L124 PetriNetUnfolderBase]: 84/1123 cut-off events. [2025-03-04 06:51:49,445 INFO L125 PetriNetUnfolderBase]: For 10/14 co-relation queries the response was YES. [2025-03-04 06:51:49,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1476 conditions, 1123 events. 84/1123 cut-off events. For 10/14 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3773 event pairs, 64 based on Foata normal form. 0/1037 useless extension candidates. Maximal degree in co-relation 937. Up to 311 conditions per place. [2025-03-04 06:51:49,449 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 62 selfloop transitions, 5 changer transitions 0/449 dead transitions. [2025-03-04 06:51:49,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 449 transitions, 1057 flow [2025-03-04 06:51:49,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:51:49,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:51:49,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2396 transitions. [2025-03-04 06:51:49,453 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.846045197740113 [2025-03-04 06:51:49,454 INFO L175 Difference]: Start difference. First operand has 449 places, 450 transitions, 925 flow. Second operand 6 states and 2396 transitions. [2025-03-04 06:51:49,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 449 transitions, 1057 flow [2025-03-04 06:51:49,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 449 transitions, 1055 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:51:49,459 INFO L231 Difference]: Finished difference. Result has 452 places, 449 transitions, 931 flow [2025-03-04 06:51:49,460 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=921, PETRI_DIFFERENCE_MINUEND_PLACES=447, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=931, PETRI_PLACES=452, PETRI_TRANSITIONS=449} [2025-03-04 06:51:49,461 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, -1 predicate places. [2025-03-04 06:51:49,461 INFO L471 AbstractCegarLoop]: Abstraction has has 452 places, 449 transitions, 931 flow [2025-03-04 06:51:49,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 392.5) internal successors, (2355), 6 states have internal predecessors, (2355), 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:49,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:49,462 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:51:49,463 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-04 06:51:49,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:49,463 INFO L85 PathProgramCache]: Analyzing trace with hash -2013175932, now seen corresponding path program 1 times [2025-03-04 06:51:49,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:49,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201769577] [2025-03-04 06:51:49,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:49,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:49,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-04 06:51:49,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-04 06:51:49,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:49,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:49,885 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:49,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:49,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201769577] [2025-03-04 06:51:49,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201769577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:49,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:49,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:51:49,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175991351] [2025-03-04 06:51:49,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:49,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:51:49,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:49,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:51:49,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:51:50,262 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 355 out of 472 [2025-03-04 06:51:50,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 452 places, 449 transitions, 931 flow. Second operand has 6 states, 6 states have (on average 360.3333333333333) internal successors, (2162), 6 states have internal predecessors, (2162), 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:50,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:50,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 355 of 472 [2025-03-04 06:51:50,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:50,707 INFO L124 PetriNetUnfolderBase]: 321/1960 cut-off events. [2025-03-04 06:51:50,707 INFO L125 PetriNetUnfolderBase]: For 19/27 co-relation queries the response was YES. [2025-03-04 06:51:50,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2817 conditions, 1960 events. 321/1960 cut-off events. For 19/27 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10693 event pairs, 288 based on Foata normal form. 0/1825 useless extension candidates. Maximal degree in co-relation 2304. Up to 796 conditions per place. [2025-03-04 06:51:50,715 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 95 selfloop transitions, 5 changer transitions 0/448 dead transitions. [2025-03-04 06:51:50,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 448 transitions, 1129 flow [2025-03-04 06:51:50,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:51:50,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:51:50,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2231 transitions. [2025-03-04 06:51:50,719 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7877824858757062 [2025-03-04 06:51:50,719 INFO L175 Difference]: Start difference. First operand has 452 places, 449 transitions, 931 flow. Second operand 6 states and 2231 transitions. [2025-03-04 06:51:50,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 448 transitions, 1129 flow [2025-03-04 06:51:50,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 448 transitions, 1119 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:51:50,727 INFO L231 Difference]: Finished difference. Result has 451 places, 448 transitions, 929 flow [2025-03-04 06:51:50,728 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=919, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=929, PETRI_PLACES=451, PETRI_TRANSITIONS=448} [2025-03-04 06:51:50,729 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, -2 predicate places. [2025-03-04 06:51:50,729 INFO L471 AbstractCegarLoop]: Abstraction has has 451 places, 448 transitions, 929 flow [2025-03-04 06:51:50,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 360.3333333333333) internal successors, (2162), 6 states have internal predecessors, (2162), 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:50,730 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:50,731 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:51:50,731 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-04 06:51:50,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:50,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1298391239, now seen corresponding path program 1 times [2025-03-04 06:51:50,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:50,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362798841] [2025-03-04 06:51:50,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:50,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:50,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-04 06:51:50,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-04 06:51:50,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:50,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:51,135 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:51,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:51,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362798841] [2025-03-04 06:51:51,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362798841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:51,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:51,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:51:51,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420465262] [2025-03-04 06:51:51,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:51,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:51:51,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:51,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:51:51,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:51:51,465 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 359 out of 472 [2025-03-04 06:51:51,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 451 places, 448 transitions, 929 flow. Second operand has 6 states, 6 states have (on average 365.0) internal successors, (2190), 6 states have internal predecessors, (2190), 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:51,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:51,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 359 of 472 [2025-03-04 06:51:51,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:51,793 INFO L124 PetriNetUnfolderBase]: 321/1956 cut-off events. [2025-03-04 06:51:51,794 INFO L125 PetriNetUnfolderBase]: For 19/27 co-relation queries the response was YES. [2025-03-04 06:51:51,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2797 conditions, 1956 events. 321/1956 cut-off events. For 19/27 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10702 event pairs, 288 based on Foata normal form. 0/1825 useless extension candidates. Maximal degree in co-relation 2320. Up to 780 conditions per place. [2025-03-04 06:51:51,798 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 91 selfloop transitions, 5 changer transitions 0/447 dead transitions. [2025-03-04 06:51:51,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 447 transitions, 1119 flow [2025-03-04 06:51:51,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:51:51,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:51:51,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2251 transitions. [2025-03-04 06:51:51,803 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7948446327683616 [2025-03-04 06:51:51,803 INFO L175 Difference]: Start difference. First operand has 451 places, 448 transitions, 929 flow. Second operand 6 states and 2251 transitions. [2025-03-04 06:51:51,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 447 transitions, 1119 flow [2025-03-04 06:51:51,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 447 transitions, 1109 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:51:51,809 INFO L231 Difference]: Finished difference. Result has 450 places, 447 transitions, 927 flow [2025-03-04 06:51:51,810 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=917, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=927, PETRI_PLACES=450, PETRI_TRANSITIONS=447} [2025-03-04 06:51:51,811 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, -3 predicate places. [2025-03-04 06:51:51,811 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 447 transitions, 927 flow [2025-03-04 06:51:51,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 365.0) internal successors, (2190), 6 states have internal predecessors, (2190), 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:51,813 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:51,813 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:51:51,813 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-04 06:51:51,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:51,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1090269248, now seen corresponding path program 1 times [2025-03-04 06:51:51,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:51,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918049839] [2025-03-04 06:51:51,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:51,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:51,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-04 06:51:51,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-04 06:51:51,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:51,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:52,218 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:52,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:52,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918049839] [2025-03-04 06:51:52,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918049839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:52,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:52,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:51:52,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021451295] [2025-03-04 06:51:52,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:52,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:51:52,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:52,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:51:52,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:51:52,603 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 359 out of 472 [2025-03-04 06:51:52,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 447 transitions, 927 flow. Second operand has 6 states, 6 states have (on average 365.0) internal successors, (2190), 6 states have internal predecessors, (2190), 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:52,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:52,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 359 of 472 [2025-03-04 06:51:52,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:52,954 INFO L124 PetriNetUnfolderBase]: 321/1952 cut-off events. [2025-03-04 06:51:52,954 INFO L125 PetriNetUnfolderBase]: For 15/23 co-relation queries the response was YES. [2025-03-04 06:51:52,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2793 conditions, 1952 events. 321/1952 cut-off events. For 15/23 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10641 event pairs, 288 based on Foata normal form. 0/1825 useless extension candidates. Maximal degree in co-relation 2335. Up to 780 conditions per place. [2025-03-04 06:51:52,962 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 91 selfloop transitions, 5 changer transitions 0/446 dead transitions. [2025-03-04 06:51:52,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 446 transitions, 1117 flow [2025-03-04 06:51:52,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:51:52,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:51:52,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2251 transitions. [2025-03-04 06:51:52,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7948446327683616 [2025-03-04 06:51:52,967 INFO L175 Difference]: Start difference. First operand has 450 places, 447 transitions, 927 flow. Second operand 6 states and 2251 transitions. [2025-03-04 06:51:52,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 446 transitions, 1117 flow [2025-03-04 06:51:52,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 449 places, 446 transitions, 1107 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:51:52,972 INFO L231 Difference]: Finished difference. Result has 449 places, 446 transitions, 925 flow [2025-03-04 06:51:52,972 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=444, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=925, PETRI_PLACES=449, PETRI_TRANSITIONS=446} [2025-03-04 06:51:52,973 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, -4 predicate places. [2025-03-04 06:51:52,973 INFO L471 AbstractCegarLoop]: Abstraction has has 449 places, 446 transitions, 925 flow [2025-03-04 06:51:52,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 365.0) internal successors, (2190), 6 states have internal predecessors, (2190), 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:52,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:52,974 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:51:52,975 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-04 06:51:52,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:52,975 INFO L85 PathProgramCache]: Analyzing trace with hash -282901329, now seen corresponding path program 1 times [2025-03-04 06:51:52,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:52,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833472364] [2025-03-04 06:51:52,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:52,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:53,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-04 06:51:53,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-04 06:51:53,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:53,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:53,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 06:51:53,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:53,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833472364] [2025-03-04 06:51:53,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833472364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:53,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:53,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:51:53,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125151837] [2025-03-04 06:51:53,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:53,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:51:53,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:53,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:51:53,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:51:53,737 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 472 [2025-03-04 06:51:53,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 446 transitions, 925 flow. Second operand has 6 states, 6 states have (on average 361.5) internal successors, (2169), 6 states have internal predecessors, (2169), 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:53,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:53,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 472 [2025-03-04 06:51:53,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:54,045 INFO L124 PetriNetUnfolderBase]: 321/1948 cut-off events. [2025-03-04 06:51:54,046 INFO L125 PetriNetUnfolderBase]: For 19/27 co-relation queries the response was YES. [2025-03-04 06:51:54,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2809 conditions, 1948 events. 321/1948 cut-off events. For 19/27 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10649 event pairs, 288 based on Foata normal form. 0/1825 useless extension candidates. Maximal degree in co-relation 2348. Up to 800 conditions per place. [2025-03-04 06:51:54,054 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 96 selfloop transitions, 5 changer transitions 0/445 dead transitions. [2025-03-04 06:51:54,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 445 transitions, 1125 flow [2025-03-04 06:51:54,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:51:54,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:51:54,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2226 transitions. [2025-03-04 06:51:54,059 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7860169491525424 [2025-03-04 06:51:54,059 INFO L175 Difference]: Start difference. First operand has 449 places, 446 transitions, 925 flow. Second operand 6 states and 2226 transitions. [2025-03-04 06:51:54,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 445 transitions, 1125 flow [2025-03-04 06:51:54,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 445 transitions, 1115 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:51:54,065 INFO L231 Difference]: Finished difference. Result has 448 places, 445 transitions, 923 flow [2025-03-04 06:51:54,066 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=913, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=923, PETRI_PLACES=448, PETRI_TRANSITIONS=445} [2025-03-04 06:51:54,067 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, -5 predicate places. [2025-03-04 06:51:54,067 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 445 transitions, 923 flow [2025-03-04 06:51:54,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 361.5) internal successors, (2169), 6 states have internal predecessors, (2169), 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:54,068 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:54,069 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:51:54,069 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-04 06:51:54,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:54,070 INFO L85 PathProgramCache]: Analyzing trace with hash -763286831, now seen corresponding path program 1 times [2025-03-04 06:51:54,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:54,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605352260] [2025-03-04 06:51:54,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:54,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:54,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-04 06:51:54,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-04 06:51:54,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:54,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:54,208 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 06:51:54,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:54,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605352260] [2025-03-04 06:51:54,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605352260] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:51:54,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174458759] [2025-03-04 06:51:54,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:54,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:51:54,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:51:54,212 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:51:54,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 06:51:54,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-04 06:51:54,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-04 06:51:54,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:54,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:54,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 06:51:54,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:51:54,582 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 06:51:54,582 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:51:54,698 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 06:51:54,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174458759] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:51:54,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:51:54,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 06:51:54,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651060835] [2025-03-04 06:51:54,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:51:54,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:51:54,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:54,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:51:54,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:51:54,724 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 437 out of 472 [2025-03-04 06:51:54,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 445 transitions, 923 flow. Second operand has 10 states, 10 states have (on average 438.8) internal successors, (4388), 10 states have internal predecessors, (4388), 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:54,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:54,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 437 of 472 [2025-03-04 06:51:54,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:54,891 INFO L124 PetriNetUnfolderBase]: 16/977 cut-off events. [2025-03-04 06:51:54,891 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2025-03-04 06:51:54,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1091 conditions, 977 events. 16/977 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1216 event pairs, 8 based on Foata normal form. 4/952 useless extension candidates. Maximal degree in co-relation 866. Up to 38 conditions per place. [2025-03-04 06:51:54,894 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 19 selfloop transitions, 9 changer transitions 0/453 dead transitions. [2025-03-04 06:51:54,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 453 transitions, 997 flow [2025-03-04 06:51:54,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:51:54,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 06:51:54,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3963 transitions. [2025-03-04 06:51:54,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.932909604519774 [2025-03-04 06:51:54,900 INFO L175 Difference]: Start difference. First operand has 448 places, 445 transitions, 923 flow. Second operand 9 states and 3963 transitions. [2025-03-04 06:51:54,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 453 transitions, 997 flow [2025-03-04 06:51:54,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 453 transitions, 987 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:51:54,906 INFO L231 Difference]: Finished difference. Result has 454 places, 451 transitions, 963 flow [2025-03-04 06:51:54,907 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=913, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=439, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=963, PETRI_PLACES=454, PETRI_TRANSITIONS=451} [2025-03-04 06:51:54,907 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, 1 predicate places. [2025-03-04 06:51:54,907 INFO L471 AbstractCegarLoop]: Abstraction has has 454 places, 451 transitions, 963 flow [2025-03-04 06:51:54,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 438.8) internal successors, (4388), 10 states have internal predecessors, (4388), 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:54,909 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:54,910 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 06:51:55,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 06:51:55,118 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-04 06:51:55,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:55,119 INFO L85 PathProgramCache]: Analyzing trace with hash 46327807, now seen corresponding path program 2 times [2025-03-04 06:51:55,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:55,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475164928] [2025-03-04 06:51:55,119 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:51:55,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:55,181 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 418 statements into 2 equivalence classes. [2025-03-04 06:51:55,185 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 119 of 418 statements. [2025-03-04 06:51:55,185 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:51:55,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:55,378 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 06:51:55,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:55,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475164928] [2025-03-04 06:51:55,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475164928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:55,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:55,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:51:55,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799443558] [2025-03-04 06:51:55,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:55,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:51:55,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:55,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:51:55,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:51:56,406 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 472 [2025-03-04 06:51:56,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 451 transitions, 963 flow. Second operand has 6 states, 6 states have (on average 395.3333333333333) internal successors, (2372), 6 states have internal predecessors, (2372), 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:56,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:56,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 472 [2025-03-04 06:51:56,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:56,591 INFO L124 PetriNetUnfolderBase]: 84/1290 cut-off events. [2025-03-04 06:51:56,591 INFO L125 PetriNetUnfolderBase]: For 18/22 co-relation queries the response was YES. [2025-03-04 06:51:56,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1714 conditions, 1290 events. 84/1290 cut-off events. For 18/22 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3090 event pairs, 64 based on Foata normal form. 0/1217 useless extension candidates. Maximal degree in co-relation 1059. Up to 355 conditions per place. [2025-03-04 06:51:56,594 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 62 selfloop transitions, 5 changer transitions 0/450 dead transitions. [2025-03-04 06:51:56,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 450 transitions, 1095 flow [2025-03-04 06:51:56,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:51:56,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:51:56,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2396 transitions. [2025-03-04 06:51:56,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.846045197740113 [2025-03-04 06:51:56,598 INFO L175 Difference]: Start difference. First operand has 454 places, 451 transitions, 963 flow. Second operand 6 states and 2396 transitions. [2025-03-04 06:51:56,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 458 places, 450 transitions, 1095 flow [2025-03-04 06:51:56,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 457 places, 450 transitions, 1089 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-04 06:51:56,604 INFO L231 Difference]: Finished difference. Result has 457 places, 450 transitions, 965 flow [2025-03-04 06:51:56,605 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=955, PETRI_DIFFERENCE_MINUEND_PLACES=452, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=965, PETRI_PLACES=457, PETRI_TRANSITIONS=450} [2025-03-04 06:51:56,605 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, 4 predicate places. [2025-03-04 06:51:56,605 INFO L471 AbstractCegarLoop]: Abstraction has has 457 places, 450 transitions, 965 flow [2025-03-04 06:51:56,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 395.3333333333333) internal successors, (2372), 6 states have internal predecessors, (2372), 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:56,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:56,606 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:51:56,606 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-04 06:51:56,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:56,607 INFO L85 PathProgramCache]: Analyzing trace with hash -573082179, now seen corresponding path program 1 times [2025-03-04 06:51:56,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:56,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917598957] [2025-03-04 06:51:56,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:56,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:56,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 418 statements into 1 equivalence classes. [2025-03-04 06:51:56,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 418 of 418 statements. [2025-03-04 06:51:56,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:56,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:56,967 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2025-03-04 06:51:56,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:56,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917598957] [2025-03-04 06:51:56,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917598957] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:51:56,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658940881] [2025-03-04 06:51:56,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:56,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:51:56,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:51:56,969 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:51:56,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 06:51:57,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 418 statements into 1 equivalence classes. [2025-03-04 06:51:57,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 418 of 418 statements. [2025-03-04 06:51:57,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:57,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:57,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 1487 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 06:51:57,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:51:57,633 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 1 proven. 441 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-04 06:51:57,633 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:51:57,982 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 1 proven. 441 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-04 06:51:57,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658940881] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:51:57,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:51:57,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-03-04 06:51:57,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502864103] [2025-03-04 06:51:57,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:51:57,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 06:51:57,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:57,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 06:51:57,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-03-04 06:51:58,109 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 431 out of 472 [2025-03-04 06:51:58,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 450 transitions, 965 flow. Second operand has 19 states, 19 states have (on average 433.5263157894737) internal successors, (8237), 19 states have internal predecessors, (8237), 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:58,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:58,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 431 of 472 [2025-03-04 06:51:58,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:59,220 INFO L124 PetriNetUnfolderBase]: 17/2356 cut-off events. [2025-03-04 06:51:59,220 INFO L125 PetriNetUnfolderBase]: For 81/82 co-relation queries the response was YES. [2025-03-04 06:51:59,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2652 conditions, 2356 events. 17/2356 cut-off events. For 81/82 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1216 event pairs, 8 based on Foata normal form. 13/2341 useless extension candidates. Maximal degree in co-relation 2424. Up to 40 conditions per place. [2025-03-04 06:51:59,225 INFO L140 encePairwiseOnDemand]: 461/472 looper letters, 51 selfloop transitions, 68 changer transitions 0/536 dead transitions. [2025-03-04 06:51:59,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 519 places, 536 transitions, 1613 flow [2025-03-04 06:51:59,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-03-04 06:51:59,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2025-03-04 06:51:59,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 27285 transitions. [2025-03-04 06:51:59,244 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9175746569814366 [2025-03-04 06:51:59,244 INFO L175 Difference]: Start difference. First operand has 457 places, 450 transitions, 965 flow. Second operand 63 states and 27285 transitions. [2025-03-04 06:51:59,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 519 places, 536 transitions, 1613 flow [2025-03-04 06:51:59,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 514 places, 536 transitions, 1603 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:51:59,251 INFO L231 Difference]: Finished difference. Result has 530 places, 512 transitions, 1475 flow [2025-03-04 06:51:59,252 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=955, PETRI_DIFFERENCE_MINUEND_PLACES=452, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=1475, PETRI_PLACES=530, PETRI_TRANSITIONS=512} [2025-03-04 06:51:59,253 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, 77 predicate places. [2025-03-04 06:51:59,253 INFO L471 AbstractCegarLoop]: Abstraction has has 530 places, 512 transitions, 1475 flow [2025-03-04 06:51:59,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 433.5263157894737) internal successors, (8237), 19 states have internal predecessors, (8237), 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:59,255 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:59,256 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:51:59,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 06:51:59,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 06:51:59,460 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-04 06:51:59,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:59,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1491457430, now seen corresponding path program 2 times [2025-03-04 06:51:59,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:59,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914123985] [2025-03-04 06:51:59,463 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:51:59,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:59,639 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1437 statements into 2 equivalence classes. [2025-03-04 06:51:59,645 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 119 of 1437 statements. [2025-03-04 06:51:59,646 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:51:59,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:59,848 INFO L134 CoverageAnalysis]: Checked inductivity of 13737 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13737 trivial. 0 not checked. [2025-03-04 06:51:59,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:59,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914123985] [2025-03-04 06:51:59,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914123985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:59,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:59,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:51:59,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236363607] [2025-03-04 06:51:59,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:59,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:51:59,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:59,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:51:59,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:52:00,577 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 472 [2025-03-04 06:52:00,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 530 places, 512 transitions, 1475 flow. Second operand has 6 states, 6 states have (on average 395.3333333333333) internal successors, (2372), 6 states have internal predecessors, (2372), 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:52:00,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:00,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 472 [2025-03-04 06:52:00,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:01,335 INFO L124 PetriNetUnfolderBase]: 85/2669 cut-off events. [2025-03-04 06:52:01,335 INFO L125 PetriNetUnfolderBase]: For 440/444 co-relation queries the response was YES. [2025-03-04 06:52:01,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3799 conditions, 2669 events. 85/2669 cut-off events. For 440/444 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3092 event pairs, 64 based on Foata normal form. 0/2597 useless extension candidates. Maximal degree in co-relation 3107. Up to 783 conditions per place. [2025-03-04 06:52:01,341 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 62 selfloop transitions, 5 changer transitions 0/511 dead transitions. [2025-03-04 06:52:01,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 534 places, 511 transitions, 1607 flow [2025-03-04 06:52:01,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:52:01,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:52:01,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2396 transitions. [2025-03-04 06:52:01,343 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.846045197740113 [2025-03-04 06:52:01,343 INFO L175 Difference]: Start difference. First operand has 530 places, 512 transitions, 1475 flow. Second operand 6 states and 2396 transitions. [2025-03-04 06:52:01,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 534 places, 511 transitions, 1607 flow [2025-03-04 06:52:01,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 527 places, 511 transitions, 1531 flow, removed 19 selfloop flow, removed 7 redundant places. [2025-03-04 06:52:01,355 INFO L231 Difference]: Finished difference. Result has 527 places, 511 transitions, 1407 flow [2025-03-04 06:52:01,355 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1397, PETRI_DIFFERENCE_MINUEND_PLACES=522, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=511, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=506, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1407, PETRI_PLACES=527, PETRI_TRANSITIONS=511} [2025-03-04 06:52:01,356 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, 74 predicate places. [2025-03-04 06:52:01,356 INFO L471 AbstractCegarLoop]: Abstraction has has 527 places, 511 transitions, 1407 flow [2025-03-04 06:52:01,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 395.3333333333333) internal successors, (2372), 6 states have internal predecessors, (2372), 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:52:01,356 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:01,357 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:01,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:52:01,357 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-04 06:52:01,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:01,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1232129805, now seen corresponding path program 1 times [2025-03-04 06:52:01,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:01,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157190231] [2025-03-04 06:52:01,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:01,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:01,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1456 statements into 1 equivalence classes. [2025-03-04 06:52:01,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1456 of 1456 statements. [2025-03-04 06:52:01,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:01,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:04,297 INFO L134 CoverageAnalysis]: Checked inductivity of 13849 backedges. 7250 proven. 3073 refuted. 0 times theorem prover too weak. 3526 trivial. 0 not checked. [2025-03-04 06:52:04,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:04,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157190231] [2025-03-04 06:52:04,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157190231] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:52:04,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476377893] [2025-03-04 06:52:04,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:04,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:52:04,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:52:04,300 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:52:04,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 06:52:04,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1456 statements into 1 equivalence classes. [2025-03-04 06:52:05,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1456 of 1456 statements. [2025-03-04 06:52:05,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:05,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:05,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 5710 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 06:52:05,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:52:05,950 INFO L134 CoverageAnalysis]: Checked inductivity of 13849 backedges. 7250 proven. 3073 refuted. 0 times theorem prover too weak. 3526 trivial. 0 not checked. [2025-03-04 06:52:05,951 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:52:06,666 INFO L134 CoverageAnalysis]: Checked inductivity of 13849 backedges. 7250 proven. 3073 refuted. 0 times theorem prover too weak. 3526 trivial. 0 not checked. [2025-03-04 06:52:06,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476377893] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:52:06,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:52:06,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-03-04 06:52:06,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466448475] [2025-03-04 06:52:06,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:52:06,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 06:52:06,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:06,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 06:52:06,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 06:52:06,702 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 437 out of 472 [2025-03-04 06:52:06,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 527 places, 511 transitions, 1407 flow. Second operand has 34 states, 34 states have (on average 439.11764705882354) internal successors, (14930), 34 states have internal predecessors, (14930), 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:52:06,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:06,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 437 of 472 [2025-03-04 06:52:06,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:08,622 INFO L124 PetriNetUnfolderBase]: 17/4515 cut-off events. [2025-03-04 06:52:08,623 INFO L125 PetriNetUnfolderBase]: For 3212/3213 co-relation queries the response was YES. [2025-03-04 06:52:08,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5311 conditions, 4515 events. 17/4515 cut-off events. For 3212/3213 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1212 event pairs, 8 based on Foata normal form. 24/4512 useless extension candidates. Maximal degree in co-relation 5269. Up to 78 conditions per place. [2025-03-04 06:52:08,635 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 51 selfloop transitions, 135 changer transitions 0/612 dead transitions. [2025-03-04 06:52:08,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 571 places, 612 transitions, 2543 flow [2025-03-04 06:52:08,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-04 06:52:08,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-03-04 06:52:08,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 19749 transitions. [2025-03-04 06:52:08,644 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9298022598870056 [2025-03-04 06:52:08,644 INFO L175 Difference]: Start difference. First operand has 527 places, 511 transitions, 1407 flow. Second operand 45 states and 19749 transitions. [2025-03-04 06:52:08,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 571 places, 612 transitions, 2543 flow [2025-03-04 06:52:08,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 566 places, 612 transitions, 2533 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:52:08,656 INFO L231 Difference]: Finished difference. Result has 575 places, 586 transitions, 2271 flow [2025-03-04 06:52:08,657 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1397, PETRI_DIFFERENCE_MINUEND_PLACES=522, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=511, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=2271, PETRI_PLACES=575, PETRI_TRANSITIONS=586} [2025-03-04 06:52:08,658 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, 122 predicate places. [2025-03-04 06:52:08,658 INFO L471 AbstractCegarLoop]: Abstraction has has 575 places, 586 transitions, 2271 flow [2025-03-04 06:52:08,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 439.11764705882354) internal successors, (14930), 34 states have internal predecessors, (14930), 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:52:08,661 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:08,662 INFO L206 CegarLoopForPetriNet]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:08,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 06:52:08,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:52:08,863 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-04 06:52:08,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:08,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1826167309, now seen corresponding path program 2 times [2025-03-04 06:52:08,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:08,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138031981] [2025-03-04 06:52:08,868 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:52:08,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:09,181 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2896 statements into 2 equivalence classes. [2025-03-04 06:52:09,185 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 138 of 2896 statements. [2025-03-04 06:52:09,185 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:52:09,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:09,509 INFO L134 CoverageAnalysis]: Checked inductivity of 64681 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64681 trivial. 0 not checked. [2025-03-04 06:52:09,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:09,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138031981] [2025-03-04 06:52:09,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138031981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:09,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:09,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:52:09,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533290208] [2025-03-04 06:52:09,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:09,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:52:09,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:09,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:52:09,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:52:09,903 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 352 out of 472 [2025-03-04 06:52:09,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 575 places, 586 transitions, 2271 flow. Second operand has 6 states, 6 states have (on average 360.8333333333333) internal successors, (2165), 6 states have internal predecessors, (2165), 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:52:09,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:09,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 352 of 472 [2025-03-04 06:52:09,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:13,643 INFO L124 PetriNetUnfolderBase]: 741/7068 cut-off events. [2025-03-04 06:52:13,644 INFO L125 PetriNetUnfolderBase]: For 1238/1252 co-relation queries the response was YES. [2025-03-04 06:52:13,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10831 conditions, 7068 events. 741/7068 cut-off events. For 1238/1252 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 22599 event pairs, 323 based on Foata normal form. 4/6822 useless extension candidates. Maximal degree in co-relation 6574. Up to 2693 conditions per place. [2025-03-04 06:52:13,671 INFO L140 encePairwiseOnDemand]: 437/472 looper letters, 135 selfloop transitions, 118 changer transitions 0/735 dead transitions. [2025-03-04 06:52:13,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 580 places, 735 transitions, 3075 flow [2025-03-04 06:52:13,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:52:13,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:52:13,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2366 transitions. [2025-03-04 06:52:13,673 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.83545197740113 [2025-03-04 06:52:13,673 INFO L175 Difference]: Start difference. First operand has 575 places, 586 transitions, 2271 flow. Second operand 6 states and 2366 transitions. [2025-03-04 06:52:13,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 580 places, 735 transitions, 3075 flow [2025-03-04 06:52:13,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 562 places, 735 transitions, 2967 flow, removed 0 selfloop flow, removed 18 redundant places. [2025-03-04 06:52:13,690 INFO L231 Difference]: Finished difference. Result has 567 places, 703 transitions, 2937 flow [2025-03-04 06:52:13,692 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=2163, PETRI_DIFFERENCE_MINUEND_PLACES=557, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=586, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=552, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2937, PETRI_PLACES=567, PETRI_TRANSITIONS=703} [2025-03-04 06:52:13,693 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, 114 predicate places. [2025-03-04 06:52:13,693 INFO L471 AbstractCegarLoop]: Abstraction has has 567 places, 703 transitions, 2937 flow [2025-03-04 06:52:13,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 360.8333333333333) internal successors, (2165), 6 states have internal predecessors, (2165), 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:52:13,693 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:13,694 INFO L206 CegarLoopForPetriNet]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:13,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:52:13,694 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-04 06:52:13,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:13,700 INFO L85 PathProgramCache]: Analyzing trace with hash -915891560, now seen corresponding path program 1 times [2025-03-04 06:52:13,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:13,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077205441] [2025-03-04 06:52:13,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:13,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:14,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2896 statements into 1 equivalence classes. [2025-03-04 06:52:14,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2896 of 2896 statements. [2025-03-04 06:52:14,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:14,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:16,597 INFO L134 CoverageAnalysis]: Checked inductivity of 64681 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64681 trivial. 0 not checked. [2025-03-04 06:52:16,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:16,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077205441] [2025-03-04 06:52:16,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077205441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:16,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:16,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:52:16,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735267957] [2025-03-04 06:52:16,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:16,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:16,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:16,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:16,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:16,618 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 440 out of 472 [2025-03-04 06:52:16,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 567 places, 703 transitions, 2937 flow. Second operand has 3 states, 3 states have (on average 441.3333333333333) internal successors, (1324), 3 states have internal predecessors, (1324), 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:52:16,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:16,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 440 of 472 [2025-03-04 06:52:16,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:19,628 INFO L124 PetriNetUnfolderBase]: 230/5691 cut-off events. [2025-03-04 06:52:19,628 INFO L125 PetriNetUnfolderBase]: For 1392/1434 co-relation queries the response was YES. [2025-03-04 06:52:19,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7390 conditions, 5691 events. 230/5691 cut-off events. For 1392/1434 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 11052 event pairs, 24 based on Foata normal form. 2/5565 useless extension candidates. Maximal degree in co-relation 5024. Up to 340 conditions per place. [2025-03-04 06:52:19,642 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 22 selfloop transitions, 3 changer transitions 0/711 dead transitions. [2025-03-04 06:52:19,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 569 places, 711 transitions, 3003 flow [2025-03-04 06:52:19,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:19,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:19,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1345 transitions. [2025-03-04 06:52:19,644 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9498587570621468 [2025-03-04 06:52:19,644 INFO L175 Difference]: Start difference. First operand has 567 places, 703 transitions, 2937 flow. Second operand 3 states and 1345 transitions. [2025-03-04 06:52:19,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 569 places, 711 transitions, 3003 flow [2025-03-04 06:52:19,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 569 places, 711 transitions, 3003 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:52:19,661 INFO L231 Difference]: Finished difference. Result has 570 places, 703 transitions, 2948 flow [2025-03-04 06:52:19,662 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=2937, PETRI_DIFFERENCE_MINUEND_PLACES=567, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=703, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=700, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2948, PETRI_PLACES=570, PETRI_TRANSITIONS=703} [2025-03-04 06:52:19,662 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, 117 predicate places. [2025-03-04 06:52:19,662 INFO L471 AbstractCegarLoop]: Abstraction has has 570 places, 703 transitions, 2948 flow [2025-03-04 06:52:19,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 441.3333333333333) internal successors, (1324), 3 states have internal predecessors, (1324), 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:52:19,663 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:19,664 INFO L206 CegarLoopForPetriNet]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:19,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 06:52:19,664 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-04 06:52:19,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:19,670 INFO L85 PathProgramCache]: Analyzing trace with hash -244534679, now seen corresponding path program 1 times [2025-03-04 06:52:19,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:19,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648074822] [2025-03-04 06:52:19,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:19,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:19,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2910 statements into 1 equivalence classes. [2025-03-04 06:52:20,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2910 of 2910 statements. [2025-03-04 06:52:20,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:20,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:23,481 INFO L134 CoverageAnalysis]: Checked inductivity of 64681 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64681 trivial. 0 not checked. [2025-03-04 06:52:23,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:23,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648074822] [2025-03-04 06:52:23,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648074822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:23,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:23,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:52:23,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899829302] [2025-03-04 06:52:23,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:23,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:52:23,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:23,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:52:23,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:52:23,508 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 438 out of 472 [2025-03-04 06:52:23,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 570 places, 703 transitions, 2948 flow. Second operand has 5 states, 5 states have (on average 439.6) internal successors, (2198), 5 states have internal predecessors, (2198), 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:52:23,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:23,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 438 of 472 [2025-03-04 06:52:23,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:25,930 INFO L124 PetriNetUnfolderBase]: 304/5780 cut-off events. [2025-03-04 06:52:25,930 INFO L125 PetriNetUnfolderBase]: For 1410/1436 co-relation queries the response was YES. [2025-03-04 06:52:25,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7665 conditions, 5780 events. 304/5780 cut-off events. For 1410/1436 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 10621 event pairs, 0 based on Foata normal form. 9/5685 useless extension candidates. Maximal degree in co-relation 5025. Up to 369 conditions per place. [2025-03-04 06:52:25,945 INFO L140 encePairwiseOnDemand]: 467/472 looper letters, 34 selfloop transitions, 5 changer transitions 0/704 dead transitions. [2025-03-04 06:52:25,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 704 transitions, 3023 flow [2025-03-04 06:52:25,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:52:25,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:52:25,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2667 transitions. [2025-03-04 06:52:25,948 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9417372881355932 [2025-03-04 06:52:25,948 INFO L175 Difference]: Start difference. First operand has 570 places, 703 transitions, 2948 flow. Second operand 6 states and 2667 transitions. [2025-03-04 06:52:25,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 704 transitions, 3023 flow [2025-03-04 06:52:25,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 550 places, 704 transitions, 3014 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 06:52:25,965 INFO L231 Difference]: Finished difference. Result has 550 places, 680 transitions, 2898 flow [2025-03-04 06:52:25,966 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=2888, PETRI_DIFFERENCE_MINUEND_PLACES=545, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=680, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=675, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2898, PETRI_PLACES=550, PETRI_TRANSITIONS=680} [2025-03-04 06:52:25,967 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, 97 predicate places. [2025-03-04 06:52:25,967 INFO L471 AbstractCegarLoop]: Abstraction has has 550 places, 680 transitions, 2898 flow [2025-03-04 06:52:25,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 439.6) internal successors, (2198), 5 states have internal predecessors, (2198), 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:52:25,967 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:25,968 INFO L206 CegarLoopForPetriNet]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:25,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 06:52:25,969 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-04 06:52:25,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:25,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1439383810, now seen corresponding path program 1 times [2025-03-04 06:52:25,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:25,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763436233] [2025-03-04 06:52:25,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:25,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:26,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2911 statements into 1 equivalence classes. [2025-03-04 06:52:26,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2911 of 2911 statements. [2025-03-04 06:52:26,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:26,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:36,762 INFO L134 CoverageAnalysis]: Checked inductivity of 64681 backedges. 33026 proven. 15345 refuted. 0 times theorem prover too weak. 16310 trivial. 0 not checked. [2025-03-04 06:52:36,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:36,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763436233] [2025-03-04 06:52:36,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763436233] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:52:36,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828112468] [2025-03-04 06:52:36,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:36,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:52:36,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:52:36,769 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:52:36,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 06:52:38,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2911 statements into 1 equivalence classes. [2025-03-04 06:52:39,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2911 of 2911 statements. [2025-03-04 06:52:39,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:39,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:39,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 11659 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 06:52:39,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:52:40,221 INFO L134 CoverageAnalysis]: Checked inductivity of 64681 backedges. 33026 proven. 15345 refuted. 0 times theorem prover too weak. 16310 trivial. 0 not checked. [2025-03-04 06:52:40,222 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:52:41,750 INFO L134 CoverageAnalysis]: Checked inductivity of 64681 backedges. 33026 proven. 15345 refuted. 0 times theorem prover too weak. 16310 trivial. 0 not checked. [2025-03-04 06:52:41,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828112468] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:52:41,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:52:41,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 63 [2025-03-04 06:52:41,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463648134] [2025-03-04 06:52:41,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:52:41,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-03-04 06:52:41,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:41,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-03-04 06:52:41,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2025-03-04 06:52:41,804 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 437 out of 472 [2025-03-04 06:52:41,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 550 places, 680 transitions, 2898 flow. Second operand has 63 states, 63 states have (on average 439.1111111111111) internal successors, (27664), 63 states have internal predecessors, (27664), 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:52:41,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:41,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 437 of 472 [2025-03-04 06:52:41,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:49,100 INFO L124 PetriNetUnfolderBase]: 198/9518 cut-off events. [2025-03-04 06:52:49,100 INFO L125 PetriNetUnfolderBase]: For 13554/13601 co-relation queries the response was YES. [2025-03-04 06:52:49,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12289 conditions, 9518 events. 198/9518 cut-off events. For 13554/13601 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 8814 event pairs, 0 based on Foata normal form. 45/9477 useless extension candidates. Maximal degree in co-relation 10211. Up to 345 conditions per place. [2025-03-04 06:52:49,130 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 94 selfloop transitions, 270 changer transitions 0/886 dead transitions. [2025-03-04 06:52:49,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 639 places, 886 transitions, 5812 flow [2025-03-04 06:52:49,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2025-03-04 06:52:49,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2025-03-04 06:52:49,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 39479 transitions. [2025-03-04 06:52:49,160 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9293549905838041 [2025-03-04 06:52:49,162 INFO L175 Difference]: Start difference. First operand has 550 places, 680 transitions, 2898 flow. Second operand 90 states and 39479 transitions. [2025-03-04 06:52:49,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 639 places, 886 transitions, 5812 flow [2025-03-04 06:52:49,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 635 places, 886 transitions, 5803 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 06:52:49,186 INFO L231 Difference]: Finished difference. Result has 651 places, 818 transitions, 4881 flow [2025-03-04 06:52:49,188 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=2889, PETRI_DIFFERENCE_MINUEND_PLACES=546, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=680, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=90, PETRI_FLOW=4881, PETRI_PLACES=651, PETRI_TRANSITIONS=818} [2025-03-04 06:52:49,189 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, 198 predicate places. [2025-03-04 06:52:49,189 INFO L471 AbstractCegarLoop]: Abstraction has has 651 places, 818 transitions, 4881 flow [2025-03-04 06:52:49,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 439.1111111111111) internal successors, (27664), 63 states have internal predecessors, (27664), 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:52:49,194 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:49,195 INFO L206 CegarLoopForPetriNet]: trace histogram [60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:49,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 06:52:49,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:52:49,396 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-04 06:52:49,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:49,407 INFO L85 PathProgramCache]: Analyzing trace with hash -598823842, now seen corresponding path program 2 times [2025-03-04 06:52:49,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:49,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628997058] [2025-03-04 06:52:49,407 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:52:49,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:49,936 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5611 statements into 2 equivalence classes. [2025-03-04 06:52:50,580 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 5611 of 5611 statements. [2025-03-04 06:52:50,580 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 06:52:50,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat