./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-chromosome-symm.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-chromosome-symm.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 23ca06a4d1d66eab783b29fc3ce31114eee62eb7d17a2452b84e2d73b8d92cfa --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:37:10,871 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:37:10,946 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:10,954 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:37:10,954 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:37:10,981 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:37:10,982 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:37:10,983 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:37:10,983 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:37:10,983 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:37:10,984 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:37:10,984 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:37:10,985 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:37:10,985 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:37:10,985 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:37:10,985 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:37:10,985 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:37:10,986 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:37:10,986 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:37:10,986 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:37:10,986 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:37:10,986 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:37:10,986 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:37:10,986 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:37:10,986 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:37:10,986 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:37:10,986 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:37:10,986 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:37:10,987 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:37:10,987 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:37:10,987 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:37:10,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:37:10,987 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:37:10,988 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:37:10,988 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:37:10,988 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:37:10,988 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:37:10,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:37:10,988 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:37:10,988 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:37:10,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:37:10,989 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:37:10,989 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 -> 23ca06a4d1d66eab783b29fc3ce31114eee62eb7d17a2452b84e2d73b8d92cfa [2025-02-08 05:37:11,294 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:37:11,304 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:37:11,309 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:37:11,310 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:37:11,310 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:37:11,313 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-chromosome-symm.wvr.c [2025-02-08 05:37:12,659 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6767b3258/ae70c80c1b84468aa80349538e931a8b/FLAGe44bcd7c1 [2025-02-08 05:37:12,923 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:37:12,926 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-chromosome-symm.wvr.c [2025-02-08 05:37:12,937 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6767b3258/ae70c80c1b84468aa80349538e931a8b/FLAGe44bcd7c1 [2025-02-08 05:37:12,952 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6767b3258/ae70c80c1b84468aa80349538e931a8b [2025-02-08 05:37:12,955 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:37:12,957 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:37:12,959 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:12,959 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:37:12,963 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:37:12,964 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:12" (1/1) ... [2025-02-08 05:37:12,965 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@717006eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:12, skipping insertion in model container [2025-02-08 05:37:12,965 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:12" (1/1) ... [2025-02-08 05:37:12,979 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:37:13,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:13,200 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:37:13,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:13,255 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:37:13,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:13 WrapperNode [2025-02-08 05:37:13,256 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:13,257 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:13,257 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:37:13,257 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:37:13,263 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:13" (1/1) ... [2025-02-08 05:37:13,274 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:13" (1/1) ... [2025-02-08 05:37:13,312 INFO L138 Inliner]: procedures = 24, calls = 28, calls flagged for inlining = 16, calls inlined = 20, statements flattened = 311 [2025-02-08 05:37:13,312 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:13,313 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:37:13,314 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:37:13,314 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:37:13,321 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:13" (1/1) ... [2025-02-08 05:37:13,321 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:13" (1/1) ... [2025-02-08 05:37:13,330 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:13" (1/1) ... [2025-02-08 05:37:13,332 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:13" (1/1) ... [2025-02-08 05:37:13,346 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:13" (1/1) ... [2025-02-08 05:37:13,347 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:13" (1/1) ... [2025-02-08 05:37:13,353 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:13" (1/1) ... [2025-02-08 05:37:13,354 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:13" (1/1) ... [2025-02-08 05:37:13,357 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:37:13,358 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:37:13,358 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:37:13,358 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:37:13,359 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:13" (1/1) ... [2025-02-08 05:37:13,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:37:13,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:37:13,396 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:13,400 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:13,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:37:13,428 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:37:13,428 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:37:13,428 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:37:13,428 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:37:13,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:37:13,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:37:13,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:37:13,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:37:13,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:37:13,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:37:13,430 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:13,541 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:37:13,543 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:37:13,774 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54: havoc #t~nondet5#1; [2025-02-08 05:37:13,774 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-1: havoc #t~ret4#1; [2025-02-08 05:37:13,775 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-2: havoc #t~mem3#1; [2025-02-08 05:37:13,775 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-3: assume #race~result_5~0 == #t~nondet5#1; [2025-02-08 05:37:13,775 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-3: assume !(#race~result_5~0 == #t~nondet5#1); [2025-02-08 05:37:13,775 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-4: havoc #t~mem2#1; [2025-02-08 05:37:13,775 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-5: #race~result_5~0 := #t~nondet5#1; [2025-02-08 05:37:13,775 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-6: havoc #t~nondet5#1; [2025-02-08 05:37:13,775 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-7: ~result_5~0 := #t~ret4#1; [2025-02-08 05:37:13,775 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-8: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret4#1 && #t~ret4#1 <= 2147483647; [2025-02-08 05:37:13,775 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-9: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:13,775 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-10: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:13,775 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-11: #t~ret4#1 := minus_#res#1; [2025-02-08 05:37:13,775 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55: assume 0 == #race~result_5~0; [2025-02-08 05:37:13,776 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55: assume !(0 == #race~result_5~0); [2025-02-08 05:37:13,776 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-1: ~stop~0#1 := (if 0 == (if 0 != ~result_5~0 then 1 else 0) then 0 else 1); [2025-02-08 05:37:13,776 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-2: #race~result_5~0 := 0; [2025-02-08 05:37:13,776 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56: havoc #t~post6#1; [2025-02-08 05:37:13,776 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-1: ~i~0#1 := 1 + #t~post6#1; [2025-02-08 05:37:13,776 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-2: #t~post6#1 := ~i~0#1; [2025-02-08 05:37:13,917 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-3: assume #race~result_8~0 == #t~nondet13#1; [2025-02-08 05:37:13,918 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-3: assume !(#race~result_8~0 == #t~nondet13#1); [2025-02-08 05:37:13,918 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-4: havoc #t~mem10#1; [2025-02-08 05:37:13,918 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-5: #race~result_8~0 := #t~nondet13#1; [2025-02-08 05:37:13,918 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-6: havoc #t~nondet13#1; [2025-02-08 05:37:13,918 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-7: ~result_8~0 := #t~ret12#1; [2025-02-08 05:37:13,918 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-8: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret12#1 && #t~ret12#1 <= 2147483647; [2025-02-08 05:37:13,918 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-9: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:13,919 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-10: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:13,919 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-11: #t~ret12#1 := minus_#res#1; [2025-02-08 05:37:13,919 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69: assume 0 == #race~result_8~0; [2025-02-08 05:37:13,919 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69: assume !(0 == #race~result_8~0); [2025-02-08 05:37:13,919 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-1: ~stop~1#1 := (if 0 == (if 0 != ~result_8~0 then 1 else 0) then 0 else 1); [2025-02-08 05:37:13,919 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-2: #race~result_8~0 := 0; [2025-02-08 05:37:13,919 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70: havoc #t~post14#1; [2025-02-08 05:37:13,919 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-1: ~i~1#1 := 1 + #t~post14#1; [2025-02-08 05:37:13,919 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-2: #t~post14#1 := ~i~1#1; [2025-02-08 05:37:13,920 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68: havoc #t~nondet13#1; [2025-02-08 05:37:13,920 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-1: havoc #t~ret12#1; [2025-02-08 05:37:13,920 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-2: havoc #t~mem11#1; [2025-02-08 05:37:14,198 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:37:14,198 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:37:14,218 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:37:14,219 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:37:14,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:14 BoogieIcfgContainer [2025-02-08 05:37:14,219 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:37:14,222 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:37:14,222 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:37:14,227 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:37:14,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:37:12" (1/3) ... [2025-02-08 05:37:14,228 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@486d26ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:14, skipping insertion in model container [2025-02-08 05:37:14,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:13" (2/3) ... [2025-02-08 05:37:14,229 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@486d26ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:14, skipping insertion in model container [2025-02-08 05:37:14,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:14" (3/3) ... [2025-02-08 05:37:14,230 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-chromosome-symm.wvr.c [2025-02-08 05:37:14,246 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:37:14,247 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-chromosome-symm.wvr.c that has 3 procedures, 368 locations, 1 initial locations, 4 loop locations, and 34 error locations. [2025-02-08 05:37:14,248 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:37:14,374 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:37:14,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 374 places, 387 transitions, 788 flow [2025-02-08 05:37:14,567 INFO L124 PetriNetUnfolderBase]: 20/385 cut-off events. [2025-02-08 05:37:14,570 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:37:14,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 394 conditions, 385 events. 20/385 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 579 event pairs, 0 based on Foata normal form. 0/333 useless extension candidates. Maximal degree in co-relation 234. Up to 2 conditions per place. [2025-02-08 05:37:14,579 INFO L82 GeneralOperation]: Start removeDead. Operand has 374 places, 387 transitions, 788 flow [2025-02-08 05:37:14,586 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 354 places, 365 transitions, 742 flow [2025-02-08 05:37:14,593 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:37:14,606 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;@3fccff08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:37:14,606 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-02-08 05:37:14,619 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:37:14,620 INFO L124 PetriNetUnfolderBase]: 2/59 cut-off events. [2025-02-08 05:37:14,620 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:37:14,620 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:14,621 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] [2025-02-08 05:37:14,621 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:14,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:14,627 INFO L85 PathProgramCache]: Analyzing trace with hash 922399995, now seen corresponding path program 1 times [2025-02-08 05:37:14,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:14,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989130598] [2025-02-08 05:37:14,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:14,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:14,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 05:37:14,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 05:37:14,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:14,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:15,488 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:15,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:15,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989130598] [2025-02-08 05:37:15,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989130598] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:15,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:15,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:15,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364411616] [2025-02-08 05:37:15,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:15,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:15,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:15,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:15,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:15,821 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 325 out of 387 [2025-02-08 05:37:15,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 365 transitions, 742 flow. Second operand has 6 states, 6 states have (on average 326.5) internal successors, (1959), 6 states have internal predecessors, (1959), 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:15,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:15,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 325 of 387 [2025-02-08 05:37:15,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:16,141 INFO L124 PetriNetUnfolderBase]: 87/935 cut-off events. [2025-02-08 05:37:16,141 INFO L125 PetriNetUnfolderBase]: For 38/39 co-relation queries the response was YES. [2025-02-08 05:37:16,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1175 conditions, 935 events. 87/935 cut-off events. For 38/39 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 5100 event pairs, 80 based on Foata normal form. 56/859 useless extension candidates. Maximal degree in co-relation 887. Up to 197 conditions per place. [2025-02-08 05:37:16,156 INFO L140 encePairwiseOnDemand]: 363/387 looper letters, 36 selfloop transitions, 10 changer transitions 6/351 dead transitions. [2025-02-08 05:37:16,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 351 transitions, 806 flow [2025-02-08 05:37:16,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:16,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:16,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2010 transitions. [2025-02-08 05:37:16,184 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8656330749354005 [2025-02-08 05:37:16,186 INFO L175 Difference]: Start difference. First operand has 354 places, 365 transitions, 742 flow. Second operand 6 states and 2010 transitions. [2025-02-08 05:37:16,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 351 transitions, 806 flow [2025-02-08 05:37:16,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 351 transitions, 798 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:37:16,203 INFO L231 Difference]: Finished difference. Result has 353 places, 345 transitions, 714 flow [2025-02-08 05:37:16,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=706, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=714, PETRI_PLACES=353, PETRI_TRANSITIONS=345} [2025-02-08 05:37:16,213 INFO L279 CegarLoopForPetriNet]: 354 programPoint places, -1 predicate places. [2025-02-08 05:37:16,214 INFO L471 AbstractCegarLoop]: Abstraction has has 353 places, 345 transitions, 714 flow [2025-02-08 05:37:16,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 326.5) internal successors, (1959), 6 states have internal predecessors, (1959), 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:16,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:16,216 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] [2025-02-08 05:37:16,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:37:16,217 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:16,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:16,219 INFO L85 PathProgramCache]: Analyzing trace with hash 288664261, now seen corresponding path program 1 times [2025-02-08 05:37:16,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:16,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075714415] [2025-02-08 05:37:16,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:16,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:16,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 05:37:16,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 05:37:16,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:16,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:16,265 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:16,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:16,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075714415] [2025-02-08 05:37:16,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075714415] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:16,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:16,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:16,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033334786] [2025-02-08 05:37:16,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:16,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:16,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:16,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:16,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:16,288 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 387 [2025-02-08 05:37:16,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 345 transitions, 714 flow. Second operand has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 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:16,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:16,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 387 [2025-02-08 05:37:16,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:16,381 INFO L124 PetriNetUnfolderBase]: 10/431 cut-off events. [2025-02-08 05:37:16,382 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2025-02-08 05:37:16,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 464 conditions, 431 events. 10/431 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1059 event pairs, 3 based on Foata normal form. 0/376 useless extension candidates. Maximal degree in co-relation 431. Up to 16 conditions per place. [2025-02-08 05:37:16,387 INFO L140 encePairwiseOnDemand]: 384/387 looper letters, 9 selfloop transitions, 2 changer transitions 0/344 dead transitions. [2025-02-08 05:37:16,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 344 transitions, 734 flow [2025-02-08 05:37:16,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:16,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:16,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1092 transitions. [2025-02-08 05:37:16,391 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9405684754521964 [2025-02-08 05:37:16,391 INFO L175 Difference]: Start difference. First operand has 353 places, 345 transitions, 714 flow. Second operand 3 states and 1092 transitions. [2025-02-08 05:37:16,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 344 transitions, 734 flow [2025-02-08 05:37:16,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 344 transitions, 714 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:37:16,400 INFO L231 Difference]: Finished difference. Result has 343 places, 344 transitions, 696 flow [2025-02-08 05:37:16,401 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=342, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=696, PETRI_PLACES=343, PETRI_TRANSITIONS=344} [2025-02-08 05:37:16,402 INFO L279 CegarLoopForPetriNet]: 354 programPoint places, -11 predicate places. [2025-02-08 05:37:16,402 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 344 transitions, 696 flow [2025-02-08 05:37:16,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 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:16,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:16,403 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] [2025-02-08 05:37:16,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:37:16,405 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:16,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:16,406 INFO L85 PathProgramCache]: Analyzing trace with hash 94343068, now seen corresponding path program 1 times [2025-02-08 05:37:16,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:16,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211433321] [2025-02-08 05:37:16,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:16,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:16,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-08 05:37:16,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-08 05:37:16,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:16,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:16,472 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:16,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:16,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211433321] [2025-02-08 05:37:16,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211433321] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:16,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:16,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:16,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772790503] [2025-02-08 05:37:16,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:16,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:16,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:16,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:16,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:16,496 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 387 [2025-02-08 05:37:16,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 344 transitions, 696 flow. Second operand has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 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:16,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:16,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 387 [2025-02-08 05:37:16,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:16,589 INFO L124 PetriNetUnfolderBase]: 10/469 cut-off events. [2025-02-08 05:37:16,589 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2025-02-08 05:37:16,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 494 conditions, 469 events. 10/469 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1172 event pairs, 3 based on Foata normal form. 0/407 useless extension candidates. Maximal degree in co-relation 425. Up to 16 conditions per place. [2025-02-08 05:37:16,596 INFO L140 encePairwiseOnDemand]: 384/387 looper letters, 9 selfloop transitions, 2 changer transitions 0/343 dead transitions. [2025-02-08 05:37:16,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 343 transitions, 716 flow [2025-02-08 05:37:16,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:16,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:16,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1092 transitions. [2025-02-08 05:37:16,601 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9405684754521964 [2025-02-08 05:37:16,603 INFO L175 Difference]: Start difference. First operand has 343 places, 344 transitions, 696 flow. Second operand 3 states and 1092 transitions. [2025-02-08 05:37:16,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 343 transitions, 716 flow [2025-02-08 05:37:16,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 343 transitions, 712 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:16,611 INFO L231 Difference]: Finished difference. Result has 342 places, 343 transitions, 694 flow [2025-02-08 05:37:16,612 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=694, PETRI_PLACES=342, PETRI_TRANSITIONS=343} [2025-02-08 05:37:16,612 INFO L279 CegarLoopForPetriNet]: 354 programPoint places, -12 predicate places. [2025-02-08 05:37:16,612 INFO L471 AbstractCegarLoop]: Abstraction has has 342 places, 343 transitions, 694 flow [2025-02-08 05:37:16,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 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:16,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:16,615 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] [2025-02-08 05:37:16,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:37:16,615 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:16,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:16,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1634561895, now seen corresponding path program 1 times [2025-02-08 05:37:16,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:16,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279413184] [2025-02-08 05:37:16,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:16,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:16,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-08 05:37:16,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-08 05:37:16,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:16,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:16,684 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:16,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:16,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279413184] [2025-02-08 05:37:16,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279413184] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:16,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:16,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:16,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685167493] [2025-02-08 05:37:16,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:16,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:16,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:16,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:16,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:16,709 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 387 [2025-02-08 05:37:16,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 343 transitions, 694 flow. Second operand has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 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:16,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:16,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 387 [2025-02-08 05:37:16,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:16,805 INFO L124 PetriNetUnfolderBase]: 11/504 cut-off events. [2025-02-08 05:37:16,806 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:37:16,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 529 conditions, 504 events. 11/504 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1466 event pairs, 3 based on Foata normal form. 0/436 useless extension candidates. Maximal degree in co-relation 413. Up to 16 conditions per place. [2025-02-08 05:37:16,812 INFO L140 encePairwiseOnDemand]: 384/387 looper letters, 9 selfloop transitions, 2 changer transitions 0/342 dead transitions. [2025-02-08 05:37:16,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 342 transitions, 714 flow [2025-02-08 05:37:16,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:16,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:16,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1092 transitions. [2025-02-08 05:37:16,816 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9405684754521964 [2025-02-08 05:37:16,816 INFO L175 Difference]: Start difference. First operand has 342 places, 343 transitions, 694 flow. Second operand 3 states and 1092 transitions. [2025-02-08 05:37:16,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 342 transitions, 714 flow [2025-02-08 05:37:16,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 342 transitions, 710 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:16,824 INFO L231 Difference]: Finished difference. Result has 341 places, 342 transitions, 692 flow [2025-02-08 05:37:16,825 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=692, PETRI_PLACES=341, PETRI_TRANSITIONS=342} [2025-02-08 05:37:16,826 INFO L279 CegarLoopForPetriNet]: 354 programPoint places, -13 predicate places. [2025-02-08 05:37:16,826 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 342 transitions, 692 flow [2025-02-08 05:37:16,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 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:16,827 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:16,828 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] [2025-02-08 05:37:16,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:37:16,828 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:16,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:16,829 INFO L85 PathProgramCache]: Analyzing trace with hash 256639269, now seen corresponding path program 1 times [2025-02-08 05:37:16,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:16,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394206587] [2025-02-08 05:37:16,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:16,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:16,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 05:37:16,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 05:37:16,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:16,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:16,892 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:16,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:16,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394206587] [2025-02-08 05:37:16,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394206587] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:16,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:16,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:16,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190794963] [2025-02-08 05:37:16,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:16,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:16,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:16,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:16,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:16,914 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 387 [2025-02-08 05:37:16,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 342 transitions, 692 flow. Second operand has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 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:16,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:16,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 387 [2025-02-08 05:37:16,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:16,992 INFO L124 PetriNetUnfolderBase]: 11/506 cut-off events. [2025-02-08 05:37:16,992 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-02-08 05:37:16,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 531 conditions, 506 events. 11/506 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1305 event pairs, 3 based on Foata normal form. 0/438 useless extension candidates. Maximal degree in co-relation 407. Up to 16 conditions per place. [2025-02-08 05:37:16,998 INFO L140 encePairwiseOnDemand]: 384/387 looper letters, 9 selfloop transitions, 2 changer transitions 0/341 dead transitions. [2025-02-08 05:37:16,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 341 transitions, 712 flow [2025-02-08 05:37:16,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:16,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:17,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1092 transitions. [2025-02-08 05:37:17,001 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9405684754521964 [2025-02-08 05:37:17,001 INFO L175 Difference]: Start difference. First operand has 341 places, 342 transitions, 692 flow. Second operand 3 states and 1092 transitions. [2025-02-08 05:37:17,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 341 transitions, 712 flow [2025-02-08 05:37:17,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 341 transitions, 708 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:17,008 INFO L231 Difference]: Finished difference. Result has 340 places, 341 transitions, 690 flow [2025-02-08 05:37:17,009 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=690, PETRI_PLACES=340, PETRI_TRANSITIONS=341} [2025-02-08 05:37:17,009 INFO L279 CegarLoopForPetriNet]: 354 programPoint places, -14 predicate places. [2025-02-08 05:37:17,010 INFO L471 AbstractCegarLoop]: Abstraction has has 340 places, 341 transitions, 690 flow [2025-02-08 05:37:17,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 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:17,011 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:17,011 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] [2025-02-08 05:37:17,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:37:17,011 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:17,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:17,012 INFO L85 PathProgramCache]: Analyzing trace with hash 911931009, now seen corresponding path program 1 times [2025-02-08 05:37:17,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:17,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434284052] [2025-02-08 05:37:17,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:17,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:17,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-08 05:37:17,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-08 05:37:17,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:17,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:17,065 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:17,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:17,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434284052] [2025-02-08 05:37:17,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434284052] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:17,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:17,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:17,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419144982] [2025-02-08 05:37:17,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:17,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:17,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:17,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:17,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:17,083 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 362 out of 387 [2025-02-08 05:37:17,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 341 transitions, 690 flow. Second operand has 3 states, 3 states have (on average 363.3333333333333) internal successors, (1090), 3 states have internal predecessors, (1090), 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:17,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:17,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 362 of 387 [2025-02-08 05:37:17,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:17,191 INFO L124 PetriNetUnfolderBase]: 19/705 cut-off events. [2025-02-08 05:37:17,191 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:37:17,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 739 conditions, 705 events. 19/705 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2801 event pairs, 4 based on Foata normal form. 0/608 useless extension candidates. Maximal degree in co-relation 607. Up to 22 conditions per place. [2025-02-08 05:37:17,199 INFO L140 encePairwiseOnDemand]: 383/387 looper letters, 10 selfloop transitions, 2 changer transitions 0/342 dead transitions. [2025-02-08 05:37:17,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 342 transitions, 717 flow [2025-02-08 05:37:17,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:17,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:17,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1100 transitions. [2025-02-08 05:37:17,204 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9474590869939707 [2025-02-08 05:37:17,204 INFO L175 Difference]: Start difference. First operand has 340 places, 341 transitions, 690 flow. Second operand 3 states and 1100 transitions. [2025-02-08 05:37:17,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 342 transitions, 717 flow [2025-02-08 05:37:17,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 342 transitions, 713 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:17,216 INFO L231 Difference]: Finished difference. Result has 339 places, 341 transitions, 696 flow [2025-02-08 05:37:17,217 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=696, PETRI_PLACES=339, PETRI_TRANSITIONS=341} [2025-02-08 05:37:17,219 INFO L279 CegarLoopForPetriNet]: 354 programPoint places, -15 predicate places. [2025-02-08 05:37:17,220 INFO L471 AbstractCegarLoop]: Abstraction has has 339 places, 341 transitions, 696 flow [2025-02-08 05:37:17,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 363.3333333333333) internal successors, (1090), 3 states have internal predecessors, (1090), 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:17,221 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:17,222 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] [2025-02-08 05:37:17,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:37:17,222 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:17,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:17,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1160789559, now seen corresponding path program 1 times [2025-02-08 05:37:17,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:17,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787662883] [2025-02-08 05:37:17,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:17,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:17,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-08 05:37:17,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-08 05:37:17,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:17,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:17,291 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:17,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:17,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787662883] [2025-02-08 05:37:17,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787662883] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:17,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:17,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:17,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842866560] [2025-02-08 05:37:17,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:17,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:17,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:17,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:17,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:17,309 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 362 out of 387 [2025-02-08 05:37:17,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 341 transitions, 696 flow. Second operand has 3 states, 3 states have (on average 363.6666666666667) internal successors, (1091), 3 states have internal predecessors, (1091), 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:17,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:17,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 362 of 387 [2025-02-08 05:37:17,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:17,411 INFO L124 PetriNetUnfolderBase]: 20/695 cut-off events. [2025-02-08 05:37:17,411 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-02-08 05:37:17,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 734 conditions, 695 events. 20/695 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3048 event pairs, 3 based on Foata normal form. 0/604 useless extension candidates. Maximal degree in co-relation 522. Up to 22 conditions per place. [2025-02-08 05:37:17,419 INFO L140 encePairwiseOnDemand]: 383/387 looper letters, 10 selfloop transitions, 2 changer transitions 0/342 dead transitions. [2025-02-08 05:37:17,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 342 transitions, 723 flow [2025-02-08 05:37:17,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:17,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:17,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1100 transitions. [2025-02-08 05:37:17,425 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9474590869939707 [2025-02-08 05:37:17,425 INFO L175 Difference]: Start difference. First operand has 339 places, 341 transitions, 696 flow. Second operand 3 states and 1100 transitions. [2025-02-08 05:37:17,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 342 transitions, 723 flow [2025-02-08 05:37:17,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 342 transitions, 723 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:17,432 INFO L231 Difference]: Finished difference. Result has 340 places, 341 transitions, 706 flow [2025-02-08 05:37:17,433 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=706, PETRI_PLACES=340, PETRI_TRANSITIONS=341} [2025-02-08 05:37:17,433 INFO L279 CegarLoopForPetriNet]: 354 programPoint places, -14 predicate places. [2025-02-08 05:37:17,436 INFO L471 AbstractCegarLoop]: Abstraction has has 340 places, 341 transitions, 706 flow [2025-02-08 05:37:17,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 363.6666666666667) internal successors, (1091), 3 states have internal predecessors, (1091), 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:17,437 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:17,437 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:17,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:37:17,437 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:17,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:17,438 INFO L85 PathProgramCache]: Analyzing trace with hash -2069103271, now seen corresponding path program 1 times [2025-02-08 05:37:17,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:17,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225608983] [2025-02-08 05:37:17,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:17,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:17,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-08 05:37:17,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-08 05:37:17,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:17,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:17,503 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:17,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:17,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225608983] [2025-02-08 05:37:17,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225608983] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:17,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:17,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:17,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682134029] [2025-02-08 05:37:17,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:17,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:17,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:17,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:17,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:17,540 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 359 out of 387 [2025-02-08 05:37:17,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 341 transitions, 706 flow. Second operand has 3 states, 3 states have (on average 360.3333333333333) internal successors, (1081), 3 states have internal predecessors, (1081), 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:17,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:17,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 359 of 387 [2025-02-08 05:37:17,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:17,622 INFO L124 PetriNetUnfolderBase]: 18/547 cut-off events. [2025-02-08 05:37:17,622 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:37:17,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 604 conditions, 547 events. 18/547 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1970 event pairs, 4 based on Foata normal form. 0/483 useless extension candidates. Maximal degree in co-relation 392. Up to 25 conditions per place. [2025-02-08 05:37:17,628 INFO L140 encePairwiseOnDemand]: 384/387 looper letters, 12 selfloop transitions, 2 changer transitions 0/341 dead transitions. [2025-02-08 05:37:17,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 341 transitions, 735 flow [2025-02-08 05:37:17,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:17,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:17,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1092 transitions. [2025-02-08 05:37:17,630 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9405684754521964 [2025-02-08 05:37:17,630 INFO L175 Difference]: Start difference. First operand has 340 places, 341 transitions, 706 flow. Second operand 3 states and 1092 transitions. [2025-02-08 05:37:17,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 341 transitions, 735 flow [2025-02-08 05:37:17,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 341 transitions, 735 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:17,637 INFO L231 Difference]: Finished difference. Result has 341 places, 340 transitions, 708 flow [2025-02-08 05:37:17,638 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=708, PETRI_PLACES=341, PETRI_TRANSITIONS=340} [2025-02-08 05:37:17,639 INFO L279 CegarLoopForPetriNet]: 354 programPoint places, -13 predicate places. [2025-02-08 05:37:17,640 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 340 transitions, 708 flow [2025-02-08 05:37:17,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 360.3333333333333) internal successors, (1081), 3 states have internal predecessors, (1081), 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:17,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:17,641 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] [2025-02-08 05:37:17,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:37:17,641 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:17,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:17,642 INFO L85 PathProgramCache]: Analyzing trace with hash 769054990, now seen corresponding path program 1 times [2025-02-08 05:37:17,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:17,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793925189] [2025-02-08 05:37:17,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:17,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:17,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-08 05:37:17,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-08 05:37:17,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:17,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:17,701 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:17,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:17,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793925189] [2025-02-08 05:37:17,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793925189] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:17,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:17,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:17,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711165964] [2025-02-08 05:37:17,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:17,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:17,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:17,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:17,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:17,715 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 362 out of 387 [2025-02-08 05:37:17,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 340 transitions, 708 flow. Second operand has 3 states, 3 states have (on average 363.3333333333333) internal successors, (1090), 3 states have internal predecessors, (1090), 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:17,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:17,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 362 of 387 [2025-02-08 05:37:17,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:17,789 INFO L124 PetriNetUnfolderBase]: 18/641 cut-off events. [2025-02-08 05:37:17,789 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-02-08 05:37:17,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 696 conditions, 641 events. 18/641 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2523 event pairs, 2 based on Foata normal form. 0/571 useless extension candidates. Maximal degree in co-relation 481. Up to 24 conditions per place. [2025-02-08 05:37:17,793 INFO L140 encePairwiseOnDemand]: 383/387 looper letters, 11 selfloop transitions, 2 changer transitions 0/342 dead transitions. [2025-02-08 05:37:17,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 342 transitions, 740 flow [2025-02-08 05:37:17,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:17,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:17,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1101 transitions. [2025-02-08 05:37:17,796 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9483204134366925 [2025-02-08 05:37:17,796 INFO L175 Difference]: Start difference. First operand has 341 places, 340 transitions, 708 flow. Second operand 3 states and 1101 transitions. [2025-02-08 05:37:17,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 342 transitions, 740 flow [2025-02-08 05:37:17,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 342 transitions, 736 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:17,802 INFO L231 Difference]: Finished difference. Result has 340 places, 340 transitions, 714 flow [2025-02-08 05:37:17,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=714, PETRI_PLACES=340, PETRI_TRANSITIONS=340} [2025-02-08 05:37:17,803 INFO L279 CegarLoopForPetriNet]: 354 programPoint places, -14 predicate places. [2025-02-08 05:37:17,803 INFO L471 AbstractCegarLoop]: Abstraction has has 340 places, 340 transitions, 714 flow [2025-02-08 05:37:17,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 363.3333333333333) internal successors, (1090), 3 states have internal predecessors, (1090), 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:17,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:17,804 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:17,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:37:17,805 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:17,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:17,805 INFO L85 PathProgramCache]: Analyzing trace with hash -724934794, now seen corresponding path program 1 times [2025-02-08 05:37:17,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:17,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320676331] [2025-02-08 05:37:17,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:17,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:17,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-08 05:37:17,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-08 05:37:17,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:17,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:17,863 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:17,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:17,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320676331] [2025-02-08 05:37:17,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320676331] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:17,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:17,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:17,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52859892] [2025-02-08 05:37:17,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:17,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:17,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:17,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:17,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:17,896 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 359 out of 387 [2025-02-08 05:37:17,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 340 transitions, 714 flow. Second operand has 3 states, 3 states have (on average 360.6666666666667) internal successors, (1082), 3 states have internal predecessors, (1082), 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:17,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:17,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 359 of 387 [2025-02-08 05:37:17,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:17,966 INFO L124 PetriNetUnfolderBase]: 18/566 cut-off events. [2025-02-08 05:37:17,967 INFO L125 PetriNetUnfolderBase]: For 9/10 co-relation queries the response was YES. [2025-02-08 05:37:17,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 629 conditions, 566 events. 18/566 cut-off events. For 9/10 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1934 event pairs, 4 based on Foata normal form. 0/502 useless extension candidates. Maximal degree in co-relation 417. Up to 25 conditions per place. [2025-02-08 05:37:17,972 INFO L140 encePairwiseOnDemand]: 384/387 looper letters, 12 selfloop transitions, 2 changer transitions 0/340 dead transitions. [2025-02-08 05:37:17,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 340 transitions, 743 flow [2025-02-08 05:37:17,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:17,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:17,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1092 transitions. [2025-02-08 05:37:17,975 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9405684754521964 [2025-02-08 05:37:17,975 INFO L175 Difference]: Start difference. First operand has 340 places, 340 transitions, 714 flow. Second operand 3 states and 1092 transitions. [2025-02-08 05:37:17,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 340 transitions, 743 flow [2025-02-08 05:37:17,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 340 transitions, 743 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:17,982 INFO L231 Difference]: Finished difference. Result has 341 places, 339 transitions, 716 flow [2025-02-08 05:37:17,983 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=712, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=716, PETRI_PLACES=341, PETRI_TRANSITIONS=339} [2025-02-08 05:37:17,984 INFO L279 CegarLoopForPetriNet]: 354 programPoint places, -13 predicate places. [2025-02-08 05:37:17,984 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 339 transitions, 716 flow [2025-02-08 05:37:17,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 360.6666666666667) internal successors, (1082), 3 states have internal predecessors, (1082), 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:17,985 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:17,985 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:17,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:37:17,986 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:17,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:17,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1929067457, now seen corresponding path program 1 times [2025-02-08 05:37:17,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:17,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503693934] [2025-02-08 05:37:17,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:17,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:18,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-08 05:37:18,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-08 05:37:18,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:18,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:18,051 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:18,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:18,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503693934] [2025-02-08 05:37:18,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503693934] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:18,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:18,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:18,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292388848] [2025-02-08 05:37:18,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:18,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:18,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:18,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:18,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:18,077 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 355 out of 387 [2025-02-08 05:37:18,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 339 transitions, 716 flow. Second operand has 3 states, 3 states have (on average 356.3333333333333) internal successors, (1069), 3 states have internal predecessors, (1069), 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:18,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:18,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 355 of 387 [2025-02-08 05:37:18,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:18,148 INFO L124 PetriNetUnfolderBase]: 18/519 cut-off events. [2025-02-08 05:37:18,148 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:37:18,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 589 conditions, 519 events. 18/519 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1674 event pairs, 2 based on Foata normal form. 0/472 useless extension candidates. Maximal degree in co-relation 407. Up to 17 conditions per place. [2025-02-08 05:37:18,153 INFO L140 encePairwiseOnDemand]: 380/387 looper letters, 13 selfloop transitions, 3 changer transitions 0/337 dead transitions. [2025-02-08 05:37:18,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 337 transitions, 745 flow [2025-02-08 05:37:18,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:18,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:18,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1085 transitions. [2025-02-08 05:37:18,156 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9345391903531438 [2025-02-08 05:37:18,157 INFO L175 Difference]: Start difference. First operand has 341 places, 339 transitions, 716 flow. Second operand 3 states and 1085 transitions. [2025-02-08 05:37:18,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 337 transitions, 745 flow [2025-02-08 05:37:18,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 337 transitions, 741 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:18,163 INFO L231 Difference]: Finished difference. Result has 338 places, 336 transitions, 717 flow [2025-02-08 05:37:18,163 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=717, PETRI_PLACES=338, PETRI_TRANSITIONS=336} [2025-02-08 05:37:18,165 INFO L279 CegarLoopForPetriNet]: 354 programPoint places, -16 predicate places. [2025-02-08 05:37:18,165 INFO L471 AbstractCegarLoop]: Abstraction has has 338 places, 336 transitions, 717 flow [2025-02-08 05:37:18,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 356.3333333333333) internal successors, (1069), 3 states have internal predecessors, (1069), 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:18,166 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:18,166 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] [2025-02-08 05:37:18,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:37:18,166 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:18,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:18,167 INFO L85 PathProgramCache]: Analyzing trace with hash 2139202869, now seen corresponding path program 1 times [2025-02-08 05:37:18,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:18,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617441003] [2025-02-08 05:37:18,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:18,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:18,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-08 05:37:18,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-08 05:37:18,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:18,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:18,302 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:18,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:18,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617441003] [2025-02-08 05:37:18,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617441003] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:18,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:18,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:37:18,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413964429] [2025-02-08 05:37:18,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:18,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:37:18,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:18,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:37:18,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:37:18,373 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 363 out of 387 [2025-02-08 05:37:18,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 336 transitions, 717 flow. Second operand has 4 states, 4 states have (on average 364.25) internal successors, (1457), 4 states have internal predecessors, (1457), 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:18,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:18,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 363 of 387 [2025-02-08 05:37:18,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:18,448 INFO L124 PetriNetUnfolderBase]: 15/554 cut-off events. [2025-02-08 05:37:18,449 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:37:18,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 628 conditions, 554 events. 15/554 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1958 event pairs, 1 based on Foata normal form. 0/503 useless extension candidates. Maximal degree in co-relation 531. Up to 11 conditions per place. [2025-02-08 05:37:18,453 INFO L140 encePairwiseOnDemand]: 384/387 looper letters, 9 selfloop transitions, 2 changer transitions 0/335 dead transitions. [2025-02-08 05:37:18,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 335 transitions, 737 flow [2025-02-08 05:37:18,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:37:18,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 05:37:18,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1464 transitions. [2025-02-08 05:37:18,456 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9457364341085271 [2025-02-08 05:37:18,456 INFO L175 Difference]: Start difference. First operand has 338 places, 336 transitions, 717 flow. Second operand 4 states and 1464 transitions. [2025-02-08 05:37:18,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 335 transitions, 737 flow [2025-02-08 05:37:18,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 335 transitions, 728 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 05:37:18,462 INFO L231 Difference]: Finished difference. Result has 337 places, 333 transitions, 704 flow [2025-02-08 05:37:18,462 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=704, PETRI_PLACES=337, PETRI_TRANSITIONS=333} [2025-02-08 05:37:18,463 INFO L279 CegarLoopForPetriNet]: 354 programPoint places, -17 predicate places. [2025-02-08 05:37:18,463 INFO L471 AbstractCegarLoop]: Abstraction has has 337 places, 333 transitions, 704 flow [2025-02-08 05:37:18,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 364.25) internal successors, (1457), 4 states have internal predecessors, (1457), 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:18,464 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:18,464 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] [2025-02-08 05:37:18,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:37:18,465 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:18,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:18,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1315251036, now seen corresponding path program 1 times [2025-02-08 05:37:18,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:18,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406094292] [2025-02-08 05:37:18,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:18,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:18,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-08 05:37:18,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-08 05:37:18,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:18,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:18,509 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:18,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:18,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406094292] [2025-02-08 05:37:18,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406094292] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:18,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:18,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:18,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039781378] [2025-02-08 05:37:18,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:18,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:18,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:18,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:18,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:18,522 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 362 out of 387 [2025-02-08 05:37:18,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 333 transitions, 704 flow. Second operand has 3 states, 3 states have (on average 363.6666666666667) internal successors, (1091), 3 states have internal predecessors, (1091), 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:18,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:18,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 362 of 387 [2025-02-08 05:37:18,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:18,593 INFO L124 PetriNetUnfolderBase]: 17/654 cut-off events. [2025-02-08 05:37:18,593 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-02-08 05:37:18,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 723 conditions, 654 events. 17/654 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2518 event pairs, 2 based on Foata normal form. 0/597 useless extension candidates. Maximal degree in co-relation 507. Up to 24 conditions per place. [2025-02-08 05:37:18,598 INFO L140 encePairwiseOnDemand]: 383/387 looper letters, 11 selfloop transitions, 2 changer transitions 0/335 dead transitions. [2025-02-08 05:37:18,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 335 transitions, 736 flow [2025-02-08 05:37:18,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:18,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:18,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1101 transitions. [2025-02-08 05:37:18,600 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9483204134366925 [2025-02-08 05:37:18,601 INFO L175 Difference]: Start difference. First operand has 337 places, 333 transitions, 704 flow. Second operand 3 states and 1101 transitions. [2025-02-08 05:37:18,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 335 transitions, 736 flow [2025-02-08 05:37:18,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 335 transitions, 733 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:18,606 INFO L231 Difference]: Finished difference. Result has 336 places, 333 transitions, 711 flow [2025-02-08 05:37:18,607 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=711, PETRI_PLACES=336, PETRI_TRANSITIONS=333} [2025-02-08 05:37:18,608 INFO L279 CegarLoopForPetriNet]: 354 programPoint places, -18 predicate places. [2025-02-08 05:37:18,608 INFO L471 AbstractCegarLoop]: Abstraction has has 336 places, 333 transitions, 711 flow [2025-02-08 05:37:18,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 363.6666666666667) internal successors, (1091), 3 states have internal predecessors, (1091), 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:18,609 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:18,609 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] [2025-02-08 05:37:18,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:37:18,609 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:18,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:18,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1648826442, now seen corresponding path program 1 times [2025-02-08 05:37:18,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:18,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73892827] [2025-02-08 05:37:18,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:18,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:18,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-08 05:37:18,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-08 05:37:18,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:18,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:18,728 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:18,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:18,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73892827] [2025-02-08 05:37:18,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73892827] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:18,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:18,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:18,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75451886] [2025-02-08 05:37:18,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:18,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:37:18,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:18,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:37:18,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:37:18,861 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 387 [2025-02-08 05:37:18,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 333 transitions, 711 flow. Second operand has 5 states, 5 states have (on average 354.4) internal successors, (1772), 5 states have internal predecessors, (1772), 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:18,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:18,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 387 [2025-02-08 05:37:18,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:18,955 INFO L124 PetriNetUnfolderBase]: 10/543 cut-off events. [2025-02-08 05:37:18,956 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2025-02-08 05:37:18,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 610 conditions, 543 events. 10/543 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1591 event pairs, 0 based on Foata normal form. 2/505 useless extension candidates. Maximal degree in co-relation 394. Up to 10 conditions per place. [2025-02-08 05:37:18,959 INFO L140 encePairwiseOnDemand]: 373/387 looper letters, 12 selfloop transitions, 12 changer transitions 0/335 dead transitions. [2025-02-08 05:37:18,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 335 transitions, 763 flow [2025-02-08 05:37:18,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 05:37:18,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 05:37:18,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1781 transitions. [2025-02-08 05:37:18,963 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9204134366925064 [2025-02-08 05:37:18,964 INFO L175 Difference]: Start difference. First operand has 336 places, 333 transitions, 711 flow. Second operand 5 states and 1781 transitions. [2025-02-08 05:37:18,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 335 transitions, 763 flow [2025-02-08 05:37:18,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 335 transitions, 763 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:18,971 INFO L231 Difference]: Finished difference. Result has 341 places, 335 transitions, 751 flow [2025-02-08 05:37:18,972 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=711, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=751, PETRI_PLACES=341, PETRI_TRANSITIONS=335} [2025-02-08 05:37:18,973 INFO L279 CegarLoopForPetriNet]: 354 programPoint places, -13 predicate places. [2025-02-08 05:37:18,973 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 335 transitions, 751 flow [2025-02-08 05:37:18,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 354.4) internal successors, (1772), 5 states have internal predecessors, (1772), 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:18,975 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:18,975 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] [2025-02-08 05:37:18,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:37:18,975 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:18,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:18,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1425689421, now seen corresponding path program 1 times [2025-02-08 05:37:18,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:18,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161207714] [2025-02-08 05:37:18,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:18,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:18,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-08 05:37:19,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-08 05:37:19,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:19,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:19,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:37:19,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:19,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161207714] [2025-02-08 05:37:19,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161207714] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:19,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:19,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:19,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689342715] [2025-02-08 05:37:19,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:19,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:19,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:19,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:19,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:19,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 359 out of 387 [2025-02-08 05:37:19,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 335 transitions, 751 flow. Second operand has 3 states, 3 states have (on average 361.0) internal successors, (1083), 3 states have internal predecessors, (1083), 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:19,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:19,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 359 of 387 [2025-02-08 05:37:19,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:19,170 INFO L124 PetriNetUnfolderBase]: 19/568 cut-off events. [2025-02-08 05:37:19,170 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:37:19,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 671 conditions, 568 events. 19/568 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1802 event pairs, 4 based on Foata normal form. 0/529 useless extension candidates. Maximal degree in co-relation 520. Up to 25 conditions per place. [2025-02-08 05:37:19,174 INFO L140 encePairwiseOnDemand]: 384/387 looper letters, 12 selfloop transitions, 2 changer transitions 0/335 dead transitions. [2025-02-08 05:37:19,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 335 transitions, 780 flow [2025-02-08 05:37:19,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:19,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:19,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1092 transitions. [2025-02-08 05:37:19,177 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9405684754521964 [2025-02-08 05:37:19,177 INFO L175 Difference]: Start difference. First operand has 341 places, 335 transitions, 751 flow. Second operand 3 states and 1092 transitions. [2025-02-08 05:37:19,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 335 transitions, 780 flow [2025-02-08 05:37:19,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 335 transitions, 760 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 05:37:19,182 INFO L231 Difference]: Finished difference. Result has 339 places, 334 transitions, 733 flow [2025-02-08 05:37:19,183 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=729, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=733, PETRI_PLACES=339, PETRI_TRANSITIONS=334} [2025-02-08 05:37:19,183 INFO L279 CegarLoopForPetriNet]: 354 programPoint places, -15 predicate places. [2025-02-08 05:37:19,183 INFO L471 AbstractCegarLoop]: Abstraction has has 339 places, 334 transitions, 733 flow [2025-02-08 05:37:19,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 361.0) internal successors, (1083), 3 states have internal predecessors, (1083), 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:19,184 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:19,185 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] [2025-02-08 05:37:19,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:37:19,185 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:19,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:19,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1129484144, now seen corresponding path program 1 times [2025-02-08 05:37:19,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:19,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727044676] [2025-02-08 05:37:19,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:19,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:19,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-08 05:37:19,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-08 05:37:19,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:19,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:19,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:37:19,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:19,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727044676] [2025-02-08 05:37:19,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727044676] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:37:19,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552092950] [2025-02-08 05:37:19,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:19,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:37:19,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:37:19,386 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:37:19,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 05:37:19,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-08 05:37:19,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-08 05:37:19,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:19,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:19,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 05:37:19,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:37:19,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:37:19,702 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:37:19,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:37:19,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552092950] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:37:19,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:37:19,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-02-08 05:37:19,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382582415] [2025-02-08 05:37:19,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:37:19,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 05:37:19,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:19,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 05:37:19,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-02-08 05:37:20,212 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 345 out of 387 [2025-02-08 05:37:20,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 334 transitions, 733 flow. Second operand has 15 states, 15 states have (on average 347.6666666666667) internal successors, (5215), 15 states have internal predecessors, (5215), 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:20,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:20,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 345 of 387 [2025-02-08 05:37:20,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:20,497 INFO L124 PetriNetUnfolderBase]: 10/575 cut-off events. [2025-02-08 05:37:20,497 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-02-08 05:37:20,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 680 conditions, 575 events. 10/575 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1526 event pairs, 0 based on Foata normal form. 4/541 useless extension candidates. Maximal degree in co-relation 612. Up to 10 conditions per place. [2025-02-08 05:37:20,501 INFO L140 encePairwiseOnDemand]: 367/387 looper letters, 20 selfloop transitions, 26 changer transitions 0/350 dead transitions. [2025-02-08 05:37:20,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 350 transitions, 861 flow [2025-02-08 05:37:20,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 05:37:20,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 05:37:20,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 3845 transitions. [2025-02-08 05:37:20,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9032182287996241 [2025-02-08 05:37:20,509 INFO L175 Difference]: Start difference. First operand has 339 places, 334 transitions, 733 flow. Second operand 11 states and 3845 transitions. [2025-02-08 05:37:20,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 350 transitions, 861 flow [2025-02-08 05:37:20,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 350 transitions, 857 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:20,518 INFO L231 Difference]: Finished difference. Result has 350 places, 346 transitions, 849 flow [2025-02-08 05:37:20,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=729, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=849, PETRI_PLACES=350, PETRI_TRANSITIONS=346} [2025-02-08 05:37:20,519 INFO L279 CegarLoopForPetriNet]: 354 programPoint places, -4 predicate places. [2025-02-08 05:37:20,519 INFO L471 AbstractCegarLoop]: Abstraction has has 350 places, 346 transitions, 849 flow [2025-02-08 05:37:20,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 347.6666666666667) internal successors, (5215), 15 states have internal predecessors, (5215), 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:20,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:20,522 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 05:37:20,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-08 05:37:20,723 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:20,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:20,724 INFO L85 PathProgramCache]: Analyzing trace with hash 2101801968, now seen corresponding path program 2 times [2025-02-08 05:37:20,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:20,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6674210] [2025-02-08 05:37:20,725 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:37:20,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:20,768 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 217 statements into 2 equivalence classes. [2025-02-08 05:37:20,786 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 127 of 217 statements. [2025-02-08 05:37:20,789 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:37:20,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:21,246 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-02-08 05:37:21,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:21,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6674210] [2025-02-08 05:37:21,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6674210] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:21,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:21,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:21,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18597449] [2025-02-08 05:37:21,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:21,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:21,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:21,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:21,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:21,485 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 352 out of 387 [2025-02-08 05:37:21,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 346 transitions, 849 flow. Second operand has 6 states, 6 states have (on average 354.8333333333333) internal successors, (2129), 6 states have internal predecessors, (2129), 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:21,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:21,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 352 of 387 [2025-02-08 05:37:21,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:21,631 INFO L124 PetriNetUnfolderBase]: 17/618 cut-off events. [2025-02-08 05:37:21,632 INFO L125 PetriNetUnfolderBase]: For 14/15 co-relation queries the response was YES. [2025-02-08 05:37:21,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 789 conditions, 618 events. 17/618 cut-off events. For 14/15 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1905 event pairs, 1 based on Foata normal form. 0/578 useless extension candidates. Maximal degree in co-relation 537. Up to 36 conditions per place. [2025-02-08 05:37:21,635 INFO L140 encePairwiseOnDemand]: 382/387 looper letters, 20 selfloop transitions, 4 changer transitions 0/349 dead transitions. [2025-02-08 05:37:21,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 349 transitions, 907 flow [2025-02-08 05:37:21,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:21,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:21,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2137 transitions. [2025-02-08 05:37:21,640 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9203273040482343 [2025-02-08 05:37:21,640 INFO L175 Difference]: Start difference. First operand has 350 places, 346 transitions, 849 flow. Second operand 6 states and 2137 transitions. [2025-02-08 05:37:21,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 349 transitions, 907 flow [2025-02-08 05:37:21,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 349 transitions, 883 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-02-08 05:37:21,646 INFO L231 Difference]: Finished difference. Result has 351 places, 345 transitions, 831 flow [2025-02-08 05:37:21,647 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=823, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=831, PETRI_PLACES=351, PETRI_TRANSITIONS=345} [2025-02-08 05:37:21,647 INFO L279 CegarLoopForPetriNet]: 354 programPoint places, -3 predicate places. [2025-02-08 05:37:21,647 INFO L471 AbstractCegarLoop]: Abstraction has has 351 places, 345 transitions, 831 flow [2025-02-08 05:37:21,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 354.8333333333333) internal successors, (2129), 6 states have internal predecessors, (2129), 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:21,648 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:21,649 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:37:21,649 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:21,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:21,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1812681022, now seen corresponding path program 1 times [2025-02-08 05:37:21,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:21,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335980209] [2025-02-08 05:37:21,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:21,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:21,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-02-08 05:37:21,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-02-08 05:37:21,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:21,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:21,738 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-02-08 05:37:21,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:21,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335980209] [2025-02-08 05:37:21,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335980209] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:21,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:21,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:21,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365747458] [2025-02-08 05:37:21,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:21,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:21,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:21,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:21,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:21,761 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 355 out of 387 [2025-02-08 05:37:21,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 345 transitions, 831 flow. Second operand has 3 states, 3 states have (on average 356.6666666666667) internal successors, (1070), 3 states have internal predecessors, (1070), 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:21,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:21,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 355 of 387 [2025-02-08 05:37:21,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:21,870 INFO L124 PetriNetUnfolderBase]: 16/665 cut-off events. [2025-02-08 05:37:21,871 INFO L125 PetriNetUnfolderBase]: For 15/16 co-relation queries the response was YES. [2025-02-08 05:37:21,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 803 conditions, 665 events. 16/665 cut-off events. For 15/16 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2062 event pairs, 2 based on Foata normal form. 1/623 useless extension candidates. Maximal degree in co-relation 680. Up to 17 conditions per place. [2025-02-08 05:37:21,875 INFO L140 encePairwiseOnDemand]: 378/387 looper letters, 7 selfloop transitions, 2 changer transitions 38/345 dead transitions. [2025-02-08 05:37:21,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 345 transitions, 866 flow [2025-02-08 05:37:21,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:21,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:21,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1086 transitions. [2025-02-08 05:37:21,878 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9354005167958657 [2025-02-08 05:37:21,878 INFO L175 Difference]: Start difference. First operand has 351 places, 345 transitions, 831 flow. Second operand 3 states and 1086 transitions. [2025-02-08 05:37:21,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 345 transitions, 866 flow [2025-02-08 05:37:21,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 345 transitions, 859 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:37:21,884 INFO L231 Difference]: Finished difference. Result has 346 places, 306 transitions, 753 flow [2025-02-08 05:37:21,884 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=816, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=753, PETRI_PLACES=346, PETRI_TRANSITIONS=306} [2025-02-08 05:37:21,885 INFO L279 CegarLoopForPetriNet]: 354 programPoint places, -8 predicate places. [2025-02-08 05:37:21,885 INFO L471 AbstractCegarLoop]: Abstraction has has 346 places, 306 transitions, 753 flow [2025-02-08 05:37:21,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 356.6666666666667) internal successors, (1070), 3 states have internal predecessors, (1070), 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:21,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:21,886 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:37:21,886 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:21,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:21,888 INFO L85 PathProgramCache]: Analyzing trace with hash -926004795, now seen corresponding path program 1 times [2025-02-08 05:37:21,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:21,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241006263] [2025-02-08 05:37:21,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:21,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:21,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-02-08 05:37:21,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-02-08 05:37:21,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:21,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:22,041 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-02-08 05:37:22,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:22,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241006263] [2025-02-08 05:37:22,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241006263] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:22,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:22,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:37:22,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020312577] [2025-02-08 05:37:22,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:22,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:37:22,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:22,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:37:22,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:37:22,100 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 363 out of 387 [2025-02-08 05:37:22,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 306 transitions, 753 flow. Second operand has 4 states, 4 states have (on average 364.5) internal successors, (1458), 4 states have internal predecessors, (1458), 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:22,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:22,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 363 of 387 [2025-02-08 05:37:22,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:22,189 INFO L124 PetriNetUnfolderBase]: 11/593 cut-off events. [2025-02-08 05:37:22,190 INFO L125 PetriNetUnfolderBase]: For 18/19 co-relation queries the response was YES. [2025-02-08 05:37:22,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 728 conditions, 593 events. 11/593 cut-off events. For 18/19 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1743 event pairs, 1 based on Foata normal form. 0/556 useless extension candidates. Maximal degree in co-relation 671. Up to 13 conditions per place. [2025-02-08 05:37:22,194 INFO L140 encePairwiseOnDemand]: 384/387 looper letters, 8 selfloop transitions, 2 changer transitions 0/305 dead transitions. [2025-02-08 05:37:22,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 305 transitions, 771 flow [2025-02-08 05:37:22,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:37:22,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 05:37:22,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1463 transitions. [2025-02-08 05:37:22,197 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9450904392764858 [2025-02-08 05:37:22,197 INFO L175 Difference]: Start difference. First operand has 346 places, 306 transitions, 753 flow. Second operand 4 states and 1463 transitions. [2025-02-08 05:37:22,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 305 transitions, 771 flow [2025-02-08 05:37:22,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 305 transitions, 765 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 05:37:22,203 INFO L231 Difference]: Finished difference. Result has 311 places, 303 transitions, 743 flow [2025-02-08 05:37:22,203 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=739, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=743, PETRI_PLACES=311, PETRI_TRANSITIONS=303} [2025-02-08 05:37:22,204 INFO L279 CegarLoopForPetriNet]: 354 programPoint places, -43 predicate places. [2025-02-08 05:37:22,204 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 303 transitions, 743 flow [2025-02-08 05:37:22,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 364.5) internal successors, (1458), 4 states have internal predecessors, (1458), 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:22,205 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:22,205 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:37:22,206 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:22,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:22,207 INFO L85 PathProgramCache]: Analyzing trace with hash -965823834, now seen corresponding path program 1 times [2025-02-08 05:37:22,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:22,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303684155] [2025-02-08 05:37:22,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:22,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:22,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-02-08 05:37:22,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-02-08 05:37:22,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:22,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:22,560 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-08 05:37:22,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:22,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303684155] [2025-02-08 05:37:22,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303684155] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:37:22,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354910555] [2025-02-08 05:37:22,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:22,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:37:22,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:37:22,563 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:37:22,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 05:37:22,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-02-08 05:37:22,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-02-08 05:37:22,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:22,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:22,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 05:37:22,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:37:23,070 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-08 05:37:23,071 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:37:23,273 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-08 05:37:23,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354910555] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:37:23,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:37:23,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2025-02-08 05:37:23,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751989320] [2025-02-08 05:37:23,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:37:23,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-08 05:37:23,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:23,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-08 05:37:23,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2025-02-08 05:37:23,971 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 345 out of 387 [2025-02-08 05:37:23,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 303 transitions, 743 flow. Second operand has 22 states, 22 states have (on average 347.59090909090907) internal successors, (7647), 22 states have internal predecessors, (7647), 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:23,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:23,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 345 of 387 [2025-02-08 05:37:23,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:24,414 INFO L124 PetriNetUnfolderBase]: 6/588 cut-off events. [2025-02-08 05:37:24,415 INFO L125 PetriNetUnfolderBase]: For 38/39 co-relation queries the response was YES. [2025-02-08 05:37:24,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 775 conditions, 588 events. 6/588 cut-off events. For 38/39 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1331 event pairs, 0 based on Foata normal form. 4/566 useless extension candidates. Maximal degree in co-relation 580. Up to 17 conditions per place. [2025-02-08 05:37:24,418 INFO L140 encePairwiseOnDemand]: 367/387 looper letters, 23 selfloop transitions, 38 changer transitions 0/323 dead transitions. [2025-02-08 05:37:24,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 323 transitions, 961 flow [2025-02-08 05:37:24,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-08 05:37:24,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-02-08 05:37:24,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 5930 transitions. [2025-02-08 05:37:24,429 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9013527891776866 [2025-02-08 05:37:24,430 INFO L175 Difference]: Start difference. First operand has 311 places, 303 transitions, 743 flow. Second operand 17 states and 5930 transitions. [2025-02-08 05:37:24,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 323 transitions, 961 flow [2025-02-08 05:37:24,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 323 transitions, 958 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:24,436 INFO L231 Difference]: Finished difference. Result has 328 places, 317 transitions, 924 flow [2025-02-08 05:37:24,437 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=924, PETRI_PLACES=328, PETRI_TRANSITIONS=317} [2025-02-08 05:37:24,437 INFO L279 CegarLoopForPetriNet]: 354 programPoint places, -26 predicate places. [2025-02-08 05:37:24,437 INFO L471 AbstractCegarLoop]: Abstraction has has 328 places, 317 transitions, 924 flow [2025-02-08 05:37:24,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 347.59090909090907) internal successors, (7647), 22 states have internal predecessors, (7647), 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:24,445 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:24,445 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 05:37:24,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:37:24,646 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:24,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:24,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1160334441, now seen corresponding path program 1 times [2025-02-08 05:37:24,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:24,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762706098] [2025-02-08 05:37:24,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:24,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:24,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes. [2025-02-08 05:37:24,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements. [2025-02-08 05:37:24,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:24,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:24,767 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2025-02-08 05:37:24,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:24,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762706098] [2025-02-08 05:37:24,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762706098] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:24,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:24,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:24,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10260586] [2025-02-08 05:37:24,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:24,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:24,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:24,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:24,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:24,794 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 359 out of 387 [2025-02-08 05:37:24,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 317 transitions, 924 flow. Second operand has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 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:24,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:24,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 359 of 387 [2025-02-08 05:37:24,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:24,886 INFO L124 PetriNetUnfolderBase]: 12/648 cut-off events. [2025-02-08 05:37:24,886 INFO L125 PetriNetUnfolderBase]: For 60/61 co-relation queries the response was YES. [2025-02-08 05:37:24,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 867 conditions, 648 events. 12/648 cut-off events. For 60/61 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1739 event pairs, 4 based on Foata normal form. 0/612 useless extension candidates. Maximal degree in co-relation 612. Up to 21 conditions per place. [2025-02-08 05:37:24,891 INFO L140 encePairwiseOnDemand]: 384/387 looper letters, 7 selfloop transitions, 2 changer transitions 1/317 dead transitions. [2025-02-08 05:37:24,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 317 transitions, 945 flow [2025-02-08 05:37:24,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:24,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:24,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1088 transitions. [2025-02-08 05:37:24,893 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9371231696813093 [2025-02-08 05:37:24,893 INFO L175 Difference]: Start difference. First operand has 328 places, 317 transitions, 924 flow. Second operand 3 states and 1088 transitions. [2025-02-08 05:37:24,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 317 transitions, 945 flow [2025-02-08 05:37:24,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 317 transitions, 893 flow, removed 8 selfloop flow, removed 8 redundant places. [2025-02-08 05:37:24,899 INFO L231 Difference]: Finished difference. Result has 321 places, 316 transitions, 874 flow [2025-02-08 05:37:24,900 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=874, PETRI_PLACES=321, PETRI_TRANSITIONS=316} [2025-02-08 05:37:24,900 INFO L279 CegarLoopForPetriNet]: 354 programPoint places, -33 predicate places. [2025-02-08 05:37:24,901 INFO L471 AbstractCegarLoop]: Abstraction has has 321 places, 316 transitions, 874 flow [2025-02-08 05:37:24,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 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:24,901 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:24,901 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 05:37:24,902 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:24,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:24,903 INFO L85 PathProgramCache]: Analyzing trace with hash -579459290, now seen corresponding path program 2 times [2025-02-08 05:37:24,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:24,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049252544] [2025-02-08 05:37:24,903 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:37:24,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:24,930 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 283 statements into 2 equivalence classes. [2025-02-08 05:37:24,935 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 133 of 283 statements. [2025-02-08 05:37:24,937 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:37:24,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:25,297 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2025-02-08 05:37:25,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:25,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049252544] [2025-02-08 05:37:25,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049252544] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:25,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:25,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:25,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908289499] [2025-02-08 05:37:25,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:25,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:25,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:25,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:25,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:25,550 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 352 out of 387 [2025-02-08 05:37:25,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 316 transitions, 874 flow. Second operand has 6 states, 6 states have (on average 355.0) internal successors, (2130), 6 states have internal predecessors, (2130), 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:25,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:25,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 352 of 387 [2025-02-08 05:37:25,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:25,651 INFO L124 PetriNetUnfolderBase]: 12/642 cut-off events. [2025-02-08 05:37:25,651 INFO L125 PetriNetUnfolderBase]: For 64/65 co-relation queries the response was YES. [2025-02-08 05:37:25,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 883 conditions, 642 events. 12/642 cut-off events. For 64/65 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1696 event pairs, 1 based on Foata normal form. 0/612 useless extension candidates. Maximal degree in co-relation 845. Up to 51 conditions per place. [2025-02-08 05:37:25,655 INFO L140 encePairwiseOnDemand]: 382/387 looper letters, 19 selfloop transitions, 4 changer transitions 0/319 dead transitions. [2025-02-08 05:37:25,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 319 transitions, 930 flow [2025-02-08 05:37:25,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:25,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:25,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2136 transitions. [2025-02-08 05:37:25,660 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9198966408268734 [2025-02-08 05:37:25,661 INFO L175 Difference]: Start difference. First operand has 321 places, 316 transitions, 874 flow. Second operand 6 states and 2136 transitions. [2025-02-08 05:37:25,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 319 transitions, 930 flow [2025-02-08 05:37:25,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 319 transitions, 926 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:25,668 INFO L231 Difference]: Finished difference. Result has 323 places, 315 transitions, 876 flow [2025-02-08 05:37:25,669 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=868, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=876, PETRI_PLACES=323, PETRI_TRANSITIONS=315} [2025-02-08 05:37:25,670 INFO L279 CegarLoopForPetriNet]: 354 programPoint places, -31 predicate places. [2025-02-08 05:37:25,670 INFO L471 AbstractCegarLoop]: Abstraction has has 323 places, 315 transitions, 876 flow [2025-02-08 05:37:25,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 355.0) internal successors, (2130), 6 states have internal predecessors, (2130), 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:25,671 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:25,671 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 05:37:25,672 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:25,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:25,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1460646997, now seen corresponding path program 1 times [2025-02-08 05:37:25,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:25,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169850361] [2025-02-08 05:37:25,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:25,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:25,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-02-08 05:37:25,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-02-08 05:37:25,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:25,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:26,533 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2025-02-08 05:37:26,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:26,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169850361] [2025-02-08 05:37:26,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169850361] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:26,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:26,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:26,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355391210] [2025-02-08 05:37:26,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:26,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:26,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:26,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:26,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:26,786 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 352 out of 387 [2025-02-08 05:37:26,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 315 transitions, 876 flow. Second operand has 6 states, 6 states have (on average 354.8333333333333) internal successors, (2129), 6 states have internal predecessors, (2129), 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:26,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:26,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 352 of 387 [2025-02-08 05:37:26,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:26,905 INFO L124 PetriNetUnfolderBase]: 13/617 cut-off events. [2025-02-08 05:37:26,905 INFO L125 PetriNetUnfolderBase]: For 58/59 co-relation queries the response was YES. [2025-02-08 05:37:26,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 867 conditions, 617 events. 13/617 cut-off events. For 58/59 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1543 event pairs, 1 based on Foata normal form. 0/592 useless extension candidates. Maximal degree in co-relation 741. Up to 51 conditions per place. [2025-02-08 05:37:26,908 INFO L140 encePairwiseOnDemand]: 382/387 looper letters, 19 selfloop transitions, 4 changer transitions 1/318 dead transitions. [2025-02-08 05:37:26,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 318 transitions, 932 flow [2025-02-08 05:37:26,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:26,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:26,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2136 transitions. [2025-02-08 05:37:26,913 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9198966408268734 [2025-02-08 05:37:26,913 INFO L175 Difference]: Start difference. First operand has 323 places, 315 transitions, 876 flow. Second operand 6 states and 2136 transitions. [2025-02-08 05:37:26,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 318 transitions, 932 flow [2025-02-08 05:37:26,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 318 transitions, 925 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:37:26,921 INFO L231 Difference]: Finished difference. Result has 323 places, 313 transitions, 873 flow [2025-02-08 05:37:26,922 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=867, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=873, PETRI_PLACES=323, PETRI_TRANSITIONS=313} [2025-02-08 05:37:26,922 INFO L279 CegarLoopForPetriNet]: 354 programPoint places, -31 predicate places. [2025-02-08 05:37:26,922 INFO L471 AbstractCegarLoop]: Abstraction has has 323 places, 313 transitions, 873 flow [2025-02-08 05:37:26,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 354.8333333333333) internal successors, (2129), 6 states have internal predecessors, (2129), 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:26,923 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:26,924 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 05:37:26,924 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:26,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:26,925 INFO L85 PathProgramCache]: Analyzing trace with hash -187656565, now seen corresponding path program 1 times [2025-02-08 05:37:26,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:26,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033436061] [2025-02-08 05:37:26,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:26,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:26,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-02-08 05:37:26,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-02-08 05:37:26,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:26,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:27,674 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2025-02-08 05:37:27,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:27,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033436061] [2025-02-08 05:37:27,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033436061] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:27,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:27,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:27,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137583896] [2025-02-08 05:37:27,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:27,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:27,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:27,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:27,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:27,914 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 352 out of 387 [2025-02-08 05:37:27,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 313 transitions, 873 flow. Second operand has 6 states, 6 states have (on average 355.0) internal successors, (2130), 6 states have internal predecessors, (2130), 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:27,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:27,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 352 of 387 [2025-02-08 05:37:27,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:28,031 INFO L124 PetriNetUnfolderBase]: 12/634 cut-off events. [2025-02-08 05:37:28,032 INFO L125 PetriNetUnfolderBase]: For 64/65 co-relation queries the response was YES. [2025-02-08 05:37:28,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 889 conditions, 634 events. 12/634 cut-off events. For 64/65 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1732 event pairs, 1 based on Foata normal form. 0/613 useless extension candidates. Maximal degree in co-relation 788. Up to 51 conditions per place. [2025-02-08 05:37:28,035 INFO L140 encePairwiseOnDemand]: 382/387 looper letters, 0 selfloop transitions, 0 changer transitions 316/316 dead transitions. [2025-02-08 05:37:28,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 316 transitions, 929 flow [2025-02-08 05:37:28,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:28,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:28,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2136 transitions. [2025-02-08 05:37:28,038 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9198966408268734 [2025-02-08 05:37:28,038 INFO L175 Difference]: Start difference. First operand has 323 places, 313 transitions, 873 flow. Second operand 6 states and 2136 transitions. [2025-02-08 05:37:28,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 316 transitions, 929 flow [2025-02-08 05:37:28,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 316 transitions, 922 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:37:28,044 INFO L231 Difference]: Finished difference. Result has 322 places, 0 transitions, 0 flow [2025-02-08 05:37:28,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=864, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=322, PETRI_TRANSITIONS=0} [2025-02-08 05:37:28,046 INFO L279 CegarLoopForPetriNet]: 354 programPoint places, -32 predicate places. [2025-02-08 05:37:28,046 INFO L471 AbstractCegarLoop]: Abstraction has has 322 places, 0 transitions, 0 flow [2025-02-08 05:37:28,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 355.0) internal successors, (2130), 6 states have internal predecessors, (2130), 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:28,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (49 of 50 remaining) [2025-02-08 05:37:28,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (48 of 50 remaining) [2025-02-08 05:37:28,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (47 of 50 remaining) [2025-02-08 05:37:28,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (46 of 50 remaining) [2025-02-08 05:37:28,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (45 of 50 remaining) [2025-02-08 05:37:28,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (44 of 50 remaining) [2025-02-08 05:37:28,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (43 of 50 remaining) [2025-02-08 05:37:28,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (42 of 50 remaining) [2025-02-08 05:37:28,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (41 of 50 remaining) [2025-02-08 05:37:28,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (40 of 50 remaining) [2025-02-08 05:37:28,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (39 of 50 remaining) [2025-02-08 05:37:28,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (38 of 50 remaining) [2025-02-08 05:37:28,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (37 of 50 remaining) [2025-02-08 05:37:28,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (36 of 50 remaining) [2025-02-08 05:37:28,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (35 of 50 remaining) [2025-02-08 05:37:28,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (34 of 50 remaining) [2025-02-08 05:37:28,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (33 of 50 remaining) [2025-02-08 05:37:28,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (32 of 50 remaining) [2025-02-08 05:37:28,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (31 of 50 remaining) [2025-02-08 05:37:28,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (30 of 50 remaining) [2025-02-08 05:37:28,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (29 of 50 remaining) [2025-02-08 05:37:28,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (28 of 50 remaining) [2025-02-08 05:37:28,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (27 of 50 remaining) [2025-02-08 05:37:28,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (26 of 50 remaining) [2025-02-08 05:37:28,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (25 of 50 remaining) [2025-02-08 05:37:28,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (24 of 50 remaining) [2025-02-08 05:37:28,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (23 of 50 remaining) [2025-02-08 05:37:28,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (22 of 50 remaining) [2025-02-08 05:37:28,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (21 of 50 remaining) [2025-02-08 05:37:28,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (20 of 50 remaining) [2025-02-08 05:37:28,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 50 remaining) [2025-02-08 05:37:28,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 50 remaining) [2025-02-08 05:37:28,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (17 of 50 remaining) [2025-02-08 05:37:28,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (16 of 50 remaining) [2025-02-08 05:37:28,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (15 of 50 remaining) [2025-02-08 05:37:28,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (14 of 50 remaining) [2025-02-08 05:37:28,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (13 of 50 remaining) [2025-02-08 05:37:28,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (12 of 50 remaining) [2025-02-08 05:37:28,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (11 of 50 remaining) [2025-02-08 05:37:28,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (10 of 50 remaining) [2025-02-08 05:37:28,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (9 of 50 remaining) [2025-02-08 05:37:28,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (8 of 50 remaining) [2025-02-08 05:37:28,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (7 of 50 remaining) [2025-02-08 05:37:28,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (6 of 50 remaining) [2025-02-08 05:37:28,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (5 of 50 remaining) [2025-02-08 05:37:28,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (4 of 50 remaining) [2025-02-08 05:37:28,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (3 of 50 remaining) [2025-02-08 05:37:28,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (2 of 50 remaining) [2025-02-08 05:37:28,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (1 of 50 remaining) [2025-02-08 05:37:28,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (0 of 50 remaining) [2025-02-08 05:37:28,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 05:37:28,054 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 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:28,059 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:37:28,059 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:37:28,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:37:28 BasicIcfg [2025-02-08 05:37:28,066 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:37:28,067 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:37:28,067 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:37:28,067 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:37:28,068 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:14" (3/4) ... [2025-02-08 05:37:28,069 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:37:28,072 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:37:28,072 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:37:28,079 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2025-02-08 05:37:28,079 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:37:28,079 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:37:28,080 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:37:28,163 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:37:28,163 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:37:28,164 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:37:28,164 INFO L158 Benchmark]: Toolchain (without parser) took 15207.35ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 105.4MB in the beginning and 308.7MB in the end (delta: -203.4MB). Peak memory consumption was 127.6MB. Max. memory is 16.1GB. [2025-02-08 05:37:28,164 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:37:28,165 INFO L158 Benchmark]: CACSL2BoogieTranslator took 298.24ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 92.6MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:28,165 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.31ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 89.7MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:28,165 INFO L158 Benchmark]: Boogie Preprocessor took 44.55ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 87.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:37:28,165 INFO L158 Benchmark]: IcfgBuilder took 861.19ms. Allocated memory is still 142.6MB. Free memory was 87.9MB in the beginning and 56.8MB in the end (delta: 31.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-08 05:37:28,165 INFO L158 Benchmark]: TraceAbstraction took 13844.55ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 55.9MB in the beginning and 317.1MB in the end (delta: -261.2MB). Peak memory consumption was 68.9MB. Max. memory is 16.1GB. [2025-02-08 05:37:28,166 INFO L158 Benchmark]: Witness Printer took 96.52ms. Allocated memory is still 478.2MB. Free memory was 317.1MB in the beginning and 308.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:28,167 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.38ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 298.24ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 92.6MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.31ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 89.7MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.55ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 87.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 861.19ms. Allocated memory is still 142.6MB. Free memory was 87.9MB in the beginning and 56.8MB in the end (delta: 31.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 13844.55ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 55.9MB in the beginning and 317.1MB in the end (delta: -261.2MB). Peak memory consumption was 68.9MB. Max. memory is 16.1GB. * Witness Printer took 96.52ms. Allocated memory is still 478.2MB. Free memory was 317.1MB in the beginning and 308.7MB 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: 49]: 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: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: 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: 68]: 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: 72]: 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: 68]: 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: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: 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: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: 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 5 procedures, 530 locations, 50 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: 13.6s, OverallIterations: 24, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2257 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1484 mSDsluCounter, 1176 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 886 mSDsCounter, 338 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4256 IncrementalHoareTripleChecker+Invalid, 4594 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 338 mSolverCounterUnsat, 290 mSDtfsCounter, 4256 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 871 GetRequests, 766 SyntacticMatches, 5 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=924occurred in iteration=20, InterpolantAutomatonStates: 113, 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.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 4137 NumberOfCodeBlocks, 3897 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 4489 ConstructedInterpolants, 0 QuantifiedInterpolants, 6294 SizeOfPredicates, 14 NumberOfNonLiveVariables, 856 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 28 InterpolantComputations, 22 PerfectInterpolantSequences, 1677/1824 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 34 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:37:28,184 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