./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 408d8d7e58240f749ab11087191b04ec647cfea8447827b0505b793eb68a9c0a --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:37:32,867 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:37:32,902 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:37:32,905 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:37:32,906 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:37:32,919 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:37:32,919 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:37:32,919 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:37:32,919 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:37:32,920 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:37:32,920 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:37:32,920 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:37:32,920 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:37:32,920 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:37:32,920 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:37:32,920 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:37:32,920 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:37:32,920 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:37:32,921 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:37:32,921 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:37:32,921 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:37:32,921 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:37:32,921 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:37:32,921 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:37:32,921 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:37:32,921 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:37:32,921 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:37:32,921 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:37:32,921 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:37:32,922 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:37:32,922 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:37:32,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:37:32,922 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:37:32,922 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:37:32,922 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:37:32,922 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:37:32,922 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:37:32,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:37:32,922 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:37:32,922 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:37:32,923 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:37:32,923 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:37:32,923 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 408d8d7e58240f749ab11087191b04ec647cfea8447827b0505b793eb68a9c0a [2025-02-08 05:37:33,141 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:37:33,157 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:37:33,159 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:37:33,160 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:37:33,160 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:37:33,165 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c [2025-02-08 05:37:34,368 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e35fa17ca/9d26587851874781bef25d84d597b05a/FLAG32490c5f5 [2025-02-08 05:37:34,607 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:37:34,608 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c [2025-02-08 05:37:34,633 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e35fa17ca/9d26587851874781bef25d84d597b05a/FLAG32490c5f5 [2025-02-08 05:37:34,950 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e35fa17ca/9d26587851874781bef25d84d597b05a [2025-02-08 05:37:34,952 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:37:34,953 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:37:34,954 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:34,954 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:37:34,957 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:37:34,957 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:34" (1/1) ... [2025-02-08 05:37:34,958 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ed66158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:34, skipping insertion in model container [2025-02-08 05:37:34,958 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:34" (1/1) ... [2025-02-08 05:37:34,968 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:37:35,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:35,072 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:37:35,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:35,098 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:37:35,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:35 WrapperNode [2025-02-08 05:37:35,099 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:35,099 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:35,100 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:37:35,100 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:37:35,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:35" (1/1) ... [2025-02-08 05:37:35,108 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:35" (1/1) ... [2025-02-08 05:37:35,123 INFO L138 Inliner]: procedures = 22, calls = 16, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 304 [2025-02-08 05:37:35,124 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:35,124 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:37:35,124 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:37:35,125 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:37:35,129 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:35" (1/1) ... [2025-02-08 05:37:35,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:35" (1/1) ... [2025-02-08 05:37:35,131 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:35" (1/1) ... [2025-02-08 05:37:35,131 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:35" (1/1) ... [2025-02-08 05:37:35,135 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:35" (1/1) ... [2025-02-08 05:37:35,136 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:35" (1/1) ... [2025-02-08 05:37:35,137 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:35" (1/1) ... [2025-02-08 05:37:35,138 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:35" (1/1) ... [2025-02-08 05:37:35,139 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:37:35,140 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:37:35,140 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:37:35,140 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:37:35,141 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:35" (1/1) ... [2025-02-08 05:37:35,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:37:35,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:37:35,163 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:37:35,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:37:35,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:37:35,183 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:37:35,183 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:37:35,183 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:37:35,183 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:37:35,183 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 05:37:35,183 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 05:37:35,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:37:35,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:37:35,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:37:35,184 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:37:35,255 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:37:35,257 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:37:35,355 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L44-17: #t~ite2#1 := #t~ret1#1; [2025-02-08 05:37:35,356 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L44-18: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret1#1 && #t~ret1#1 <= 2147483647; [2025-02-08 05:37:35,356 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L44-19: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:35,356 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L44-20: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:35,356 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L44-21: #t~ret1#1 := minus_#res#1; [2025-02-08 05:37:35,432 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-17: #t~ite8#1 := #t~ret7#1; [2025-02-08 05:37:35,433 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-18: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret7#1 && #t~ret7#1 <= 2147483647; [2025-02-08 05:37:35,433 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-19: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:35,433 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-20: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:35,433 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-21: #t~ret7#1 := minus_#res#1; [2025-02-08 05:37:35,504 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-17: #t~ite14#1 := #t~ret13#1; [2025-02-08 05:37:35,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-18: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret13#1 && #t~ret13#1 <= 2147483647; [2025-02-08 05:37:35,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-19: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:35,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-20: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:35,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-21: #t~ret13#1 := minus_#res#1; [2025-02-08 05:37:35,618 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:37:35,618 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:37:35,642 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:37:35,643 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:37:35,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:35 BoogieIcfgContainer [2025-02-08 05:37:35,644 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:37:35,646 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:37:35,647 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:37:35,650 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:37:35,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:37:34" (1/3) ... [2025-02-08 05:37:35,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@539c012b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:35, skipping insertion in model container [2025-02-08 05:37:35,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:35" (2/3) ... [2025-02-08 05:37:35,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@539c012b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:35, skipping insertion in model container [2025-02-08 05:37:35,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:35" (3/3) ... [2025-02-08 05:37:35,653 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-file-item-trans.wvr.c [2025-02-08 05:37:35,665 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:37:35,668 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-file-item-trans.wvr.c that has 4 procedures, 371 locations, 1 initial locations, 0 loop locations, and 39 error locations. [2025-02-08 05:37:35,670 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:37:35,773 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:37:35,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 380 places, 388 transitions, 797 flow [2025-02-08 05:37:35,933 INFO L124 PetriNetUnfolderBase]: 18/385 cut-off events. [2025-02-08 05:37:35,934 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:37:35,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 398 conditions, 385 events. 18/385 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1042 event pairs, 0 based on Foata normal form. 0/325 useless extension candidates. Maximal degree in co-relation 273. Up to 2 conditions per place. [2025-02-08 05:37:35,942 INFO L82 GeneralOperation]: Start removeDead. Operand has 380 places, 388 transitions, 797 flow [2025-02-08 05:37:35,949 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 358 places, 364 transitions, 746 flow [2025-02-08 05:37:35,954 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:37:35,962 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;@489af394, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:37:35,962 INFO L334 AbstractCegarLoop]: Starting to check reachability of 69 error locations. [2025-02-08 05:37:35,972 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:37:35,972 INFO L124 PetriNetUnfolderBase]: 0/29 cut-off events. [2025-02-08 05:37:35,972 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:37:35,972 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:35,973 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] [2025-02-08 05:37:35,973 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:35,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:35,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1687706952, now seen corresponding path program 1 times [2025-02-08 05:37:35,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:35,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395639434] [2025-02-08 05:37:35,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:35,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:36,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 05:37:36,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 05:37:36,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:36,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:36,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:36,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:36,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395639434] [2025-02-08 05:37:36,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395639434] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:36,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:36,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:36,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752345738] [2025-02-08 05:37:36,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:36,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:36,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:36,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:36,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:36,161 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 365 out of 388 [2025-02-08 05:37:36,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 364 transitions, 746 flow. Second operand has 3 states, 3 states have (on average 366.3333333333333) internal successors, (1099), 3 states have internal predecessors, (1099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:36,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:36,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 365 of 388 [2025-02-08 05:37:36,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:36,269 INFO L124 PetriNetUnfolderBase]: 21/519 cut-off events. [2025-02-08 05:37:36,270 INFO L125 PetriNetUnfolderBase]: For 14/16 co-relation queries the response was YES. [2025-02-08 05:37:36,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 519 events. 21/519 cut-off events. For 14/16 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2124 event pairs, 5 based on Foata normal form. 19/450 useless extension candidates. Maximal degree in co-relation 409. Up to 22 conditions per place. [2025-02-08 05:37:36,279 INFO L140 encePairwiseOnDemand]: 379/388 looper letters, 11 selfloop transitions, 2 changer transitions 0/357 dead transitions. [2025-02-08 05:37:36,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 357 transitions, 758 flow [2025-02-08 05:37:36,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:36,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:36,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1115 transitions. [2025-02-08 05:37:36,295 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9579037800687286 [2025-02-08 05:37:36,298 INFO L175 Difference]: Start difference. First operand has 358 places, 364 transitions, 746 flow. Second operand 3 states and 1115 transitions. [2025-02-08 05:37:36,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 357 transitions, 758 flow [2025-02-08 05:37:36,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 357 transitions, 746 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 05:37:36,308 INFO L231 Difference]: Finished difference. Result has 353 places, 357 transitions, 724 flow [2025-02-08 05:37:36,312 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=724, PETRI_PLACES=353, PETRI_TRANSITIONS=357} [2025-02-08 05:37:36,315 INFO L279 CegarLoopForPetriNet]: 358 programPoint places, -5 predicate places. [2025-02-08 05:37:36,316 INFO L471 AbstractCegarLoop]: Abstraction has has 353 places, 357 transitions, 724 flow [2025-02-08 05:37:36,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 366.3333333333333) internal successors, (1099), 3 states have internal predecessors, (1099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:36,317 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:36,317 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] [2025-02-08 05:37:36,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:37:36,318 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:36,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:36,319 INFO L85 PathProgramCache]: Analyzing trace with hash -674553556, now seen corresponding path program 1 times [2025-02-08 05:37:36,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:36,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879525047] [2025-02-08 05:37:36,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:36,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:36,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 05:37:36,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 05:37:36,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:36,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:36,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:36,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:36,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879525047] [2025-02-08 05:37:36,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879525047] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:36,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:36,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:36,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991950987] [2025-02-08 05:37:36,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:36,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:36,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:36,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:36,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:36,384 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 365 out of 388 [2025-02-08 05:37:36,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 357 transitions, 724 flow. Second operand has 3 states, 3 states have (on average 366.3333333333333) internal successors, (1099), 3 states have internal predecessors, (1099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:36,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:36,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 365 of 388 [2025-02-08 05:37:36,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:36,553 INFO L124 PetriNetUnfolderBase]: 29/671 cut-off events. [2025-02-08 05:37:36,553 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-02-08 05:37:36,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 709 conditions, 671 events. 29/671 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3066 event pairs, 7 based on Foata normal form. 0/552 useless extension candidates. Maximal degree in co-relation 672. Up to 25 conditions per place. [2025-02-08 05:37:36,559 INFO L140 encePairwiseOnDemand]: 385/388 looper letters, 11 selfloop transitions, 2 changer transitions 0/356 dead transitions. [2025-02-08 05:37:36,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 356 transitions, 748 flow [2025-02-08 05:37:36,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:36,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:36,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1109 transitions. [2025-02-08 05:37:36,561 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9527491408934707 [2025-02-08 05:37:36,561 INFO L175 Difference]: Start difference. First operand has 353 places, 357 transitions, 724 flow. Second operand 3 states and 1109 transitions. [2025-02-08 05:37:36,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 356 transitions, 748 flow [2025-02-08 05:37:36,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 356 transitions, 744 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:36,571 INFO L231 Difference]: Finished difference. Result has 352 places, 356 transitions, 722 flow [2025-02-08 05:37:36,575 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=722, PETRI_PLACES=352, PETRI_TRANSITIONS=356} [2025-02-08 05:37:36,575 INFO L279 CegarLoopForPetriNet]: 358 programPoint places, -6 predicate places. [2025-02-08 05:37:36,575 INFO L471 AbstractCegarLoop]: Abstraction has has 352 places, 356 transitions, 722 flow [2025-02-08 05:37:36,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 366.3333333333333) internal successors, (1099), 3 states have internal predecessors, (1099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:36,576 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:36,576 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] [2025-02-08 05:37:36,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:37:36,577 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:36,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:36,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1557339647, now seen corresponding path program 1 times [2025-02-08 05:37:36,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:36,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051743868] [2025-02-08 05:37:36,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:36,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:36,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-08 05:37:36,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 05:37:36,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:36,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:36,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:36,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:36,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051743868] [2025-02-08 05:37:36,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051743868] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:36,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:36,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:36,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200476456] [2025-02-08 05:37:36,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:36,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:36,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:36,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:36,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:36,688 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 365 out of 388 [2025-02-08 05:37:36,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 356 transitions, 722 flow. Second operand has 3 states, 3 states have (on average 366.3333333333333) internal successors, (1099), 3 states have internal predecessors, (1099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:36,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:36,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 365 of 388 [2025-02-08 05:37:36,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:36,824 INFO L124 PetriNetUnfolderBase]: 20/442 cut-off events. [2025-02-08 05:37:36,825 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-02-08 05:37:36,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 477 conditions, 442 events. 20/442 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1570 event pairs, 7 based on Foata normal form. 0/372 useless extension candidates. Maximal degree in co-relation 432. Up to 25 conditions per place. [2025-02-08 05:37:36,830 INFO L140 encePairwiseOnDemand]: 385/388 looper letters, 11 selfloop transitions, 2 changer transitions 0/355 dead transitions. [2025-02-08 05:37:36,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 355 transitions, 746 flow [2025-02-08 05:37:36,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:36,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:36,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1109 transitions. [2025-02-08 05:37:36,833 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9527491408934707 [2025-02-08 05:37:36,833 INFO L175 Difference]: Start difference. First operand has 352 places, 356 transitions, 722 flow. Second operand 3 states and 1109 transitions. [2025-02-08 05:37:36,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 355 transitions, 746 flow [2025-02-08 05:37:36,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 355 transitions, 742 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:36,839 INFO L231 Difference]: Finished difference. Result has 351 places, 355 transitions, 720 flow [2025-02-08 05:37:36,839 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=720, PETRI_PLACES=351, PETRI_TRANSITIONS=355} [2025-02-08 05:37:36,840 INFO L279 CegarLoopForPetriNet]: 358 programPoint places, -7 predicate places. [2025-02-08 05:37:36,840 INFO L471 AbstractCegarLoop]: Abstraction has has 351 places, 355 transitions, 720 flow [2025-02-08 05:37:36,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 366.3333333333333) internal successors, (1099), 3 states have internal predecessors, (1099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:36,841 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:36,841 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] [2025-02-08 05:37:36,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:37:36,842 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:36,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:36,842 INFO L85 PathProgramCache]: Analyzing trace with hash 869128029, now seen corresponding path program 1 times [2025-02-08 05:37:36,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:36,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400806086] [2025-02-08 05:37:36,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:36,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:36,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 05:37:36,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 05:37:36,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:36,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:36,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:36,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:36,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400806086] [2025-02-08 05:37:36,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400806086] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:36,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:36,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:36,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789077313] [2025-02-08 05:37:36,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:36,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:36,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:36,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:36,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:36,917 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 365 out of 388 [2025-02-08 05:37:36,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 355 transitions, 720 flow. Second operand has 3 states, 3 states have (on average 366.3333333333333) internal successors, (1099), 3 states have internal predecessors, (1099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:36,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:36,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 365 of 388 [2025-02-08 05:37:36,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:37,040 INFO L124 PetriNetUnfolderBase]: 24/577 cut-off events. [2025-02-08 05:37:37,040 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:37:37,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 610 conditions, 577 events. 24/577 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2703 event pairs, 5 based on Foata normal form. 0/477 useless extension candidates. Maximal degree in co-relation 557. Up to 22 conditions per place. [2025-02-08 05:37:37,053 INFO L140 encePairwiseOnDemand]: 385/388 looper letters, 11 selfloop transitions, 2 changer transitions 0/354 dead transitions. [2025-02-08 05:37:37,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 354 transitions, 744 flow [2025-02-08 05:37:37,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:37,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:37,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1109 transitions. [2025-02-08 05:37:37,055 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9527491408934707 [2025-02-08 05:37:37,055 INFO L175 Difference]: Start difference. First operand has 351 places, 355 transitions, 720 flow. Second operand 3 states and 1109 transitions. [2025-02-08 05:37:37,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 354 transitions, 744 flow [2025-02-08 05:37:37,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 354 transitions, 740 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:37,063 INFO L231 Difference]: Finished difference. Result has 350 places, 354 transitions, 718 flow [2025-02-08 05:37:37,066 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=714, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=718, PETRI_PLACES=350, PETRI_TRANSITIONS=354} [2025-02-08 05:37:37,067 INFO L279 CegarLoopForPetriNet]: 358 programPoint places, -8 predicate places. [2025-02-08 05:37:37,068 INFO L471 AbstractCegarLoop]: Abstraction has has 350 places, 354 transitions, 718 flow [2025-02-08 05:37:37,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 366.3333333333333) internal successors, (1099), 3 states have internal predecessors, (1099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:37,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:37,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] [2025-02-08 05:37:37,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:37:37,069 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:37,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:37,070 INFO L85 PathProgramCache]: Analyzing trace with hash 669411594, now seen corresponding path program 1 times [2025-02-08 05:37:37,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:37,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480922769] [2025-02-08 05:37:37,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:37,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:37,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 05:37:37,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 05:37:37,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:37,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:37,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:37,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:37,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480922769] [2025-02-08 05:37:37,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480922769] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:37,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:37,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:37,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482567763] [2025-02-08 05:37:37,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:37,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:37,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:37,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:37,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:37,154 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 388 [2025-02-08 05:37:37,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 354 transitions, 718 flow. Second operand has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:37,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:37,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 388 [2025-02-08 05:37:37,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:37,328 INFO L124 PetriNetUnfolderBase]: 43/854 cut-off events. [2025-02-08 05:37:37,328 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:37:37,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 905 conditions, 854 events. 43/854 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4922 event pairs, 12 based on Foata normal form. 0/697 useless extension candidates. Maximal degree in co-relation 844. Up to 35 conditions per place. [2025-02-08 05:37:37,336 INFO L140 encePairwiseOnDemand]: 385/388 looper letters, 12 selfloop transitions, 2 changer transitions 0/353 dead transitions. [2025-02-08 05:37:37,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 353 transitions, 744 flow [2025-02-08 05:37:37,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:37,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:37,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1107 transitions. [2025-02-08 05:37:37,340 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9510309278350515 [2025-02-08 05:37:37,341 INFO L175 Difference]: Start difference. First operand has 350 places, 354 transitions, 718 flow. Second operand 3 states and 1107 transitions. [2025-02-08 05:37:37,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 353 transitions, 744 flow [2025-02-08 05:37:37,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 353 transitions, 740 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:37,346 INFO L231 Difference]: Finished difference. Result has 349 places, 353 transitions, 716 flow [2025-02-08 05:37:37,346 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=712, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=716, PETRI_PLACES=349, PETRI_TRANSITIONS=353} [2025-02-08 05:37:37,347 INFO L279 CegarLoopForPetriNet]: 358 programPoint places, -9 predicate places. [2025-02-08 05:37:37,348 INFO L471 AbstractCegarLoop]: Abstraction has has 349 places, 353 transitions, 716 flow [2025-02-08 05:37:37,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:37,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:37,348 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] [2025-02-08 05:37:37,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:37:37,349 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:37,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:37,349 INFO L85 PathProgramCache]: Analyzing trace with hash 2029829436, now seen corresponding path program 1 times [2025-02-08 05:37:37,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:37,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014029347] [2025-02-08 05:37:37,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:37,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:37,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-08 05:37:37,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-08 05:37:37,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:37,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:37,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:37,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:37,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014029347] [2025-02-08 05:37:37,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014029347] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:37,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:37,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:37,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337780247] [2025-02-08 05:37:37,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:37,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:37,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:37,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:37,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:37,457 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 363 out of 388 [2025-02-08 05:37:37,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 353 transitions, 716 flow. Second operand has 3 states, 3 states have (on average 364.3333333333333) internal successors, (1093), 3 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:37,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:37,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 363 of 388 [2025-02-08 05:37:37,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:37,563 INFO L124 PetriNetUnfolderBase]: 54/908 cut-off events. [2025-02-08 05:37:37,564 INFO L125 PetriNetUnfolderBase]: For 13/17 co-relation queries the response was YES. [2025-02-08 05:37:37,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 969 conditions, 908 events. 54/908 cut-off events. For 13/17 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 4910 event pairs, 20 based on Foata normal form. 0/745 useless extension candidates. Maximal degree in co-relation 900. Up to 50 conditions per place. [2025-02-08 05:37:37,572 INFO L140 encePairwiseOnDemand]: 385/388 looper letters, 13 selfloop transitions, 2 changer transitions 0/352 dead transitions. [2025-02-08 05:37:37,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 352 transitions, 744 flow [2025-02-08 05:37:37,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:37,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:37,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1105 transitions. [2025-02-08 05:37:37,574 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9493127147766323 [2025-02-08 05:37:37,574 INFO L175 Difference]: Start difference. First operand has 349 places, 353 transitions, 716 flow. Second operand 3 states and 1105 transitions. [2025-02-08 05:37:37,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 352 transitions, 744 flow [2025-02-08 05:37:37,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 352 transitions, 740 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:37,579 INFO L231 Difference]: Finished difference. Result has 348 places, 352 transitions, 714 flow [2025-02-08 05:37:37,580 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=710, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=714, PETRI_PLACES=348, PETRI_TRANSITIONS=352} [2025-02-08 05:37:37,581 INFO L279 CegarLoopForPetriNet]: 358 programPoint places, -10 predicate places. [2025-02-08 05:37:37,581 INFO L471 AbstractCegarLoop]: Abstraction has has 348 places, 352 transitions, 714 flow [2025-02-08 05:37:37,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 364.3333333333333) internal successors, (1093), 3 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:37,582 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:37,582 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] [2025-02-08 05:37:37,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:37:37,582 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:37,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:37,583 INFO L85 PathProgramCache]: Analyzing trace with hash 384713544, now seen corresponding path program 1 times [2025-02-08 05:37:37,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:37,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759144283] [2025-02-08 05:37:37,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:37,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:37,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-08 05:37:37,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-08 05:37:37,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:37,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:37,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:37,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:37,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759144283] [2025-02-08 05:37:37,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759144283] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:37,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:37,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:37,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768271839] [2025-02-08 05:37:37,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:37,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:37,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:37,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:37,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:37,660 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 365 out of 388 [2025-02-08 05:37:37,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 352 transitions, 714 flow. Second operand has 3 states, 3 states have (on average 366.3333333333333) internal successors, (1099), 3 states have internal predecessors, (1099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:37,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:37,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 365 of 388 [2025-02-08 05:37:37,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:37,729 INFO L124 PetriNetUnfolderBase]: 24/626 cut-off events. [2025-02-08 05:37:37,730 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-02-08 05:37:37,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 660 conditions, 626 events. 24/626 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2653 event pairs, 5 based on Foata normal form. 0/525 useless extension candidates. Maximal degree in co-relation 583. Up to 23 conditions per place. [2025-02-08 05:37:37,738 INFO L140 encePairwiseOnDemand]: 385/388 looper letters, 11 selfloop transitions, 2 changer transitions 0/351 dead transitions. [2025-02-08 05:37:37,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 351 transitions, 738 flow [2025-02-08 05:37:37,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:37,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:37,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1109 transitions. [2025-02-08 05:37:37,740 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9527491408934707 [2025-02-08 05:37:37,740 INFO L175 Difference]: Start difference. First operand has 348 places, 352 transitions, 714 flow. Second operand 3 states and 1109 transitions. [2025-02-08 05:37:37,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 351 transitions, 738 flow [2025-02-08 05:37:37,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 351 transitions, 734 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:37,745 INFO L231 Difference]: Finished difference. Result has 347 places, 351 transitions, 712 flow [2025-02-08 05:37:37,745 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=708, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=712, PETRI_PLACES=347, PETRI_TRANSITIONS=351} [2025-02-08 05:37:37,746 INFO L279 CegarLoopForPetriNet]: 358 programPoint places, -11 predicate places. [2025-02-08 05:37:37,746 INFO L471 AbstractCegarLoop]: Abstraction has has 347 places, 351 transitions, 712 flow [2025-02-08 05:37:37,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 366.3333333333333) internal successors, (1099), 3 states have internal predecessors, (1099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:37,748 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:37,748 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:37,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:37:37,749 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:37,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:37,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1526811626, now seen corresponding path program 1 times [2025-02-08 05:37:37,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:37,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349673573] [2025-02-08 05:37:37,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:37,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:37,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-08 05:37:37,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-08 05:37:37,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:37,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:37,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:37,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:37,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349673573] [2025-02-08 05:37:37,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349673573] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:37,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:37,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:37,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326827817] [2025-02-08 05:37:37,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:37,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:37,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:37,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:37,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:37,828 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 388 [2025-02-08 05:37:37,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 351 transitions, 712 flow. Second operand has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:37,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:37,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 388 [2025-02-08 05:37:37,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:37,947 INFO L124 PetriNetUnfolderBase]: 43/901 cut-off events. [2025-02-08 05:37:37,947 INFO L125 PetriNetUnfolderBase]: For 2/5 co-relation queries the response was YES. [2025-02-08 05:37:37,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 952 conditions, 901 events. 43/901 cut-off events. For 2/5 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5418 event pairs, 12 based on Foata normal form. 0/742 useless extension candidates. Maximal degree in co-relation 867. Up to 35 conditions per place. [2025-02-08 05:37:37,962 INFO L140 encePairwiseOnDemand]: 385/388 looper letters, 12 selfloop transitions, 2 changer transitions 0/350 dead transitions. [2025-02-08 05:37:37,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 350 transitions, 738 flow [2025-02-08 05:37:37,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:37,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:37,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1107 transitions. [2025-02-08 05:37:37,968 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9510309278350515 [2025-02-08 05:37:37,968 INFO L175 Difference]: Start difference. First operand has 347 places, 351 transitions, 712 flow. Second operand 3 states and 1107 transitions. [2025-02-08 05:37:37,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 350 transitions, 738 flow [2025-02-08 05:37:37,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 350 transitions, 734 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:37,972 INFO L231 Difference]: Finished difference. Result has 346 places, 350 transitions, 710 flow [2025-02-08 05:37:37,973 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=706, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=710, PETRI_PLACES=346, PETRI_TRANSITIONS=350} [2025-02-08 05:37:37,973 INFO L279 CegarLoopForPetriNet]: 358 programPoint places, -12 predicate places. [2025-02-08 05:37:37,973 INFO L471 AbstractCegarLoop]: Abstraction has has 346 places, 350 transitions, 710 flow [2025-02-08 05:37:37,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:37,977 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:37,977 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] [2025-02-08 05:37:37,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:37:37,977 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:37,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:37,978 INFO L85 PathProgramCache]: Analyzing trace with hash -403040238, now seen corresponding path program 1 times [2025-02-08 05:37:37,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:37,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217561497] [2025-02-08 05:37:37,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:37,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:37,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 05:37:38,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 05:37:38,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:38,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:38,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:38,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:38,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217561497] [2025-02-08 05:37:38,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217561497] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:38,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:38,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:38,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126298712] [2025-02-08 05:37:38,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:38,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:38,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:38,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:38,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:38,071 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 363 out of 388 [2025-02-08 05:37:38,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 350 transitions, 710 flow. Second operand has 3 states, 3 states have (on average 364.3333333333333) internal successors, (1093), 3 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:38,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:38,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 363 of 388 [2025-02-08 05:37:38,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:38,141 INFO L124 PetriNetUnfolderBase]: 36/531 cut-off events. [2025-02-08 05:37:38,141 INFO L125 PetriNetUnfolderBase]: For 9/13 co-relation queries the response was YES. [2025-02-08 05:37:38,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 592 conditions, 531 events. 36/531 cut-off events. For 9/13 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2482 event pairs, 20 based on Foata normal form. 0/451 useless extension candidates. Maximal degree in co-relation 499. Up to 50 conditions per place. [2025-02-08 05:37:38,148 INFO L140 encePairwiseOnDemand]: 385/388 looper letters, 13 selfloop transitions, 2 changer transitions 0/349 dead transitions. [2025-02-08 05:37:38,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 349 transitions, 738 flow [2025-02-08 05:37:38,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:38,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:38,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1105 transitions. [2025-02-08 05:37:38,151 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9493127147766323 [2025-02-08 05:37:38,151 INFO L175 Difference]: Start difference. First operand has 346 places, 350 transitions, 710 flow. Second operand 3 states and 1105 transitions. [2025-02-08 05:37:38,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 349 transitions, 738 flow [2025-02-08 05:37:38,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 349 transitions, 734 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:38,156 INFO L231 Difference]: Finished difference. Result has 345 places, 349 transitions, 708 flow [2025-02-08 05:37:38,157 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=708, PETRI_PLACES=345, PETRI_TRANSITIONS=349} [2025-02-08 05:37:38,157 INFO L279 CegarLoopForPetriNet]: 358 programPoint places, -13 predicate places. [2025-02-08 05:37:38,157 INFO L471 AbstractCegarLoop]: Abstraction has has 345 places, 349 transitions, 708 flow [2025-02-08 05:37:38,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 364.3333333333333) internal successors, (1093), 3 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:38,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:38,158 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] [2025-02-08 05:37:38,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:37:38,158 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:38,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:38,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1597040894, now seen corresponding path program 1 times [2025-02-08 05:37:38,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:38,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913962677] [2025-02-08 05:37:38,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:38,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:38,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-08 05:37:38,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-08 05:37:38,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:38,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:38,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:38,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:38,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913962677] [2025-02-08 05:37:38,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913962677] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:38,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:38,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:38,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535148968] [2025-02-08 05:37:38,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:38,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:38,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:38,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:38,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:38,228 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 388 [2025-02-08 05:37:38,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 349 transitions, 708 flow. Second operand has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:38,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:38,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 388 [2025-02-08 05:37:38,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:38,316 INFO L124 PetriNetUnfolderBase]: 43/866 cut-off events. [2025-02-08 05:37:38,316 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:37:38,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 913 conditions, 866 events. 43/866 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 5134 event pairs, 8 based on Foata normal form. 0/717 useless extension candidates. Maximal degree in co-relation 812. Up to 31 conditions per place. [2025-02-08 05:37:38,323 INFO L140 encePairwiseOnDemand]: 384/388 looper letters, 13 selfloop transitions, 2 changer transitions 0/351 dead transitions. [2025-02-08 05:37:38,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 351 transitions, 744 flow [2025-02-08 05:37:38,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:38,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:38,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1118 transitions. [2025-02-08 05:37:38,325 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9604810996563574 [2025-02-08 05:37:38,325 INFO L175 Difference]: Start difference. First operand has 345 places, 349 transitions, 708 flow. Second operand 3 states and 1118 transitions. [2025-02-08 05:37:38,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 351 transitions, 744 flow [2025-02-08 05:37:38,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 351 transitions, 740 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:38,329 INFO L231 Difference]: Finished difference. Result has 344 places, 349 transitions, 714 flow [2025-02-08 05:37:38,330 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=714, PETRI_PLACES=344, PETRI_TRANSITIONS=349} [2025-02-08 05:37:38,330 INFO L279 CegarLoopForPetriNet]: 358 programPoint places, -14 predicate places. [2025-02-08 05:37:38,330 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 349 transitions, 714 flow [2025-02-08 05:37:38,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:38,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:38,331 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] [2025-02-08 05:37:38,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:37:38,331 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:38,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:38,332 INFO L85 PathProgramCache]: Analyzing trace with hash -2091777636, now seen corresponding path program 1 times [2025-02-08 05:37:38,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:38,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555053497] [2025-02-08 05:37:38,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:38,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:38,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-08 05:37:38,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-08 05:37:38,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:38,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:38,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:38,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:38,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555053497] [2025-02-08 05:37:38,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555053497] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:38,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:38,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:38,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913316356] [2025-02-08 05:37:38,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:38,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:38,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:38,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:38,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:38,377 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 388 [2025-02-08 05:37:38,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 349 transitions, 714 flow. Second operand has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:38,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:38,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 388 [2025-02-08 05:37:38,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:38,503 INFO L124 PetriNetUnfolderBase]: 86/1292 cut-off events. [2025-02-08 05:37:38,503 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:37:38,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1399 conditions, 1292 events. 86/1292 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 9614 event pairs, 10 based on Foata normal form. 0/1067 useless extension candidates. Maximal degree in co-relation 1215. Up to 73 conditions per place. [2025-02-08 05:37:38,516 INFO L140 encePairwiseOnDemand]: 382/388 looper letters, 15 selfloop transitions, 3 changer transitions 0/351 dead transitions. [2025-02-08 05:37:38,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 351 transitions, 756 flow [2025-02-08 05:37:38,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:38,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:38,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1113 transitions. [2025-02-08 05:37:38,519 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9561855670103093 [2025-02-08 05:37:38,519 INFO L175 Difference]: Start difference. First operand has 344 places, 349 transitions, 714 flow. Second operand 3 states and 1113 transitions. [2025-02-08 05:37:38,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 351 transitions, 756 flow [2025-02-08 05:37:38,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 351 transitions, 756 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:38,524 INFO L231 Difference]: Finished difference. Result has 344 places, 349 transitions, 729 flow [2025-02-08 05:37:38,524 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=708, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=729, PETRI_PLACES=344, PETRI_TRANSITIONS=349} [2025-02-08 05:37:38,525 INFO L279 CegarLoopForPetriNet]: 358 programPoint places, -14 predicate places. [2025-02-08 05:37:38,525 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 349 transitions, 729 flow [2025-02-08 05:37:38,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:38,526 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:38,526 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:38,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:37:38,526 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:38,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:38,526 INFO L85 PathProgramCache]: Analyzing trace with hash -466289717, now seen corresponding path program 1 times [2025-02-08 05:37:38,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:38,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581200995] [2025-02-08 05:37:38,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:38,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:38,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-08 05:37:38,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-08 05:37:38,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:38,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:38,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:38,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:38,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581200995] [2025-02-08 05:37:38,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581200995] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:38,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:38,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:38,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943028281] [2025-02-08 05:37:38,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:38,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:38,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:38,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:38,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:38,590 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 388 [2025-02-08 05:37:38,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 349 transitions, 729 flow. Second operand has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:38,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:38,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 388 [2025-02-08 05:37:38,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:38,696 INFO L124 PetriNetUnfolderBase]: 44/1023 cut-off events. [2025-02-08 05:37:38,697 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2025-02-08 05:37:38,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1095 conditions, 1023 events. 44/1023 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 6482 event pairs, 2 based on Foata normal form. 0/868 useless extension candidates. Maximal degree in co-relation 895. Up to 38 conditions per place. [2025-02-08 05:37:38,708 INFO L140 encePairwiseOnDemand]: 384/388 looper letters, 16 selfloop transitions, 2 changer transitions 0/354 dead transitions. [2025-02-08 05:37:38,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 354 transitions, 780 flow [2025-02-08 05:37:38,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:38,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:38,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1121 transitions. [2025-02-08 05:37:38,711 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9630584192439863 [2025-02-08 05:37:38,711 INFO L175 Difference]: Start difference. First operand has 344 places, 349 transitions, 729 flow. Second operand 3 states and 1121 transitions. [2025-02-08 05:37:38,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 354 transitions, 780 flow [2025-02-08 05:37:38,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 354 transitions, 780 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:38,714 INFO L231 Difference]: Finished difference. Result has 345 places, 349 transitions, 739 flow [2025-02-08 05:37:38,715 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=725, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=739, PETRI_PLACES=345, PETRI_TRANSITIONS=349} [2025-02-08 05:37:38,715 INFO L279 CegarLoopForPetriNet]: 358 programPoint places, -13 predicate places. [2025-02-08 05:37:38,715 INFO L471 AbstractCegarLoop]: Abstraction has has 345 places, 349 transitions, 739 flow [2025-02-08 05:37:38,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:38,716 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:38,716 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] [2025-02-08 05:37:38,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:37:38,716 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:38,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:38,717 INFO L85 PathProgramCache]: Analyzing trace with hash 177692142, now seen corresponding path program 1 times [2025-02-08 05:37:38,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:38,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936193790] [2025-02-08 05:37:38,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:38,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:38,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-08 05:37:38,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-08 05:37:38,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:38,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:38,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:38,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:38,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936193790] [2025-02-08 05:37:38,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936193790] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:38,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:38,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:38,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403530929] [2025-02-08 05:37:38,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:38,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:38,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:38,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:38,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:38,785 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 388 [2025-02-08 05:37:38,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 349 transitions, 739 flow. Second operand has 3 states, 3 states have (on average 369.3333333333333) internal successors, (1108), 3 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:38,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:38,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 388 [2025-02-08 05:37:38,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:38,981 INFO L124 PetriNetUnfolderBase]: 49/990 cut-off events. [2025-02-08 05:37:38,984 INFO L125 PetriNetUnfolderBase]: For 4/20 co-relation queries the response was YES. [2025-02-08 05:37:38,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1096 conditions, 990 events. 49/990 cut-off events. For 4/20 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 6559 event pairs, 8 based on Foata normal form. 2/845 useless extension candidates. Maximal degree in co-relation 896. Up to 32 conditions per place. [2025-02-08 05:37:38,999 INFO L140 encePairwiseOnDemand]: 385/388 looper letters, 11 selfloop transitions, 2 changer transitions 0/350 dead transitions. [2025-02-08 05:37:38,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 350 transitions, 769 flow [2025-02-08 05:37:39,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:39,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:39,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1118 transitions. [2025-02-08 05:37:39,005 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9604810996563574 [2025-02-08 05:37:39,005 INFO L175 Difference]: Start difference. First operand has 345 places, 349 transitions, 739 flow. Second operand 3 states and 1118 transitions. [2025-02-08 05:37:39,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 350 transitions, 769 flow [2025-02-08 05:37:39,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 350 transitions, 769 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:39,008 INFO L231 Difference]: Finished difference. Result has 346 places, 348 transitions, 741 flow [2025-02-08 05:37:39,010 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=737, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=741, PETRI_PLACES=346, PETRI_TRANSITIONS=348} [2025-02-08 05:37:39,013 INFO L279 CegarLoopForPetriNet]: 358 programPoint places, -12 predicate places. [2025-02-08 05:37:39,013 INFO L471 AbstractCegarLoop]: Abstraction has has 346 places, 348 transitions, 741 flow [2025-02-08 05:37:39,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 369.3333333333333) internal successors, (1108), 3 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:39,014 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:39,014 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] [2025-02-08 05:37:39,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:37:39,014 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:39,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:39,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1311947225, now seen corresponding path program 1 times [2025-02-08 05:37:39,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:39,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245214558] [2025-02-08 05:37:39,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:39,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:39,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-08 05:37:39,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-08 05:37:39,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:39,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:39,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:39,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:39,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245214558] [2025-02-08 05:37:39,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245214558] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:39,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:39,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:39,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345578456] [2025-02-08 05:37:39,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:39,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:39,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:39,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:39,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:39,059 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 388 [2025-02-08 05:37:39,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 348 transitions, 741 flow. Second operand has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:39,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:39,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 388 [2025-02-08 05:37:39,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:39,237 INFO L124 PetriNetUnfolderBase]: 82/1655 cut-off events. [2025-02-08 05:37:39,238 INFO L125 PetriNetUnfolderBase]: For 8/11 co-relation queries the response was YES. [2025-02-08 05:37:39,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1822 conditions, 1655 events. 82/1655 cut-off events. For 8/11 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 13544 event pairs, 10 based on Foata normal form. 1/1411 useless extension candidates. Maximal degree in co-relation 1620. Up to 94 conditions per place. [2025-02-08 05:37:39,250 INFO L140 encePairwiseOnDemand]: 382/388 looper letters, 18 selfloop transitions, 3 changer transitions 0/353 dead transitions. [2025-02-08 05:37:39,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 353 transitions, 798 flow [2025-02-08 05:37:39,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:39,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:39,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1116 transitions. [2025-02-08 05:37:39,253 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9587628865979382 [2025-02-08 05:37:39,253 INFO L175 Difference]: Start difference. First operand has 346 places, 348 transitions, 741 flow. Second operand 3 states and 1116 transitions. [2025-02-08 05:37:39,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 353 transitions, 798 flow [2025-02-08 05:37:39,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 353 transitions, 794 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:39,257 INFO L231 Difference]: Finished difference. Result has 344 places, 348 transitions, 752 flow [2025-02-08 05:37:39,258 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=731, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=342, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=752, PETRI_PLACES=344, PETRI_TRANSITIONS=348} [2025-02-08 05:37:39,258 INFO L279 CegarLoopForPetriNet]: 358 programPoint places, -14 predicate places. [2025-02-08 05:37:39,258 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 348 transitions, 752 flow [2025-02-08 05:37:39,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:39,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:39,259 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] [2025-02-08 05:37:39,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:37:39,259 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:39,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:39,260 INFO L85 PathProgramCache]: Analyzing trace with hash 747267963, now seen corresponding path program 1 times [2025-02-08 05:37:39,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:39,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404450885] [2025-02-08 05:37:39,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:39,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:39,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-08 05:37:39,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-08 05:37:39,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:39,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:39,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:39,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:39,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404450885] [2025-02-08 05:37:39,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404450885] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:39,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:39,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:39,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688647375] [2025-02-08 05:37:39,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:39,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:39,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:39,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:39,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:39,309 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 388 [2025-02-08 05:37:39,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 348 transitions, 752 flow. Second operand has 3 states, 3 states have (on average 362.6666666666667) internal successors, (1088), 3 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:39,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:39,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 388 [2025-02-08 05:37:39,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:39,946 INFO L124 PetriNetUnfolderBase]: 304/4672 cut-off events. [2025-02-08 05:37:39,949 INFO L125 PetriNetUnfolderBase]: For 69/81 co-relation queries the response was YES. [2025-02-08 05:37:39,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5165 conditions, 4672 events. 304/4672 cut-off events. For 69/81 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 52777 event pairs, 100 based on Foata normal form. 0/3974 useless extension candidates. Maximal degree in co-relation 4441. Up to 331 conditions per place. [2025-02-08 05:37:39,992 INFO L140 encePairwiseOnDemand]: 380/388 looper letters, 17 selfloop transitions, 4 changer transitions 0/350 dead transitions. [2025-02-08 05:37:39,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 350 transitions, 800 flow [2025-02-08 05:37:39,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:39,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:39,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1108 transitions. [2025-02-08 05:37:39,994 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9518900343642611 [2025-02-08 05:37:39,994 INFO L175 Difference]: Start difference. First operand has 344 places, 348 transitions, 752 flow. Second operand 3 states and 1108 transitions. [2025-02-08 05:37:39,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 350 transitions, 800 flow [2025-02-08 05:37:39,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 350 transitions, 800 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:39,998 INFO L231 Difference]: Finished difference. Result has 343 places, 348 transitions, 772 flow [2025-02-08 05:37:39,999 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=772, PETRI_PLACES=343, PETRI_TRANSITIONS=348} [2025-02-08 05:37:39,999 INFO L279 CegarLoopForPetriNet]: 358 programPoint places, -15 predicate places. [2025-02-08 05:37:39,999 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 348 transitions, 772 flow [2025-02-08 05:37:40,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.6666666666667) internal successors, (1088), 3 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:40,000 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:40,000 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-02-08 05:37:40,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:37:40,000 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:40,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:40,001 INFO L85 PathProgramCache]: Analyzing trace with hash -16596809, now seen corresponding path program 1 times [2025-02-08 05:37:40,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:40,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741809231] [2025-02-08 05:37:40,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:40,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:40,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-08 05:37:40,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-08 05:37:40,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:40,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:40,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:40,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:40,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741809231] [2025-02-08 05:37:40,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741809231] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:40,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:40,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:40,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632990203] [2025-02-08 05:37:40,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:40,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:40,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:40,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:40,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:40,072 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 388 [2025-02-08 05:37:40,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 348 transitions, 772 flow. Second operand has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:40,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:40,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 388 [2025-02-08 05:37:40,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:40,481 INFO L124 PetriNetUnfolderBase]: 101/2092 cut-off events. [2025-02-08 05:37:40,484 INFO L125 PetriNetUnfolderBase]: For 24/36 co-relation queries the response was YES. [2025-02-08 05:37:40,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2329 conditions, 2092 events. 101/2092 cut-off events. For 24/36 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 18236 event pairs, 6 based on Foata normal form. 2/1804 useless extension candidates. Maximal degree in co-relation 1949. Up to 97 conditions per place. [2025-02-08 05:37:40,521 INFO L140 encePairwiseOnDemand]: 384/388 looper letters, 15 selfloop transitions, 2 changer transitions 0/352 dead transitions. [2025-02-08 05:37:40,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 352 transitions, 818 flow [2025-02-08 05:37:40,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:40,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:40,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1120 transitions. [2025-02-08 05:37:40,524 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9621993127147767 [2025-02-08 05:37:40,524 INFO L175 Difference]: Start difference. First operand has 343 places, 348 transitions, 772 flow. Second operand 3 states and 1120 transitions. [2025-02-08 05:37:40,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 352 transitions, 818 flow [2025-02-08 05:37:40,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 352 transitions, 818 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:40,531 INFO L231 Difference]: Finished difference. Result has 344 places, 348 transitions, 782 flow [2025-02-08 05:37:40,532 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=782, PETRI_PLACES=344, PETRI_TRANSITIONS=348} [2025-02-08 05:37:40,532 INFO L279 CegarLoopForPetriNet]: 358 programPoint places, -14 predicate places. [2025-02-08 05:37:40,532 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 348 transitions, 782 flow [2025-02-08 05:37:40,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:40,536 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:40,537 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] [2025-02-08 05:37:40,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:37:40,537 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:40,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:40,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1230361497, now seen corresponding path program 1 times [2025-02-08 05:37:40,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:40,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926142726] [2025-02-08 05:37:40,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:40,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:40,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-08 05:37:40,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-08 05:37:40,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:40,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:40,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:40,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:40,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926142726] [2025-02-08 05:37:40,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926142726] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:40,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:40,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:40,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832103901] [2025-02-08 05:37:40,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:40,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:40,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:40,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:40,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:40,615 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 388 [2025-02-08 05:37:40,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 348 transitions, 782 flow. Second operand has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:40,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:40,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 388 [2025-02-08 05:37:40,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:40,870 INFO L124 PetriNetUnfolderBase]: 97/2047 cut-off events. [2025-02-08 05:37:40,871 INFO L125 PetriNetUnfolderBase]: For 8/16 co-relation queries the response was YES. [2025-02-08 05:37:40,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2304 conditions, 2047 events. 97/2047 cut-off events. For 8/16 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 18419 event pairs, 4 based on Foata normal form. 0/1769 useless extension candidates. Maximal degree in co-relation 1923. Up to 68 conditions per place. [2025-02-08 05:37:40,885 INFO L140 encePairwiseOnDemand]: 384/388 looper letters, 14 selfloop transitions, 2 changer transitions 0/351 dead transitions. [2025-02-08 05:37:40,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 351 transitions, 823 flow [2025-02-08 05:37:40,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:40,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:40,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1119 transitions. [2025-02-08 05:37:40,887 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.961340206185567 [2025-02-08 05:37:40,888 INFO L175 Difference]: Start difference. First operand has 344 places, 348 transitions, 782 flow. Second operand 3 states and 1119 transitions. [2025-02-08 05:37:40,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 351 transitions, 823 flow [2025-02-08 05:37:40,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 351 transitions, 823 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:40,891 INFO L231 Difference]: Finished difference. Result has 345 places, 348 transitions, 792 flow [2025-02-08 05:37:40,891 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=792, PETRI_PLACES=345, PETRI_TRANSITIONS=348} [2025-02-08 05:37:40,892 INFO L279 CegarLoopForPetriNet]: 358 programPoint places, -13 predicate places. [2025-02-08 05:37:40,892 INFO L471 AbstractCegarLoop]: Abstraction has has 345 places, 348 transitions, 792 flow [2025-02-08 05:37:40,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:40,893 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:40,893 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] [2025-02-08 05:37:40,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:37:40,893 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:40,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:40,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1050863866, now seen corresponding path program 1 times [2025-02-08 05:37:40,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:40,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242220612] [2025-02-08 05:37:40,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:40,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:40,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-08 05:37:40,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-08 05:37:40,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:40,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:40,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:40,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:40,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242220612] [2025-02-08 05:37:40,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242220612] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:40,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:40,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:40,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962148809] [2025-02-08 05:37:40,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:40,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:40,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:40,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:40,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:40,932 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 388 [2025-02-08 05:37:40,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 348 transitions, 792 flow. Second operand has 3 states, 3 states have (on average 369.6666666666667) internal successors, (1109), 3 states have internal predecessors, (1109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:40,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:40,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 388 [2025-02-08 05:37:40,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:41,226 INFO L124 PetriNetUnfolderBase]: 147/2793 cut-off events. [2025-02-08 05:37:41,227 INFO L125 PetriNetUnfolderBase]: For 21/30 co-relation queries the response was YES. [2025-02-08 05:37:41,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3222 conditions, 2793 events. 147/2793 cut-off events. For 21/30 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 27684 event pairs, 22 based on Foata normal form. 1/2435 useless extension candidates. Maximal degree in co-relation 3026. Up to 82 conditions per place. [2025-02-08 05:37:41,245 INFO L140 encePairwiseOnDemand]: 385/388 looper letters, 11 selfloop transitions, 2 changer transitions 0/349 dead transitions. [2025-02-08 05:37:41,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 349 transitions, 822 flow [2025-02-08 05:37:41,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:41,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:41,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1118 transitions. [2025-02-08 05:37:41,248 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9604810996563574 [2025-02-08 05:37:41,248 INFO L175 Difference]: Start difference. First operand has 345 places, 348 transitions, 792 flow. Second operand 3 states and 1118 transitions. [2025-02-08 05:37:41,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 349 transitions, 822 flow [2025-02-08 05:37:41,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 349 transitions, 822 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:41,252 INFO L231 Difference]: Finished difference. Result has 346 places, 347 transitions, 794 flow [2025-02-08 05:37:41,252 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=794, PETRI_PLACES=346, PETRI_TRANSITIONS=347} [2025-02-08 05:37:41,253 INFO L279 CegarLoopForPetriNet]: 358 programPoint places, -12 predicate places. [2025-02-08 05:37:41,253 INFO L471 AbstractCegarLoop]: Abstraction has has 346 places, 347 transitions, 794 flow [2025-02-08 05:37:41,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 369.6666666666667) internal successors, (1109), 3 states have internal predecessors, (1109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:41,253 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:41,254 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] [2025-02-08 05:37:41,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:37:41,254 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:41,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:41,254 INFO L85 PathProgramCache]: Analyzing trace with hash -13427482, now seen corresponding path program 1 times [2025-02-08 05:37:41,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:41,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147272947] [2025-02-08 05:37:41,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:41,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:41,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-08 05:37:41,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-08 05:37:41,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:41,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:41,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:41,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:41,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147272947] [2025-02-08 05:37:41,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147272947] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:41,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:41,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:41,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221615521] [2025-02-08 05:37:41,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:41,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:41,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:41,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:41,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:41,305 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 388 [2025-02-08 05:37:41,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 347 transitions, 794 flow. Second operand has 3 states, 3 states have (on average 362.6666666666667) internal successors, (1088), 3 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:41,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:41,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 388 [2025-02-08 05:37:41,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:41,884 INFO L124 PetriNetUnfolderBase]: 381/5080 cut-off events. [2025-02-08 05:37:41,885 INFO L125 PetriNetUnfolderBase]: For 82/86 co-relation queries the response was YES. [2025-02-08 05:37:41,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5993 conditions, 5080 events. 381/5080 cut-off events. For 82/86 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 58281 event pairs, 64 based on Foata normal form. 0/4499 useless extension candidates. Maximal degree in co-relation 5379. Up to 510 conditions per place. [2025-02-08 05:37:41,925 INFO L140 encePairwiseOnDemand]: 380/388 looper letters, 19 selfloop transitions, 4 changer transitions 0/351 dead transitions. [2025-02-08 05:37:41,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 351 transitions, 852 flow [2025-02-08 05:37:41,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:41,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:41,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1110 transitions. [2025-02-08 05:37:41,928 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9536082474226805 [2025-02-08 05:37:41,928 INFO L175 Difference]: Start difference. First operand has 346 places, 347 transitions, 794 flow. Second operand 3 states and 1110 transitions. [2025-02-08 05:37:41,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 351 transitions, 852 flow [2025-02-08 05:37:41,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 351 transitions, 848 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:41,946 INFO L231 Difference]: Finished difference. Result has 343 places, 347 transitions, 810 flow [2025-02-08 05:37:41,947 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=810, PETRI_PLACES=343, PETRI_TRANSITIONS=347} [2025-02-08 05:37:41,947 INFO L279 CegarLoopForPetriNet]: 358 programPoint places, -15 predicate places. [2025-02-08 05:37:41,947 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 347 transitions, 810 flow [2025-02-08 05:37:41,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.6666666666667) internal successors, (1088), 3 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:41,948 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:41,948 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:41,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:37:41,948 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:41,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:41,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1631781638, now seen corresponding path program 1 times [2025-02-08 05:37:41,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:41,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932573942] [2025-02-08 05:37:41,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:41,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:41,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-08 05:37:41,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-08 05:37:41,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:41,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:41,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:41,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:41,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932573942] [2025-02-08 05:37:41,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932573942] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:41,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:41,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:41,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385569427] [2025-02-08 05:37:41,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:41,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:41,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:41,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:41,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:42,004 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 388 [2025-02-08 05:37:42,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 347 transitions, 810 flow. Second operand has 3 states, 3 states have (on average 370.0) internal successors, (1110), 3 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:42,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:42,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 388 [2025-02-08 05:37:42,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:42,261 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([956] L56-8-->L56-7: Formula: true InVars {} OutVars{thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet18#1][226], [437#true, Black: 414#true, 201#L80true, 433#true, Black: 418#true, Black: 425#true, Black: 429#true, 427#(= |#race~filename_5~0| 0), 420#(= |#race~filename_2~0| 0), 431#(= |#race~isNull_6~0| 0), 412#(= |#race~isNull_0~0| 0), 21#L56-7true, 448#true, 416#(= |#race~isNull_3~0| 0), Black: 410#true, 446#(= |#race~filename_8~0| 0), Black: 444#true]) [2025-02-08 05:37:42,261 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is not cut-off event [2025-02-08 05:37:42,261 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is not cut-off event [2025-02-08 05:37:42,261 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is not cut-off event [2025-02-08 05:37:42,262 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is not cut-off event [2025-02-08 05:37:42,267 INFO L124 PetriNetUnfolderBase]: 207/2684 cut-off events. [2025-02-08 05:37:42,267 INFO L125 PetriNetUnfolderBase]: For 94/109 co-relation queries the response was YES. [2025-02-08 05:37:42,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3355 conditions, 2684 events. 207/2684 cut-off events. For 94/109 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 26604 event pairs, 38 based on Foata normal form. 2/2414 useless extension candidates. Maximal degree in co-relation 3158. Up to 183 conditions per place. [2025-02-08 05:37:42,287 INFO L140 encePairwiseOnDemand]: 385/388 looper letters, 11 selfloop transitions, 2 changer transitions 0/348 dead transitions. [2025-02-08 05:37:42,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 348 transitions, 840 flow [2025-02-08 05:37:42,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:42,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:42,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1118 transitions. [2025-02-08 05:37:42,289 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9604810996563574 [2025-02-08 05:37:42,289 INFO L175 Difference]: Start difference. First operand has 343 places, 347 transitions, 810 flow. Second operand 3 states and 1118 transitions. [2025-02-08 05:37:42,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 348 transitions, 840 flow [2025-02-08 05:37:42,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 348 transitions, 840 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:42,293 INFO L231 Difference]: Finished difference. Result has 344 places, 346 transitions, 812 flow [2025-02-08 05:37:42,294 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=812, PETRI_PLACES=344, PETRI_TRANSITIONS=346} [2025-02-08 05:37:42,294 INFO L279 CegarLoopForPetriNet]: 358 programPoint places, -14 predicate places. [2025-02-08 05:37:42,294 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 346 transitions, 812 flow [2025-02-08 05:37:42,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.0) internal successors, (1110), 3 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:42,295 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:42,295 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:42,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 05:37:42,295 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:42,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:42,295 INFO L85 PathProgramCache]: Analyzing trace with hash 173504965, now seen corresponding path program 1 times [2025-02-08 05:37:42,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:42,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237745975] [2025-02-08 05:37:42,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:42,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:42,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-08 05:37:42,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-08 05:37:42,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:42,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:42,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:42,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:42,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237745975] [2025-02-08 05:37:42,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237745975] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:42,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:42,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:42,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955641620] [2025-02-08 05:37:42,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:42,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:42,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:42,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:42,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:42,333 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 388 [2025-02-08 05:37:42,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 346 transitions, 812 flow. Second operand has 3 states, 3 states have (on average 368.6666666666667) internal successors, (1106), 3 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:42,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:42,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 388 [2025-02-08 05:37:42,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:42,641 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1019] thread3EXIT-->L82-17: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][333], [437#true, Black: 414#true, 433#true, 451#true, 323#L82-17true, Black: 418#true, Black: 425#true, Black: 429#true, 427#(= |#race~filename_5~0| 0), 420#(= |#race~filename_2~0| 0), 431#(= |#race~isNull_6~0| 0), 412#(= |#race~isNull_0~0| 0), 448#true, 416#(= |#race~isNull_3~0| 0), Black: 410#true, 446#(= |#race~filename_8~0| 0), Black: 444#true]) [2025-02-08 05:37:42,642 INFO L294 olderBase$Statistics]: this new event has 189 ancestors and is not cut-off event [2025-02-08 05:37:42,642 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is not cut-off event [2025-02-08 05:37:42,642 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is not cut-off event [2025-02-08 05:37:42,642 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is not cut-off event [2025-02-08 05:37:42,643 INFO L124 PetriNetUnfolderBase]: 209/3479 cut-off events. [2025-02-08 05:37:42,643 INFO L125 PetriNetUnfolderBase]: For 42/50 co-relation queries the response was YES. [2025-02-08 05:37:42,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4163 conditions, 3479 events. 209/3479 cut-off events. For 42/50 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 35351 event pairs, 20 based on Foata normal form. 0/3140 useless extension candidates. Maximal degree in co-relation 3622. Up to 248 conditions per place. [2025-02-08 05:37:42,671 INFO L140 encePairwiseOnDemand]: 384/388 looper letters, 13 selfloop transitions, 2 changer transitions 1/349 dead transitions. [2025-02-08 05:37:42,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 349 transitions, 853 flow [2025-02-08 05:37:42,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:42,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:42,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1119 transitions. [2025-02-08 05:37:42,673 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.961340206185567 [2025-02-08 05:37:42,673 INFO L175 Difference]: Start difference. First operand has 344 places, 346 transitions, 812 flow. Second operand 3 states and 1119 transitions. [2025-02-08 05:37:42,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 349 transitions, 853 flow [2025-02-08 05:37:42,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 349 transitions, 849 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:42,678 INFO L231 Difference]: Finished difference. Result has 343 places, 346 transitions, 818 flow [2025-02-08 05:37:42,679 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=342, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=818, PETRI_PLACES=343, PETRI_TRANSITIONS=346} [2025-02-08 05:37:42,679 INFO L279 CegarLoopForPetriNet]: 358 programPoint places, -15 predicate places. [2025-02-08 05:37:42,680 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 346 transitions, 818 flow [2025-02-08 05:37:42,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.6666666666667) internal successors, (1106), 3 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:42,680 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:42,680 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] [2025-02-08 05:37:42,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 05:37:42,681 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:42,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:42,682 INFO L85 PathProgramCache]: Analyzing trace with hash -2037124394, now seen corresponding path program 1 times [2025-02-08 05:37:42,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:42,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267678406] [2025-02-08 05:37:42,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:42,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:42,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-08 05:37:42,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-08 05:37:42,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:42,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:42,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:42,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:42,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267678406] [2025-02-08 05:37:42,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267678406] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:42,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:42,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:42,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755075532] [2025-02-08 05:37:42,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:42,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:42,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:42,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:42,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:42,743 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 388 [2025-02-08 05:37:42,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 346 transitions, 818 flow. Second operand has 3 states, 3 states have (on average 373.0) internal successors, (1119), 3 states have internal predecessors, (1119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:42,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:42,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 388 [2025-02-08 05:37:42,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:43,008 INFO L124 PetriNetUnfolderBase]: 164/3303 cut-off events. [2025-02-08 05:37:43,008 INFO L125 PetriNetUnfolderBase]: For 8/20 co-relation queries the response was YES. [2025-02-08 05:37:43,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3907 conditions, 3303 events. 164/3303 cut-off events. For 8/20 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 33658 event pairs, 4 based on Foata normal form. 0/3011 useless extension candidates. Maximal degree in co-relation 3397. Up to 124 conditions per place. [2025-02-08 05:37:43,034 INFO L140 encePairwiseOnDemand]: 386/388 looper letters, 8 selfloop transitions, 1 changer transitions 0/345 dead transitions. [2025-02-08 05:37:43,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 345 transitions, 834 flow [2025-02-08 05:37:43,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:43,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:43,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1120 transitions. [2025-02-08 05:37:43,036 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9621993127147767 [2025-02-08 05:37:43,036 INFO L175 Difference]: Start difference. First operand has 343 places, 346 transitions, 818 flow. Second operand 3 states and 1120 transitions. [2025-02-08 05:37:43,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 345 transitions, 834 flow [2025-02-08 05:37:43,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 345 transitions, 834 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:43,040 INFO L231 Difference]: Finished difference. Result has 344 places, 345 transitions, 818 flow [2025-02-08 05:37:43,041 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=816, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=818, PETRI_PLACES=344, PETRI_TRANSITIONS=345} [2025-02-08 05:37:43,041 INFO L279 CegarLoopForPetriNet]: 358 programPoint places, -14 predicate places. [2025-02-08 05:37:43,041 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 345 transitions, 818 flow [2025-02-08 05:37:43,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.0) internal successors, (1119), 3 states have internal predecessors, (1119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:43,042 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:43,042 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-02-08 05:37:43,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 05:37:43,042 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:43,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:43,043 INFO L85 PathProgramCache]: Analyzing trace with hash -684151820, now seen corresponding path program 1 times [2025-02-08 05:37:43,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:43,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852748257] [2025-02-08 05:37:43,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:43,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:43,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-08 05:37:43,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-08 05:37:43,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:43,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:43,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:43,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:43,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852748257] [2025-02-08 05:37:43,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852748257] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:43,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:43,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:43,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701359010] [2025-02-08 05:37:43,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:43,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:43,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:43,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:43,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:43,101 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 388 [2025-02-08 05:37:43,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 345 transitions, 818 flow. Second operand has 3 states, 3 states have (on average 373.0) internal successors, (1119), 3 states have internal predecessors, (1119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:43,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:43,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 388 [2025-02-08 05:37:43,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:43,380 INFO L124 PetriNetUnfolderBase]: 159/3478 cut-off events. [2025-02-08 05:37:43,381 INFO L125 PetriNetUnfolderBase]: For 8/18 co-relation queries the response was YES. [2025-02-08 05:37:43,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4120 conditions, 3478 events. 159/3478 cut-off events. For 8/18 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 36078 event pairs, 12 based on Foata normal form. 0/3174 useless extension candidates. Maximal degree in co-relation 4013. Up to 116 conditions per place. [2025-02-08 05:37:43,407 INFO L140 encePairwiseOnDemand]: 386/388 looper letters, 8 selfloop transitions, 1 changer transitions 0/344 dead transitions. [2025-02-08 05:37:43,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 344 transitions, 834 flow [2025-02-08 05:37:43,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:43,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:43,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1120 transitions. [2025-02-08 05:37:43,410 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9621993127147767 [2025-02-08 05:37:43,410 INFO L175 Difference]: Start difference. First operand has 344 places, 345 transitions, 818 flow. Second operand 3 states and 1120 transitions. [2025-02-08 05:37:43,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 344 transitions, 834 flow [2025-02-08 05:37:43,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 344 transitions, 833 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:43,414 INFO L231 Difference]: Finished difference. Result has 344 places, 344 transitions, 817 flow [2025-02-08 05:37:43,415 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=815, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=817, PETRI_PLACES=344, PETRI_TRANSITIONS=344} [2025-02-08 05:37:43,415 INFO L279 CegarLoopForPetriNet]: 358 programPoint places, -14 predicate places. [2025-02-08 05:37:43,416 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 344 transitions, 817 flow [2025-02-08 05:37:43,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.0) internal successors, (1119), 3 states have internal predecessors, (1119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:43,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:43,416 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] [2025-02-08 05:37:43,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 05:37:43,417 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:43,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:43,417 INFO L85 PathProgramCache]: Analyzing trace with hash -461517018, now seen corresponding path program 1 times [2025-02-08 05:37:43,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:43,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11143799] [2025-02-08 05:37:43,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:43,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:43,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-02-08 05:37:43,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-02-08 05:37:43,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:43,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:43,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:43,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:43,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11143799] [2025-02-08 05:37:43,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11143799] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:43,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:43,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:43,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066313837] [2025-02-08 05:37:43,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:43,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:43,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:43,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:43,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:43,493 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 388 [2025-02-08 05:37:43,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 344 transitions, 817 flow. Second operand has 3 states, 3 states have (on average 373.0) internal successors, (1119), 3 states have internal predecessors, (1119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:43,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:43,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 388 [2025-02-08 05:37:43,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:43,676 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([960] L56-7-->L56-5: Formula: (= |v_#race~result_11~0_3| |v_thread3Thread1of1ForFork2_#t~nondet18#1_3|) InVars {thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_3|, thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][234], [437#true, Black: 414#true, 201#L80true, 433#true, 451#true, Black: 418#true, 266#L56-5true, Black: 425#true, Black: 429#true, 461#true, 458#true, 427#(= |#race~filename_5~0| 0), 420#(= |#race~filename_2~0| 0), 431#(= |#race~isNull_6~0| 0), 412#(= |#race~isNull_0~0| 0), 416#(= |#race~isNull_3~0| 0), Black: 410#true, 446#(= |#race~filename_8~0| 0), Black: 444#true]) [2025-02-08 05:37:43,677 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is not cut-off event [2025-02-08 05:37:43,677 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is not cut-off event [2025-02-08 05:37:43,677 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is not cut-off event [2025-02-08 05:37:43,677 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is not cut-off event [2025-02-08 05:37:43,681 INFO L124 PetriNetUnfolderBase]: 142/2634 cut-off events. [2025-02-08 05:37:43,681 INFO L125 PetriNetUnfolderBase]: For 23/33 co-relation queries the response was YES. [2025-02-08 05:37:43,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3179 conditions, 2634 events. 142/2634 cut-off events. For 23/33 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 25108 event pairs, 19 based on Foata normal form. 10/2402 useless extension candidates. Maximal degree in co-relation 3127. Up to 99 conditions per place. [2025-02-08 05:37:43,699 INFO L140 encePairwiseOnDemand]: 386/388 looper letters, 0 selfloop transitions, 0 changer transitions 343/343 dead transitions. [2025-02-08 05:37:43,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 343 transitions, 831 flow [2025-02-08 05:37:43,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:43,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:43,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1119 transitions. [2025-02-08 05:37:43,702 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.961340206185567 [2025-02-08 05:37:43,702 INFO L175 Difference]: Start difference. First operand has 344 places, 344 transitions, 817 flow. Second operand 3 states and 1119 transitions. [2025-02-08 05:37:43,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 343 transitions, 831 flow [2025-02-08 05:37:43,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 343 transitions, 830 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:43,706 INFO L231 Difference]: Finished difference. Result has 344 places, 0 transitions, 0 flow [2025-02-08 05:37:43,706 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=344, PETRI_TRANSITIONS=0} [2025-02-08 05:37:43,706 INFO L279 CegarLoopForPetriNet]: 358 programPoint places, -14 predicate places. [2025-02-08 05:37:43,706 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 0 transitions, 0 flow [2025-02-08 05:37:43,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.0) internal successors, (1119), 3 states have internal predecessors, (1119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:43,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (68 of 69 remaining) [2025-02-08 05:37:43,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (67 of 69 remaining) [2025-02-08 05:37:43,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (66 of 69 remaining) [2025-02-08 05:37:43,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (65 of 69 remaining) [2025-02-08 05:37:43,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (64 of 69 remaining) [2025-02-08 05:37:43,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (63 of 69 remaining) [2025-02-08 05:37:43,710 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (62 of 69 remaining) [2025-02-08 05:37:43,710 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (61 of 69 remaining) [2025-02-08 05:37:43,710 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (60 of 69 remaining) [2025-02-08 05:37:43,710 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (59 of 69 remaining) [2025-02-08 05:37:43,710 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (58 of 69 remaining) [2025-02-08 05:37:43,710 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (57 of 69 remaining) [2025-02-08 05:37:43,710 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (56 of 69 remaining) [2025-02-08 05:37:43,710 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (55 of 69 remaining) [2025-02-08 05:37:43,710 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (54 of 69 remaining) [2025-02-08 05:37:43,710 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (53 of 69 remaining) [2025-02-08 05:37:43,710 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (52 of 69 remaining) [2025-02-08 05:37:43,710 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (51 of 69 remaining) [2025-02-08 05:37:43,710 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (50 of 69 remaining) [2025-02-08 05:37:43,710 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (49 of 69 remaining) [2025-02-08 05:37:43,710 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (48 of 69 remaining) [2025-02-08 05:37:43,711 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (47 of 69 remaining) [2025-02-08 05:37:43,711 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (46 of 69 remaining) [2025-02-08 05:37:43,711 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (45 of 69 remaining) [2025-02-08 05:37:43,711 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (44 of 69 remaining) [2025-02-08 05:37:43,711 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (43 of 69 remaining) [2025-02-08 05:37:43,711 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (42 of 69 remaining) [2025-02-08 05:37:43,711 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (41 of 69 remaining) [2025-02-08 05:37:43,711 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (40 of 69 remaining) [2025-02-08 05:37:43,711 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (39 of 69 remaining) [2025-02-08 05:37:43,711 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (38 of 69 remaining) [2025-02-08 05:37:43,711 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (37 of 69 remaining) [2025-02-08 05:37:43,711 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (36 of 69 remaining) [2025-02-08 05:37:43,711 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (35 of 69 remaining) [2025-02-08 05:37:43,712 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (34 of 69 remaining) [2025-02-08 05:37:43,712 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (33 of 69 remaining) [2025-02-08 05:37:43,712 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (32 of 69 remaining) [2025-02-08 05:37:43,712 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (31 of 69 remaining) [2025-02-08 05:37:43,712 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (30 of 69 remaining) [2025-02-08 05:37:43,712 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 69 remaining) [2025-02-08 05:37:43,712 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 69 remaining) [2025-02-08 05:37:43,712 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 69 remaining) [2025-02-08 05:37:43,712 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (26 of 69 remaining) [2025-02-08 05:37:43,712 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (25 of 69 remaining) [2025-02-08 05:37:43,712 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (24 of 69 remaining) [2025-02-08 05:37:43,712 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (23 of 69 remaining) [2025-02-08 05:37:43,712 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (22 of 69 remaining) [2025-02-08 05:37:43,712 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (21 of 69 remaining) [2025-02-08 05:37:43,713 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (20 of 69 remaining) [2025-02-08 05:37:43,713 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (19 of 69 remaining) [2025-02-08 05:37:43,713 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (18 of 69 remaining) [2025-02-08 05:37:43,713 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (17 of 69 remaining) [2025-02-08 05:37:43,713 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (16 of 69 remaining) [2025-02-08 05:37:43,713 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (15 of 69 remaining) [2025-02-08 05:37:43,713 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (14 of 69 remaining) [2025-02-08 05:37:43,713 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (13 of 69 remaining) [2025-02-08 05:37:43,713 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (12 of 69 remaining) [2025-02-08 05:37:43,713 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (11 of 69 remaining) [2025-02-08 05:37:43,713 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (10 of 69 remaining) [2025-02-08 05:37:43,713 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (9 of 69 remaining) [2025-02-08 05:37:43,713 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (8 of 69 remaining) [2025-02-08 05:37:43,713 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (7 of 69 remaining) [2025-02-08 05:37:43,713 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (6 of 69 remaining) [2025-02-08 05:37:43,714 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (5 of 69 remaining) [2025-02-08 05:37:43,714 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (4 of 69 remaining) [2025-02-08 05:37:43,714 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (3 of 69 remaining) [2025-02-08 05:37:43,714 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (2 of 69 remaining) [2025-02-08 05:37:43,714 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (1 of 69 remaining) [2025-02-08 05:37:43,714 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (0 of 69 remaining) [2025-02-08 05:37:43,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 05:37:43,714 INFO L422 BasicCegarLoop]: Path program 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] [2025-02-08 05:37:43,718 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:37:43,718 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:37:43,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:37:43 BasicIcfg [2025-02-08 05:37:43,722 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:37:43,723 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:37:43,723 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:37:43,723 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:37:43,723 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:35" (3/4) ... [2025-02-08 05:37:43,724 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:37:43,727 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:37:43,727 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:37:43,727 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 05:37:43,730 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-02-08 05:37:43,730 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:37:43,730 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:37:43,731 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:37:43,786 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:37:43,787 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:37:43,787 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:37:43,787 INFO L158 Benchmark]: Toolchain (without parser) took 8834.08ms. Allocated memory was 167.8MB in the beginning and 687.9MB in the end (delta: 520.1MB). Free memory was 122.2MB in the beginning and 464.8MB in the end (delta: -342.6MB). Peak memory consumption was 172.2MB. Max. memory is 16.1GB. [2025-02-08 05:37:43,787 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 201.3MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:37:43,788 INFO L158 Benchmark]: CACSL2BoogieTranslator took 145.04ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 109.9MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:43,788 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.51ms. Allocated memory is still 167.8MB. Free memory was 109.9MB in the beginning and 107.6MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:43,788 INFO L158 Benchmark]: Boogie Preprocessor took 15.11ms. Allocated memory is still 167.8MB. Free memory was 107.6MB in the beginning and 106.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:37:43,788 INFO L158 Benchmark]: IcfgBuilder took 504.03ms. Allocated memory is still 167.8MB. Free memory was 106.3MB in the beginning and 79.6MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 05:37:43,788 INFO L158 Benchmark]: TraceAbstraction took 8075.84ms. Allocated memory was 167.8MB in the beginning and 687.9MB in the end (delta: 520.1MB). Free memory was 79.0MB in the beginning and 473.1MB in the end (delta: -394.2MB). Peak memory consumption was 121.9MB. Max. memory is 16.1GB. [2025-02-08 05:37:43,788 INFO L158 Benchmark]: Witness Printer took 63.90ms. Allocated memory is still 687.9MB. Free memory was 473.1MB in the beginning and 464.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:43,789 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 201.3MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 145.04ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 109.9MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.51ms. Allocated memory is still 167.8MB. Free memory was 109.9MB in the beginning and 107.6MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 15.11ms. Allocated memory is still 167.8MB. Free memory was 107.6MB in the beginning and 106.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 504.03ms. Allocated memory is still 167.8MB. Free memory was 106.3MB in the beginning and 79.6MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8075.84ms. Allocated memory was 167.8MB in the beginning and 687.9MB in the end (delta: 520.1MB). Free memory was 79.0MB in the beginning and 473.1MB in the end (delta: -394.2MB). Peak memory consumption was 121.9MB. Max. memory is 16.1GB. * Witness Printer took 63.90ms. Allocated memory is still 687.9MB. Free memory was 473.1MB in the beginning and 464.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 587 locations, 69 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.9s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 451 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 158 mSDsluCounter, 103 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 644 IncrementalHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 103 mSDtfsCounter, 644 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=818occurred in iteration=21, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 2438 NumberOfCodeBlocks, 2438 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2414 ConstructedInterpolants, 0 QuantifiedInterpolants, 2462 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 39 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:37:43,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE