./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-buffer-mult2.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/popl20-more-buffer-mult2.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 dbff9cba9b3794b18d55ca52c1abf6279404a7b220f91d79730a04b586f9ee44 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:40:18,153 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:40:18,235 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:40:18,239 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:40:18,240 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:40:18,269 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:40:18,270 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:40:18,271 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:40:18,271 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:40:18,272 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:40:18,272 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:40:18,272 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:40:18,272 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:40:18,273 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:40:18,273 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:40:18,274 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:40:18,274 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:40:18,274 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:40:18,274 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:40:18,274 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:40:18,274 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:40:18,275 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:40:18,275 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:40:18,275 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:40:18,275 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:40:18,275 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:40:18,275 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:40:18,275 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:40:18,275 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:40:18,275 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:40:18,275 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:40:18,275 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:40:18,276 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:40:18,276 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:40:18,276 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:40:18,276 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:40:18,276 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:40:18,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:40:18,276 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:40:18,276 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:40:18,276 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:40:18,276 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:40:18,276 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 -> dbff9cba9b3794b18d55ca52c1abf6279404a7b220f91d79730a04b586f9ee44 [2025-02-08 05:40:18,580 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:40:18,589 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:40:18,593 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:40:18,594 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:40:18,594 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:40:18,596 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-buffer-mult2.wvr.c [2025-02-08 05:40:19,892 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e1637e9f1/5a268aec32dc44c39ef928e14fd46cd8/FLAG65a829552 [2025-02-08 05:40:20,153 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:40:20,154 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-mult2.wvr.c [2025-02-08 05:40:20,161 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e1637e9f1/5a268aec32dc44c39ef928e14fd46cd8/FLAG65a829552 [2025-02-08 05:40:20,175 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e1637e9f1/5a268aec32dc44c39ef928e14fd46cd8 [2025-02-08 05:40:20,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:40:20,179 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:40:20,181 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:40:20,181 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:40:20,184 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:40:20,185 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:40:20" (1/1) ... [2025-02-08 05:40:20,186 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@605446ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:20, skipping insertion in model container [2025-02-08 05:40:20,187 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:40:20" (1/1) ... [2025-02-08 05:40:20,207 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:40:20,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:40:20,400 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:40:20,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:40:20,453 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:40:20,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:20 WrapperNode [2025-02-08 05:40:20,454 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:40:20,455 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:40:20,455 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:40:20,456 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:40:20,462 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:40:20" (1/1) ... [2025-02-08 05:40:20,476 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:40:20" (1/1) ... [2025-02-08 05:40:20,535 INFO L138 Inliner]: procedures = 26, calls = 57, calls flagged for inlining = 19, calls inlined = 23, statements flattened = 556 [2025-02-08 05:40:20,539 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:40:20,539 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:40:20,539 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:40:20,539 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:40:20,546 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:20" (1/1) ... [2025-02-08 05:40:20,547 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:20" (1/1) ... [2025-02-08 05:40:20,553 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:20" (1/1) ... [2025-02-08 05:40:20,556 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:20" (1/1) ... [2025-02-08 05:40:20,581 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:20" (1/1) ... [2025-02-08 05:40:20,583 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:20" (1/1) ... [2025-02-08 05:40:20,585 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:20" (1/1) ... [2025-02-08 05:40:20,587 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:20" (1/1) ... [2025-02-08 05:40:20,590 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:40:20,591 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:40:20,591 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:40:20,591 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:40:20,592 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:20" (1/1) ... [2025-02-08 05:40:20,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:40:20,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:40:20,629 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:40:20,633 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:40:20,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:40:20,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:40:20,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:40:20,656 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:40:20,656 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:40:20,656 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:40:20,656 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:40:20,657 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 05:40:20,657 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 05:40:20,657 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-08 05:40:20,657 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-08 05:40:20,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:40:20,657 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 05:40:20,657 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 05:40:20,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:40:20,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:40:20,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:40:20,659 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:40:20,794 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:40:20,796 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:40:21,285 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L93: havoc #t~nondet20#1; [2025-02-08 05:40:21,286 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L93-1: assume #race~q1_front~0 == #t~nondet20#1; [2025-02-08 05:40:21,286 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L93-1: assume !(#race~q1_front~0 == #t~nondet20#1); [2025-02-08 05:40:21,286 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L93-2: havoc #t~post19#1; [2025-02-08 05:40:21,286 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L93-3: #race~q1_front~0 := #t~nondet20#1; [2025-02-08 05:40:21,286 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L93-4: havoc #t~nondet20#1; [2025-02-08 05:40:21,286 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L93-5: ~q1_front~0 := 1 + #t~post19#1; [2025-02-08 05:40:21,286 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L93-6: assume 0 == #race~q1_front~0; [2025-02-08 05:40:21,287 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L93-6: assume !(0 == #race~q1_front~0); [2025-02-08 05:40:21,287 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L93-7: #t~post19#1 := ~q1_front~0; [2025-02-08 05:40:21,287 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L93-8: #race~q1_front~0 := 0; [2025-02-08 05:40:21,287 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L94: [2025-02-08 05:40:21,287 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L95: #race~i~0 := 0; [2025-02-08 05:40:21,287 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96: havoc #t~short21#1; [2025-02-08 05:40:21,287 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-1: ~cond~2#1 := (if 0 == (if #t~short21#1 then 1 else 0) then 0 else 1); [2025-02-08 05:40:21,287 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-2: assume 0 == #race~q1_back~0; [2025-02-08 05:40:21,287 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-2: assume !(0 == #race~q1_back~0); [2025-02-08 05:40:21,288 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-3: #t~short21#1 := ~q1_front~0 < ~q1_back~0; [2025-02-08 05:40:21,288 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-4: assume 0 == #race~q1_front~0; [2025-02-08 05:40:21,288 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-4: assume !(0 == #race~q1_front~0); [2025-02-08 05:40:21,288 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-5: #race~q1_back~0 := 0; [2025-02-08 05:40:21,288 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-6: assume #t~short21#1; [2025-02-08 05:40:21,288 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-6: assume !#t~short21#1; [2025-02-08 05:40:21,288 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-7: #race~q1_front~0 := 0; [2025-02-08 05:40:21,288 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-8: assume 0 == #race~N~0; [2025-02-08 05:40:21,288 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-8: assume !(0 == #race~N~0); [2025-02-08 05:40:21,288 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-9: #t~short21#1 := ~i~0 < ~N~0; [2025-02-08 05:40:21,288 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-10: assume 0 == #race~i~0; [2025-02-08 05:40:21,288 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-10: assume !(0 == #race~i~0); [2025-02-08 05:40:21,288 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-11: #race~N~0 := 0; [2025-02-08 05:40:21,288 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L97: [2025-02-08 05:40:21,288 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92: havoc #t~nondet18#1; [2025-02-08 05:40:21,288 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-1: havoc #t~ret17#1; [2025-02-08 05:40:21,288 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-2: assume #race~total~0 == #t~nondet18#1; [2025-02-08 05:40:21,288 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-2: assume !(#race~total~0 == #t~nondet18#1); [2025-02-08 05:40:21,288 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-3: havoc #t~mem16#1; [2025-02-08 05:40:21,289 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-4: #race~total~0 := #t~nondet18#1; [2025-02-08 05:40:21,289 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-5: havoc #t~nondet18#1; [2025-02-08 05:40:21,289 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-6: ~total~0 := #t~ret17#1; [2025-02-08 05:40:21,289 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-7: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret17#1 && #t~ret17#1 <= 2147483647; [2025-02-08 05:40:21,289 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-8: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:40:21,289 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-9: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:40:21,289 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-10: #t~ret17#1 := plus_#res#1; [2025-02-08 05:40:21,640 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110: havoc #t~nondet27#1; [2025-02-08 05:40:21,640 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-1: havoc #t~ret26#1; [2025-02-08 05:40:21,640 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-2: assume #race~total~0 == #t~nondet27#1; [2025-02-08 05:40:21,640 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-2: assume !(#race~total~0 == #t~nondet27#1); [2025-02-08 05:40:21,640 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-3: havoc #t~mem25#1; [2025-02-08 05:40:21,640 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-4: #race~total~0 := #t~nondet27#1; [2025-02-08 05:40:21,640 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-5: havoc #t~nondet27#1; [2025-02-08 05:40:21,640 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-6: ~total~0 := #t~ret26#1; [2025-02-08 05:40:21,640 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-7: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647; [2025-02-08 05:40:21,640 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-8: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:40:21,640 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-9: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:40:21,641 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-10: #t~ret26#1 := plus_#res#1; [2025-02-08 05:40:21,641 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L111: havoc #t~nondet29#1; [2025-02-08 05:40:21,641 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L111-1: assume #race~q2_front~0 == #t~nondet29#1; [2025-02-08 05:40:21,641 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L111-1: assume !(#race~q2_front~0 == #t~nondet29#1); [2025-02-08 05:40:21,641 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L111-2: havoc #t~post28#1; [2025-02-08 05:40:21,641 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L111-3: #race~q2_front~0 := #t~nondet29#1; [2025-02-08 05:40:21,641 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L111-4: havoc #t~nondet29#1; [2025-02-08 05:40:21,641 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L111-5: ~q2_front~0 := 1 + #t~post28#1; [2025-02-08 05:40:21,641 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L111-6: assume 0 == #race~q2_front~0; [2025-02-08 05:40:21,641 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L111-6: assume !(0 == #race~q2_front~0); [2025-02-08 05:40:21,641 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L111-7: #t~post28#1 := ~q2_front~0; [2025-02-08 05:40:21,641 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L111-8: #race~q2_front~0 := 0; [2025-02-08 05:40:21,641 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112: [2025-02-08 05:40:21,641 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113: #race~j~0 := 0; [2025-02-08 05:40:21,641 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114: havoc #t~short30#1; [2025-02-08 05:40:21,641 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-1: ~cond~3#1 := (if 0 == (if #t~short30#1 then 1 else 0) then 0 else 1); [2025-02-08 05:40:21,641 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-2: assume 0 == #race~q2_back~0; [2025-02-08 05:40:21,641 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-2: assume !(0 == #race~q2_back~0); [2025-02-08 05:40:21,642 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-3: #t~short30#1 := ~q2_front~0 < ~q2_back~0; [2025-02-08 05:40:21,642 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-4: assume 0 == #race~q2_front~0; [2025-02-08 05:40:21,642 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-4: assume !(0 == #race~q2_front~0); [2025-02-08 05:40:21,642 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-5: #race~q2_back~0 := 0; [2025-02-08 05:40:21,642 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-6: assume #t~short30#1; [2025-02-08 05:40:21,642 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-6: assume !#t~short30#1; [2025-02-08 05:40:21,642 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-7: #race~q2_front~0 := 0; [2025-02-08 05:40:21,642 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-8: assume 0 == #race~N~0; [2025-02-08 05:40:21,642 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-8: assume !(0 == #race~N~0); [2025-02-08 05:40:21,642 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-9: #t~short30#1 := ~j~0 < ~N~0; [2025-02-08 05:40:21,642 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-10: assume 0 == #race~j~0; [2025-02-08 05:40:21,642 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-10: assume !(0 == #race~j~0); [2025-02-08 05:40:21,642 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-11: #race~N~0 := 0; [2025-02-08 05:40:21,642 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L115: [2025-02-08 05:40:21,643 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:40:21,643 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:40:22,011 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L167 is not an error location. [2025-02-08 05:40:22,012 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L167 is not an error location. [2025-02-08 05:40:22,013 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:40:22,013 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:40:22,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:40:22 BoogieIcfgContainer [2025-02-08 05:40:22,014 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:40:22,015 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:40:22,016 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:40:22,019 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:40:22,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:40:20" (1/3) ... [2025-02-08 05:40:22,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24586617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:40:22, skipping insertion in model container [2025-02-08 05:40:22,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:20" (2/3) ... [2025-02-08 05:40:22,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24586617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:40:22, skipping insertion in model container [2025-02-08 05:40:22,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:40:22" (3/3) ... [2025-02-08 05:40:22,022 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-mult2.wvr.c [2025-02-08 05:40:22,037 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:40:22,039 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-mult2.wvr.c that has 5 procedures, 355 locations, 1 initial locations, 6 loop locations, and 89 error locations. [2025-02-08 05:40:22,041 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:40:22,197 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-08 05:40:22,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 367 places, 365 transitions, 758 flow [2025-02-08 05:40:22,371 INFO L124 PetriNetUnfolderBase]: 11/361 cut-off events. [2025-02-08 05:40:22,373 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:40:22,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 378 conditions, 361 events. 11/361 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 498 event pairs, 0 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 321. Up to 2 conditions per place. [2025-02-08 05:40:22,382 INFO L82 GeneralOperation]: Start removeDead. Operand has 367 places, 365 transitions, 758 flow [2025-02-08 05:40:22,393 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 347 places, 344 transitions, 712 flow [2025-02-08 05:40:22,404 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:40:22,419 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;@7471c99f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:40:22,419 INFO L334 AbstractCegarLoop]: Starting to check reachability of 135 error locations. [2025-02-08 05:40:22,426 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:40:22,427 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-02-08 05:40:22,427 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:40:22,427 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:22,428 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] [2025-02-08 05:40:22,428 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:40:22,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:22,436 INFO L85 PathProgramCache]: Analyzing trace with hash 680044834, now seen corresponding path program 1 times [2025-02-08 05:40:22,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:22,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923420010] [2025-02-08 05:40:22,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:22,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:22,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 05:40:22,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 05:40:22,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:22,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:22,602 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:40:22,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:22,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923420010] [2025-02-08 05:40:22,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923420010] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:22,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:22,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:22,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475591203] [2025-02-08 05:40:22,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:22,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:22,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:22,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:22,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:22,672 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 365 [2025-02-08 05:40:22,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 344 transitions, 712 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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:40:22,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:22,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 365 [2025-02-08 05:40:22,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:23,144 INFO L124 PetriNetUnfolderBase]: 363/1060 cut-off events. [2025-02-08 05:40:23,145 INFO L125 PetriNetUnfolderBase]: For 158/158 co-relation queries the response was YES. [2025-02-08 05:40:23,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1712 conditions, 1060 events. 363/1060 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5058 event pairs, 272 based on Foata normal form. 5/942 useless extension candidates. Maximal degree in co-relation 1363. Up to 525 conditions per place. [2025-02-08 05:40:23,155 INFO L140 encePairwiseOnDemand]: 301/365 looper letters, 20 selfloop transitions, 2 changer transitions 7/282 dead transitions. [2025-02-08 05:40:23,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 282 transitions, 636 flow [2025-02-08 05:40:23,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:23,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:23,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 914 transitions. [2025-02-08 05:40:23,175 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8347031963470319 [2025-02-08 05:40:23,177 INFO L175 Difference]: Start difference. First operand has 347 places, 344 transitions, 712 flow. Second operand 3 states and 914 transitions. [2025-02-08 05:40:23,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 282 transitions, 636 flow [2025-02-08 05:40:23,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 282 transitions, 620 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-02-08 05:40:23,192 INFO L231 Difference]: Finished difference. Result has 284 places, 275 transitions, 562 flow [2025-02-08 05:40:23,196 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=562, PETRI_PLACES=284, PETRI_TRANSITIONS=275} [2025-02-08 05:40:23,200 INFO L279 CegarLoopForPetriNet]: 347 programPoint places, -63 predicate places. [2025-02-08 05:40:23,201 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 275 transitions, 562 flow [2025-02-08 05:40:23,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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:40:23,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:23,202 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:23,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:40:23,202 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:40:23,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:23,204 INFO L85 PathProgramCache]: Analyzing trace with hash -712041412, now seen corresponding path program 1 times [2025-02-08 05:40:23,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:23,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725575776] [2025-02-08 05:40:23,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:23,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:23,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 05:40:23,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 05:40:23,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:23,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:23,273 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:40:23,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:23,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725575776] [2025-02-08 05:40:23,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725575776] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:23,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:23,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:23,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619136646] [2025-02-08 05:40:23,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:23,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:23,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:23,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:23,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:23,292 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 365 [2025-02-08 05:40:23,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 275 transitions, 562 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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:40:23,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:23,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 365 [2025-02-08 05:40:23,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:23,504 INFO L124 PetriNetUnfolderBase]: 171/699 cut-off events. [2025-02-08 05:40:23,505 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:40:23,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 994 conditions, 699 events. 171/699 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2637 event pairs, 121 based on Foata normal form. 0/608 useless extension candidates. Maximal degree in co-relation 955. Up to 258 conditions per place. [2025-02-08 05:40:23,511 INFO L140 encePairwiseOnDemand]: 362/365 looper letters, 20 selfloop transitions, 2 changer transitions 0/274 dead transitions. [2025-02-08 05:40:23,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 274 transitions, 604 flow [2025-02-08 05:40:23,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:23,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:23,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 851 transitions. [2025-02-08 05:40:23,515 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7771689497716895 [2025-02-08 05:40:23,515 INFO L175 Difference]: Start difference. First operand has 284 places, 275 transitions, 562 flow. Second operand 3 states and 851 transitions. [2025-02-08 05:40:23,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 274 transitions, 604 flow [2025-02-08 05:40:23,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 274 transitions, 600 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:23,525 INFO L231 Difference]: Finished difference. Result has 276 places, 274 transitions, 560 flow [2025-02-08 05:40:23,525 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=560, PETRI_PLACES=276, PETRI_TRANSITIONS=274} [2025-02-08 05:40:23,526 INFO L279 CegarLoopForPetriNet]: 347 programPoint places, -71 predicate places. [2025-02-08 05:40:23,526 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 274 transitions, 560 flow [2025-02-08 05:40:23,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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:40:23,527 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:23,527 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] [2025-02-08 05:40:23,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:40:23,528 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:40:23,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:23,528 INFO L85 PathProgramCache]: Analyzing trace with hash 662130263, now seen corresponding path program 1 times [2025-02-08 05:40:23,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:23,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112256118] [2025-02-08 05:40:23,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:23,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:23,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 05:40:23,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 05:40:23,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:23,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:23,618 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:40:23,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:23,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112256118] [2025-02-08 05:40:23,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112256118] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:23,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:23,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:23,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460760561] [2025-02-08 05:40:23,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:23,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:23,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:23,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:23,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:23,643 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 365 [2025-02-08 05:40:23,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 274 transitions, 560 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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:40:23,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:23,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 365 [2025-02-08 05:40:23,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:23,809 INFO L124 PetriNetUnfolderBase]: 171/698 cut-off events. [2025-02-08 05:40:23,810 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:40:23,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 993 conditions, 698 events. 171/698 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2615 event pairs, 121 based on Foata normal form. 0/608 useless extension candidates. Maximal degree in co-relation 946. Up to 258 conditions per place. [2025-02-08 05:40:23,816 INFO L140 encePairwiseOnDemand]: 362/365 looper letters, 20 selfloop transitions, 2 changer transitions 0/273 dead transitions. [2025-02-08 05:40:23,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 273 transitions, 602 flow [2025-02-08 05:40:23,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:23,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:23,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 851 transitions. [2025-02-08 05:40:23,821 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7771689497716895 [2025-02-08 05:40:23,823 INFO L175 Difference]: Start difference. First operand has 276 places, 274 transitions, 560 flow. Second operand 3 states and 851 transitions. [2025-02-08 05:40:23,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 273 transitions, 602 flow [2025-02-08 05:40:23,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 273 transitions, 598 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:23,829 INFO L231 Difference]: Finished difference. Result has 275 places, 273 transitions, 558 flow [2025-02-08 05:40:23,830 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=558, PETRI_PLACES=275, PETRI_TRANSITIONS=273} [2025-02-08 05:40:23,831 INFO L279 CegarLoopForPetriNet]: 347 programPoint places, -72 predicate places. [2025-02-08 05:40:23,832 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 273 transitions, 558 flow [2025-02-08 05:40:23,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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:40:23,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:23,835 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] [2025-02-08 05:40:23,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:40:23,835 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:40:23,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:23,837 INFO L85 PathProgramCache]: Analyzing trace with hash -753120539, now seen corresponding path program 1 times [2025-02-08 05:40:23,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:23,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040151155] [2025-02-08 05:40:23,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:23,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:23,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 05:40:23,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 05:40:23,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:23,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:23,928 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:40:23,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:23,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040151155] [2025-02-08 05:40:23,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040151155] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:23,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:23,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:23,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620238276] [2025-02-08 05:40:23,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:23,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:23,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:23,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:23,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:23,950 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 365 [2025-02-08 05:40:23,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 273 transitions, 558 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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:40:23,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:23,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 365 [2025-02-08 05:40:23,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:24,132 INFO L124 PetriNetUnfolderBase]: 171/697 cut-off events. [2025-02-08 05:40:24,133 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:40:24,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 992 conditions, 697 events. 171/697 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2632 event pairs, 121 based on Foata normal form. 0/608 useless extension candidates. Maximal degree in co-relation 937. Up to 258 conditions per place. [2025-02-08 05:40:24,138 INFO L140 encePairwiseOnDemand]: 362/365 looper letters, 20 selfloop transitions, 2 changer transitions 0/272 dead transitions. [2025-02-08 05:40:24,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 272 transitions, 600 flow [2025-02-08 05:40:24,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:24,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:24,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 851 transitions. [2025-02-08 05:40:24,141 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7771689497716895 [2025-02-08 05:40:24,142 INFO L175 Difference]: Start difference. First operand has 275 places, 273 transitions, 558 flow. Second operand 3 states and 851 transitions. [2025-02-08 05:40:24,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 272 transitions, 600 flow [2025-02-08 05:40:24,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 272 transitions, 596 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:24,149 INFO L231 Difference]: Finished difference. Result has 274 places, 272 transitions, 556 flow [2025-02-08 05:40:24,150 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=556, PETRI_PLACES=274, PETRI_TRANSITIONS=272} [2025-02-08 05:40:24,151 INFO L279 CegarLoopForPetriNet]: 347 programPoint places, -73 predicate places. [2025-02-08 05:40:24,152 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 272 transitions, 556 flow [2025-02-08 05:40:24,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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:40:24,153 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:24,153 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] [2025-02-08 05:40:24,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:40:24,153 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:40:24,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:24,154 INFO L85 PathProgramCache]: Analyzing trace with hash -2004677231, now seen corresponding path program 1 times [2025-02-08 05:40:24,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:24,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377069633] [2025-02-08 05:40:24,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:24,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:24,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-08 05:40:24,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-08 05:40:24,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:24,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:24,239 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:40:24,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:24,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377069633] [2025-02-08 05:40:24,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377069633] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:24,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:24,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:24,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205342041] [2025-02-08 05:40:24,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:24,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:24,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:24,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:24,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:24,261 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 365 [2025-02-08 05:40:24,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 272 transitions, 556 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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:40:24,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:24,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 365 [2025-02-08 05:40:24,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:24,424 INFO L124 PetriNetUnfolderBase]: 171/696 cut-off events. [2025-02-08 05:40:24,424 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:40:24,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 991 conditions, 696 events. 171/696 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2640 event pairs, 121 based on Foata normal form. 0/608 useless extension candidates. Maximal degree in co-relation 928. Up to 258 conditions per place. [2025-02-08 05:40:24,428 INFO L140 encePairwiseOnDemand]: 362/365 looper letters, 20 selfloop transitions, 2 changer transitions 0/271 dead transitions. [2025-02-08 05:40:24,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 271 transitions, 598 flow [2025-02-08 05:40:24,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:24,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:24,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 851 transitions. [2025-02-08 05:40:24,430 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7771689497716895 [2025-02-08 05:40:24,431 INFO L175 Difference]: Start difference. First operand has 274 places, 272 transitions, 556 flow. Second operand 3 states and 851 transitions. [2025-02-08 05:40:24,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 271 transitions, 598 flow [2025-02-08 05:40:24,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 271 transitions, 594 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:24,435 INFO L231 Difference]: Finished difference. Result has 273 places, 271 transitions, 554 flow [2025-02-08 05:40:24,436 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=554, PETRI_PLACES=273, PETRI_TRANSITIONS=271} [2025-02-08 05:40:24,436 INFO L279 CegarLoopForPetriNet]: 347 programPoint places, -74 predicate places. [2025-02-08 05:40:24,438 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 271 transitions, 554 flow [2025-02-08 05:40:24,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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:40:24,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:24,439 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] [2025-02-08 05:40:24,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:40:24,439 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:40:24,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:24,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1356624134, now seen corresponding path program 1 times [2025-02-08 05:40:24,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:24,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826325505] [2025-02-08 05:40:24,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:24,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:24,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 05:40:24,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 05:40:24,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:24,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:24,502 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:40:24,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:24,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826325505] [2025-02-08 05:40:24,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826325505] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:24,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:24,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:24,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578404714] [2025-02-08 05:40:24,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:24,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:24,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:24,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:24,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:24,516 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 365 [2025-02-08 05:40:24,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 271 transitions, 554 flow. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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:40:24,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:24,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 365 [2025-02-08 05:40:24,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:24,624 INFO L124 PetriNetUnfolderBase]: 171/695 cut-off events. [2025-02-08 05:40:24,624 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-08 05:40:24,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 987 conditions, 695 events. 171/695 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2633 event pairs, 121 based on Foata normal form. 0/608 useless extension candidates. Maximal degree in co-relation 916. Up to 255 conditions per place. [2025-02-08 05:40:24,629 INFO L140 encePairwiseOnDemand]: 363/365 looper letters, 18 selfloop transitions, 1 changer transitions 0/270 dead transitions. [2025-02-08 05:40:24,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 270 transitions, 590 flow [2025-02-08 05:40:24,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:24,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:24,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 860 transitions. [2025-02-08 05:40:24,632 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7853881278538812 [2025-02-08 05:40:24,632 INFO L175 Difference]: Start difference. First operand has 273 places, 271 transitions, 554 flow. Second operand 3 states and 860 transitions. [2025-02-08 05:40:24,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 270 transitions, 590 flow [2025-02-08 05:40:24,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 270 transitions, 586 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:24,637 INFO L231 Difference]: Finished difference. Result has 272 places, 270 transitions, 550 flow [2025-02-08 05:40:24,638 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=550, PETRI_PLACES=272, PETRI_TRANSITIONS=270} [2025-02-08 05:40:24,639 INFO L279 CegarLoopForPetriNet]: 347 programPoint places, -75 predicate places. [2025-02-08 05:40:24,639 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 270 transitions, 550 flow [2025-02-08 05:40:24,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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:40:24,640 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:24,640 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] [2025-02-08 05:40:24,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:40:24,641 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:40:24,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:24,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1104979497, now seen corresponding path program 1 times [2025-02-08 05:40:24,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:24,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603209320] [2025-02-08 05:40:24,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:24,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:24,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-08 05:40:24,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 05:40:24,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:24,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:24,708 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:40:24,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:24,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603209320] [2025-02-08 05:40:24,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603209320] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:24,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:24,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:24,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468126703] [2025-02-08 05:40:24,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:24,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:24,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:24,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:24,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:24,719 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 365 [2025-02-08 05:40:24,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 270 transitions, 550 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 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:40:24,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:24,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 365 [2025-02-08 05:40:24,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:24,829 INFO L124 PetriNetUnfolderBase]: 171/694 cut-off events. [2025-02-08 05:40:24,829 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:40:24,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 987 conditions, 694 events. 171/694 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2630 event pairs, 121 based on Foata normal form. 0/608 useless extension candidates. Maximal degree in co-relation 916. Up to 257 conditions per place. [2025-02-08 05:40:24,834 INFO L140 encePairwiseOnDemand]: 362/365 looper letters, 19 selfloop transitions, 2 changer transitions 0/269 dead transitions. [2025-02-08 05:40:24,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 269 transitions, 590 flow [2025-02-08 05:40:24,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:24,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:24,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 853 transitions. [2025-02-08 05:40:24,836 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7789954337899543 [2025-02-08 05:40:24,837 INFO L175 Difference]: Start difference. First operand has 272 places, 270 transitions, 550 flow. Second operand 3 states and 853 transitions. [2025-02-08 05:40:24,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 269 transitions, 590 flow [2025-02-08 05:40:24,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 269 transitions, 589 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:24,841 INFO L231 Difference]: Finished difference. Result has 272 places, 269 transitions, 551 flow [2025-02-08 05:40:24,842 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=551, PETRI_PLACES=272, PETRI_TRANSITIONS=269} [2025-02-08 05:40:24,843 INFO L279 CegarLoopForPetriNet]: 347 programPoint places, -75 predicate places. [2025-02-08 05:40:24,843 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 269 transitions, 551 flow [2025-02-08 05:40:24,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 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:40:24,844 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:24,844 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:40:24,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:40:24,844 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:40:24,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:24,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1191771985, now seen corresponding path program 1 times [2025-02-08 05:40:24,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:24,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903482013] [2025-02-08 05:40:24,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:24,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:24,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-08 05:40:24,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-08 05:40:24,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:24,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:24,904 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:40:24,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:24,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903482013] [2025-02-08 05:40:24,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903482013] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:24,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:24,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:24,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754651508] [2025-02-08 05:40:24,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:24,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:24,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:24,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:24,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:24,923 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 365 [2025-02-08 05:40:24,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 269 transitions, 551 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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:40:24,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:24,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 365 [2025-02-08 05:40:24,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:25,048 INFO L124 PetriNetUnfolderBase]: 171/693 cut-off events. [2025-02-08 05:40:25,049 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:40:25,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 989 conditions, 693 events. 171/693 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2627 event pairs, 121 based on Foata normal form. 0/608 useless extension candidates. Maximal degree in co-relation 918. Up to 258 conditions per place. [2025-02-08 05:40:25,053 INFO L140 encePairwiseOnDemand]: 362/365 looper letters, 20 selfloop transitions, 2 changer transitions 0/268 dead transitions. [2025-02-08 05:40:25,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 268 transitions, 593 flow [2025-02-08 05:40:25,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:25,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:25,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 851 transitions. [2025-02-08 05:40:25,055 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7771689497716895 [2025-02-08 05:40:25,055 INFO L175 Difference]: Start difference. First operand has 272 places, 269 transitions, 551 flow. Second operand 3 states and 851 transitions. [2025-02-08 05:40:25,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 268 transitions, 593 flow [2025-02-08 05:40:25,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 268 transitions, 589 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:25,062 INFO L231 Difference]: Finished difference. Result has 271 places, 268 transitions, 549 flow [2025-02-08 05:40:25,063 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=549, PETRI_PLACES=271, PETRI_TRANSITIONS=268} [2025-02-08 05:40:25,064 INFO L279 CegarLoopForPetriNet]: 347 programPoint places, -76 predicate places. [2025-02-08 05:40:25,064 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 268 transitions, 549 flow [2025-02-08 05:40:25,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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:40:25,065 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:25,065 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] [2025-02-08 05:40:25,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:40:25,066 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:40:25,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:25,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1823403413, now seen corresponding path program 1 times [2025-02-08 05:40:25,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:25,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631841453] [2025-02-08 05:40:25,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:25,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:25,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-08 05:40:25,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-08 05:40:25,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:25,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:25,134 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:40:25,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:25,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631841453] [2025-02-08 05:40:25,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631841453] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:25,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:25,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:25,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853226182] [2025-02-08 05:40:25,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:25,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:25,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:25,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:25,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:25,144 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 365 [2025-02-08 05:40:25,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 268 transitions, 549 flow. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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:40:25,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:25,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 365 [2025-02-08 05:40:25,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:25,247 INFO L124 PetriNetUnfolderBase]: 171/692 cut-off events. [2025-02-08 05:40:25,247 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-08 05:40:25,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 985 conditions, 692 events. 171/692 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2608 event pairs, 121 based on Foata normal form. 0/608 useless extension candidates. Maximal degree in co-relation 915. Up to 255 conditions per place. [2025-02-08 05:40:25,251 INFO L140 encePairwiseOnDemand]: 363/365 looper letters, 18 selfloop transitions, 1 changer transitions 0/267 dead transitions. [2025-02-08 05:40:25,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 267 transitions, 585 flow [2025-02-08 05:40:25,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:25,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:25,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 860 transitions. [2025-02-08 05:40:25,254 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7853881278538812 [2025-02-08 05:40:25,254 INFO L175 Difference]: Start difference. First operand has 271 places, 268 transitions, 549 flow. Second operand 3 states and 860 transitions. [2025-02-08 05:40:25,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 267 transitions, 585 flow [2025-02-08 05:40:25,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 267 transitions, 581 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:25,259 INFO L231 Difference]: Finished difference. Result has 270 places, 267 transitions, 545 flow [2025-02-08 05:40:25,260 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=543, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=545, PETRI_PLACES=270, PETRI_TRANSITIONS=267} [2025-02-08 05:40:25,260 INFO L279 CegarLoopForPetriNet]: 347 programPoint places, -77 predicate places. [2025-02-08 05:40:25,261 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 267 transitions, 545 flow [2025-02-08 05:40:25,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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:40:25,261 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:25,261 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:40:25,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:40:25,262 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:40:25,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:25,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1999916073, now seen corresponding path program 1 times [2025-02-08 05:40:25,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:25,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050671397] [2025-02-08 05:40:25,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:25,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:25,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-08 05:40:25,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-08 05:40:25,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:25,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:25,295 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:40:25,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:25,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050671397] [2025-02-08 05:40:25,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050671397] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:25,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:25,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:25,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988800824] [2025-02-08 05:40:25,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:25,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:25,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:25,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:25,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:25,309 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 365 [2025-02-08 05:40:25,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 267 transitions, 545 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 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:40:25,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:25,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 365 [2025-02-08 05:40:25,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:25,431 INFO L124 PetriNetUnfolderBase]: 171/691 cut-off events. [2025-02-08 05:40:25,431 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:40:25,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 985 conditions, 691 events. 171/691 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2608 event pairs, 121 based on Foata normal form. 0/608 useless extension candidates. Maximal degree in co-relation 914. Up to 257 conditions per place. [2025-02-08 05:40:25,436 INFO L140 encePairwiseOnDemand]: 362/365 looper letters, 19 selfloop transitions, 2 changer transitions 0/266 dead transitions. [2025-02-08 05:40:25,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 266 transitions, 585 flow [2025-02-08 05:40:25,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:25,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:25,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 853 transitions. [2025-02-08 05:40:25,439 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7789954337899543 [2025-02-08 05:40:25,439 INFO L175 Difference]: Start difference. First operand has 270 places, 267 transitions, 545 flow. Second operand 3 states and 853 transitions. [2025-02-08 05:40:25,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 266 transitions, 585 flow [2025-02-08 05:40:25,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 266 transitions, 584 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:25,444 INFO L231 Difference]: Finished difference. Result has 270 places, 266 transitions, 546 flow [2025-02-08 05:40:25,445 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=546, PETRI_PLACES=270, PETRI_TRANSITIONS=266} [2025-02-08 05:40:25,446 INFO L279 CegarLoopForPetriNet]: 347 programPoint places, -77 predicate places. [2025-02-08 05:40:25,446 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 266 transitions, 546 flow [2025-02-08 05:40:25,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 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:40:25,447 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:25,447 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] [2025-02-08 05:40:25,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:40:25,447 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:40:25,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:25,448 INFO L85 PathProgramCache]: Analyzing trace with hash 287979042, now seen corresponding path program 1 times [2025-02-08 05:40:25,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:25,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764649068] [2025-02-08 05:40:25,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:25,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:25,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-08 05:40:25,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-08 05:40:25,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:25,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:25,481 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:40:25,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:25,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764649068] [2025-02-08 05:40:25,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764649068] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:25,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:25,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:25,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282354467] [2025-02-08 05:40:25,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:25,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:25,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:25,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:25,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:25,489 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 365 [2025-02-08 05:40:25,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 266 transitions, 546 flow. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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:40:25,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:25,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 365 [2025-02-08 05:40:25,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:25,591 INFO L124 PetriNetUnfolderBase]: 171/690 cut-off events. [2025-02-08 05:40:25,591 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:40:25,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 984 conditions, 690 events. 171/690 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2606 event pairs, 121 based on Foata normal form. 0/608 useless extension candidates. Maximal degree in co-relation 913. Up to 255 conditions per place. [2025-02-08 05:40:25,595 INFO L140 encePairwiseOnDemand]: 363/365 looper letters, 18 selfloop transitions, 1 changer transitions 0/265 dead transitions. [2025-02-08 05:40:25,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 265 transitions, 582 flow [2025-02-08 05:40:25,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:25,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:25,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 860 transitions. [2025-02-08 05:40:25,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7853881278538812 [2025-02-08 05:40:25,598 INFO L175 Difference]: Start difference. First operand has 270 places, 266 transitions, 546 flow. Second operand 3 states and 860 transitions. [2025-02-08 05:40:25,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 265 transitions, 582 flow [2025-02-08 05:40:25,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 265 transitions, 578 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:25,603 INFO L231 Difference]: Finished difference. Result has 269 places, 265 transitions, 542 flow [2025-02-08 05:40:25,603 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=542, PETRI_PLACES=269, PETRI_TRANSITIONS=265} [2025-02-08 05:40:25,604 INFO L279 CegarLoopForPetriNet]: 347 programPoint places, -78 predicate places. [2025-02-08 05:40:25,604 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 265 transitions, 542 flow [2025-02-08 05:40:25,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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:40:25,604 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:25,605 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:25,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:40:25,605 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:40:25,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:25,606 INFO L85 PathProgramCache]: Analyzing trace with hash 811407066, now seen corresponding path program 1 times [2025-02-08 05:40:25,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:25,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094923296] [2025-02-08 05:40:25,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:25,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:25,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-08 05:40:25,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-08 05:40:25,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:25,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:25,674 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:40:25,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:25,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094923296] [2025-02-08 05:40:25,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094923296] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:25,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:25,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:25,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131820841] [2025-02-08 05:40:25,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:25,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:25,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:25,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:25,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:25,686 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 365 [2025-02-08 05:40:25,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 265 transitions, 542 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 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:40:25,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:25,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 365 [2025-02-08 05:40:25,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:25,801 INFO L124 PetriNetUnfolderBase]: 171/689 cut-off events. [2025-02-08 05:40:25,801 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:40:25,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 984 conditions, 689 events. 171/689 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2601 event pairs, 121 based on Foata normal form. 0/608 useless extension candidates. Maximal degree in co-relation 913. Up to 257 conditions per place. [2025-02-08 05:40:25,807 INFO L140 encePairwiseOnDemand]: 362/365 looper letters, 19 selfloop transitions, 2 changer transitions 0/264 dead transitions. [2025-02-08 05:40:25,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 264 transitions, 582 flow [2025-02-08 05:40:25,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:25,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:25,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 853 transitions. [2025-02-08 05:40:25,810 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7789954337899543 [2025-02-08 05:40:25,810 INFO L175 Difference]: Start difference. First operand has 269 places, 265 transitions, 542 flow. Second operand 3 states and 853 transitions. [2025-02-08 05:40:25,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 264 transitions, 582 flow [2025-02-08 05:40:25,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 264 transitions, 581 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:25,814 INFO L231 Difference]: Finished difference. Result has 269 places, 264 transitions, 543 flow [2025-02-08 05:40:25,815 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=543, PETRI_PLACES=269, PETRI_TRANSITIONS=264} [2025-02-08 05:40:25,816 INFO L279 CegarLoopForPetriNet]: 347 programPoint places, -78 predicate places. [2025-02-08 05:40:25,817 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 264 transitions, 543 flow [2025-02-08 05:40:25,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 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:40:25,818 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:25,818 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:25,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:40:25,818 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:40:25,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:25,819 INFO L85 PathProgramCache]: Analyzing trace with hash -628158450, now seen corresponding path program 1 times [2025-02-08 05:40:25,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:25,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057144482] [2025-02-08 05:40:25,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:25,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:25,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-08 05:40:25,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-08 05:40:25,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:25,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:26,453 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:40:26,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:26,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057144482] [2025-02-08 05:40:26,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057144482] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:26,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:26,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:40:26,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549336143] [2025-02-08 05:40:26,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:26,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:40:26,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:26,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:40:26,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:40:26,606 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 365 [2025-02-08 05:40:26,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 264 transitions, 543 flow. Second operand has 6 states, 6 states have (on average 257.5) internal successors, (1545), 6 states have internal predecessors, (1545), 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:40:26,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:26,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 365 [2025-02-08 05:40:26,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:26,729 INFO L124 PetriNetUnfolderBase]: 171/687 cut-off events. [2025-02-08 05:40:26,730 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:40:26,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1005 conditions, 687 events. 171/687 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2615 event pairs, 121 based on Foata normal form. 0/608 useless extension candidates. Maximal degree in co-relation 935. Up to 270 conditions per place. [2025-02-08 05:40:26,734 INFO L140 encePairwiseOnDemand]: 353/365 looper letters, 32 selfloop transitions, 10 changer transitions 0/262 dead transitions. [2025-02-08 05:40:26,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 262 transitions, 623 flow [2025-02-08 05:40:26,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:40:26,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:40:26,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1580 transitions. [2025-02-08 05:40:26,739 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7214611872146118 [2025-02-08 05:40:26,739 INFO L175 Difference]: Start difference. First operand has 269 places, 264 transitions, 543 flow. Second operand 6 states and 1580 transitions. [2025-02-08 05:40:26,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 262 transitions, 623 flow [2025-02-08 05:40:26,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 262 transitions, 619 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:26,744 INFO L231 Difference]: Finished difference. Result has 270 places, 262 transitions, 555 flow [2025-02-08 05:40:26,744 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=535, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=555, PETRI_PLACES=270, PETRI_TRANSITIONS=262} [2025-02-08 05:40:26,745 INFO L279 CegarLoopForPetriNet]: 347 programPoint places, -77 predicate places. [2025-02-08 05:40:26,745 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 262 transitions, 555 flow [2025-02-08 05:40:26,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 257.5) internal successors, (1545), 6 states have internal predecessors, (1545), 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:40:26,746 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:26,746 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] [2025-02-08 05:40:26,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:40:26,747 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:40:26,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:26,747 INFO L85 PathProgramCache]: Analyzing trace with hash -32224843, now seen corresponding path program 1 times [2025-02-08 05:40:26,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:26,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109161183] [2025-02-08 05:40:26,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:26,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:26,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-08 05:40:26,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-08 05:40:26,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:26,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:26,785 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:40:26,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:26,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109161183] [2025-02-08 05:40:26,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109161183] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:26,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:26,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:26,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884565439] [2025-02-08 05:40:26,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:26,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:26,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:26,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:26,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:26,793 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 365 [2025-02-08 05:40:26,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 262 transitions, 555 flow. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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:40:26,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:26,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 365 [2025-02-08 05:40:26,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:26,908 INFO L124 PetriNetUnfolderBase]: 171/686 cut-off events. [2025-02-08 05:40:26,908 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:40:26,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 989 conditions, 686 events. 171/686 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2616 event pairs, 121 based on Foata normal form. 0/608 useless extension candidates. Maximal degree in co-relation 956. Up to 255 conditions per place. [2025-02-08 05:40:26,911 INFO L140 encePairwiseOnDemand]: 363/365 looper letters, 18 selfloop transitions, 1 changer transitions 0/261 dead transitions. [2025-02-08 05:40:26,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 261 transitions, 591 flow [2025-02-08 05:40:26,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:26,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:26,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 860 transitions. [2025-02-08 05:40:26,914 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7853881278538812 [2025-02-08 05:40:26,914 INFO L175 Difference]: Start difference. First operand has 270 places, 262 transitions, 555 flow. Second operand 3 states and 860 transitions. [2025-02-08 05:40:26,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 261 transitions, 591 flow [2025-02-08 05:40:26,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 261 transitions, 571 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:40:26,918 INFO L231 Difference]: Finished difference. Result has 266 places, 261 transitions, 535 flow [2025-02-08 05:40:26,919 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=533, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=535, PETRI_PLACES=266, PETRI_TRANSITIONS=261} [2025-02-08 05:40:26,919 INFO L279 CegarLoopForPetriNet]: 347 programPoint places, -81 predicate places. [2025-02-08 05:40:26,919 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 261 transitions, 535 flow [2025-02-08 05:40:26,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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:40:26,920 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:26,920 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] [2025-02-08 05:40:26,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:40:26,921 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:40:26,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:26,921 INFO L85 PathProgramCache]: Analyzing trace with hash -431143640, now seen corresponding path program 1 times [2025-02-08 05:40:26,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:26,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322288301] [2025-02-08 05:40:26,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:26,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:26,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-08 05:40:26,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-08 05:40:26,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:26,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:26,972 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:40:26,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:26,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322288301] [2025-02-08 05:40:26,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322288301] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:26,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:26,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:26,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052900285] [2025-02-08 05:40:26,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:26,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:26,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:26,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:26,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:26,982 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 365 [2025-02-08 05:40:26,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 261 transitions, 535 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 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:40:26,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:26,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 365 [2025-02-08 05:40:26,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:27,090 INFO L124 PetriNetUnfolderBase]: 171/685 cut-off events. [2025-02-08 05:40:27,090 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:40:27,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 981 conditions, 685 events. 171/685 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2604 event pairs, 121 based on Foata normal form. 0/608 useless extension candidates. Maximal degree in co-relation 910. Up to 257 conditions per place. [2025-02-08 05:40:27,094 INFO L140 encePairwiseOnDemand]: 362/365 looper letters, 19 selfloop transitions, 2 changer transitions 0/260 dead transitions. [2025-02-08 05:40:27,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 260 transitions, 575 flow [2025-02-08 05:40:27,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:27,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:27,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 853 transitions. [2025-02-08 05:40:27,097 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7789954337899543 [2025-02-08 05:40:27,097 INFO L175 Difference]: Start difference. First operand has 266 places, 261 transitions, 535 flow. Second operand 3 states and 853 transitions. [2025-02-08 05:40:27,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 260 transitions, 575 flow [2025-02-08 05:40:27,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 260 transitions, 574 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:27,102 INFO L231 Difference]: Finished difference. Result has 266 places, 260 transitions, 536 flow [2025-02-08 05:40:27,103 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=536, PETRI_PLACES=266, PETRI_TRANSITIONS=260} [2025-02-08 05:40:27,103 INFO L279 CegarLoopForPetriNet]: 347 programPoint places, -81 predicate places. [2025-02-08 05:40:27,103 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 260 transitions, 536 flow [2025-02-08 05:40:27,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 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:40:27,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:27,104 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:40:27,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:40:27,104 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:40:27,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:27,105 INFO L85 PathProgramCache]: Analyzing trace with hash -927673747, now seen corresponding path program 1 times [2025-02-08 05:40:27,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:27,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650873401] [2025-02-08 05:40:27,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:27,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:27,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-08 05:40:27,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-08 05:40:27,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:27,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:27,159 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:40:27,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:27,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650873401] [2025-02-08 05:40:27,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650873401] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:27,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:27,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:27,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819907564] [2025-02-08 05:40:27,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:27,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:27,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:27,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:27,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:27,170 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 365 [2025-02-08 05:40:27,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 260 transitions, 536 flow. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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:40:27,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:27,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 365 [2025-02-08 05:40:27,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:27,268 INFO L124 PetriNetUnfolderBase]: 171/684 cut-off events. [2025-02-08 05:40:27,269 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:40:27,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 980 conditions, 684 events. 171/684 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2592 event pairs, 121 based on Foata normal form. 0/608 useless extension candidates. Maximal degree in co-relation 909. Up to 255 conditions per place. [2025-02-08 05:40:27,273 INFO L140 encePairwiseOnDemand]: 363/365 looper letters, 18 selfloop transitions, 1 changer transitions 0/259 dead transitions. [2025-02-08 05:40:27,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 259 transitions, 572 flow [2025-02-08 05:40:27,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:27,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:27,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 860 transitions. [2025-02-08 05:40:27,276 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7853881278538812 [2025-02-08 05:40:27,277 INFO L175 Difference]: Start difference. First operand has 266 places, 260 transitions, 536 flow. Second operand 3 states and 860 transitions. [2025-02-08 05:40:27,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 259 transitions, 572 flow [2025-02-08 05:40:27,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 259 transitions, 568 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:27,281 INFO L231 Difference]: Finished difference. Result has 265 places, 259 transitions, 532 flow [2025-02-08 05:40:27,282 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=532, PETRI_PLACES=265, PETRI_TRANSITIONS=259} [2025-02-08 05:40:27,282 INFO L279 CegarLoopForPetriNet]: 347 programPoint places, -82 predicate places. [2025-02-08 05:40:27,282 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 259 transitions, 532 flow [2025-02-08 05:40:27,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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:40:27,283 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:27,284 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:27,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:40:27,284 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:40:27,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:27,285 INFO L85 PathProgramCache]: Analyzing trace with hash -427556416, now seen corresponding path program 1 times [2025-02-08 05:40:27,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:27,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795730099] [2025-02-08 05:40:27,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:27,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:27,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-08 05:40:27,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-08 05:40:27,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:27,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:27,359 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:40:27,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:27,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795730099] [2025-02-08 05:40:27,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795730099] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:27,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:27,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:27,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445502618] [2025-02-08 05:40:27,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:27,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:27,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:27,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:27,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:27,368 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 365 [2025-02-08 05:40:27,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 259 transitions, 532 flow. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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:40:27,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:27,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 365 [2025-02-08 05:40:27,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:27,488 INFO L124 PetriNetUnfolderBase]: 180/776 cut-off events. [2025-02-08 05:40:27,489 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-08 05:40:27,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1089 conditions, 776 events. 180/776 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3202 event pairs, 71 based on Foata normal form. 0/692 useless extension candidates. Maximal degree in co-relation 1018. Up to 265 conditions per place. [2025-02-08 05:40:27,493 INFO L140 encePairwiseOnDemand]: 359/365 looper letters, 22 selfloop transitions, 5 changer transitions 0/266 dead transitions. [2025-02-08 05:40:27,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 266 transitions, 604 flow [2025-02-08 05:40:27,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:27,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:27,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 868 transitions. [2025-02-08 05:40:27,496 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7926940639269406 [2025-02-08 05:40:27,496 INFO L175 Difference]: Start difference. First operand has 265 places, 259 transitions, 532 flow. Second operand 3 states and 868 transitions. [2025-02-08 05:40:27,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 266 transitions, 604 flow [2025-02-08 05:40:27,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 266 transitions, 603 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:27,502 INFO L231 Difference]: Finished difference. Result has 266 places, 262 transitions, 560 flow [2025-02-08 05:40:27,503 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=560, PETRI_PLACES=266, PETRI_TRANSITIONS=262} [2025-02-08 05:40:27,503 INFO L279 CegarLoopForPetriNet]: 347 programPoint places, -81 predicate places. [2025-02-08 05:40:27,503 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 262 transitions, 560 flow [2025-02-08 05:40:27,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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:40:27,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:27,504 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:27,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:40:27,504 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:40:27,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:27,506 INFO L85 PathProgramCache]: Analyzing trace with hash -280678730, now seen corresponding path program 1 times [2025-02-08 05:40:27,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:27,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617376595] [2025-02-08 05:40:27,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:27,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:27,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-08 05:40:27,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-08 05:40:27,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:27,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:27,591 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:40:27,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:27,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617376595] [2025-02-08 05:40:27,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617376595] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:27,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:27,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:27,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991521328] [2025-02-08 05:40:27,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:27,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:27,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:27,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:27,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:27,596 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 365 [2025-02-08 05:40:27,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 262 transitions, 560 flow. Second operand has 3 states, 3 states have (on average 285.6666666666667) internal successors, (857), 3 states have internal predecessors, (857), 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:40:27,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:27,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 365 [2025-02-08 05:40:27,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:27,713 INFO L124 PetriNetUnfolderBase]: 180/775 cut-off events. [2025-02-08 05:40:27,714 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-02-08 05:40:27,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1217 conditions, 775 events. 180/775 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3190 event pairs, 98 based on Foata normal form. 1/689 useless extension candidates. Maximal degree in co-relation 1147. Up to 268 conditions per place. [2025-02-08 05:40:27,717 INFO L140 encePairwiseOnDemand]: 363/365 looper letters, 0 selfloop transitions, 0 changer transitions 261/261 dead transitions. [2025-02-08 05:40:27,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 261 transitions, 600 flow [2025-02-08 05:40:27,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:27,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:27,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 861 transitions. [2025-02-08 05:40:27,720 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7863013698630137 [2025-02-08 05:40:27,720 INFO L175 Difference]: Start difference. First operand has 266 places, 262 transitions, 560 flow. Second operand 3 states and 861 transitions. [2025-02-08 05:40:27,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 261 transitions, 600 flow [2025-02-08 05:40:27,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 261 transitions, 600 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:40:27,723 INFO L231 Difference]: Finished difference. Result has 267 places, 0 transitions, 0 flow [2025-02-08 05:40:27,723 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=267, PETRI_TRANSITIONS=0} [2025-02-08 05:40:27,724 INFO L279 CegarLoopForPetriNet]: 347 programPoint places, -80 predicate places. [2025-02-08 05:40:27,724 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 0 transitions, 0 flow [2025-02-08 05:40:27,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 285.6666666666667) internal successors, (857), 3 states have internal predecessors, (857), 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:40:27,727 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (134 of 135 remaining) [2025-02-08 05:40:27,727 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (133 of 135 remaining) [2025-02-08 05:40:27,727 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (132 of 135 remaining) [2025-02-08 05:40:27,727 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (131 of 135 remaining) [2025-02-08 05:40:27,727 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (130 of 135 remaining) [2025-02-08 05:40:27,727 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (129 of 135 remaining) [2025-02-08 05:40:27,727 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (128 of 135 remaining) [2025-02-08 05:40:27,728 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (127 of 135 remaining) [2025-02-08 05:40:27,728 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (126 of 135 remaining) [2025-02-08 05:40:27,728 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (125 of 135 remaining) [2025-02-08 05:40:27,728 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (124 of 135 remaining) [2025-02-08 05:40:27,728 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (123 of 135 remaining) [2025-02-08 05:40:27,728 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (122 of 135 remaining) [2025-02-08 05:40:27,728 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (121 of 135 remaining) [2025-02-08 05:40:27,729 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (120 of 135 remaining) [2025-02-08 05:40:27,729 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (119 of 135 remaining) [2025-02-08 05:40:27,729 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (118 of 135 remaining) [2025-02-08 05:40:27,729 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (117 of 135 remaining) [2025-02-08 05:40:27,729 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (116 of 135 remaining) [2025-02-08 05:40:27,729 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (115 of 135 remaining) [2025-02-08 05:40:27,729 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (114 of 135 remaining) [2025-02-08 05:40:27,729 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (113 of 135 remaining) [2025-02-08 05:40:27,729 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (112 of 135 remaining) [2025-02-08 05:40:27,729 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (111 of 135 remaining) [2025-02-08 05:40:27,729 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (110 of 135 remaining) [2025-02-08 05:40:27,730 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (109 of 135 remaining) [2025-02-08 05:40:27,730 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (108 of 135 remaining) [2025-02-08 05:40:27,730 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (107 of 135 remaining) [2025-02-08 05:40:27,730 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (106 of 135 remaining) [2025-02-08 05:40:27,730 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (105 of 135 remaining) [2025-02-08 05:40:27,730 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (104 of 135 remaining) [2025-02-08 05:40:27,730 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (103 of 135 remaining) [2025-02-08 05:40:27,730 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (102 of 135 remaining) [2025-02-08 05:40:27,730 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (101 of 135 remaining) [2025-02-08 05:40:27,730 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (100 of 135 remaining) [2025-02-08 05:40:27,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (99 of 135 remaining) [2025-02-08 05:40:27,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (98 of 135 remaining) [2025-02-08 05:40:27,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (97 of 135 remaining) [2025-02-08 05:40:27,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (96 of 135 remaining) [2025-02-08 05:40:27,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (95 of 135 remaining) [2025-02-08 05:40:27,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (94 of 135 remaining) [2025-02-08 05:40:27,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (93 of 135 remaining) [2025-02-08 05:40:27,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (92 of 135 remaining) [2025-02-08 05:40:27,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (91 of 135 remaining) [2025-02-08 05:40:27,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (90 of 135 remaining) [2025-02-08 05:40:27,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (89 of 135 remaining) [2025-02-08 05:40:27,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (88 of 135 remaining) [2025-02-08 05:40:27,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (87 of 135 remaining) [2025-02-08 05:40:27,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (86 of 135 remaining) [2025-02-08 05:40:27,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (85 of 135 remaining) [2025-02-08 05:40:27,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (84 of 135 remaining) [2025-02-08 05:40:27,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (83 of 135 remaining) [2025-02-08 05:40:27,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (82 of 135 remaining) [2025-02-08 05:40:27,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (81 of 135 remaining) [2025-02-08 05:40:27,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (80 of 135 remaining) [2025-02-08 05:40:27,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (79 of 135 remaining) [2025-02-08 05:40:27,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (78 of 135 remaining) [2025-02-08 05:40:27,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (77 of 135 remaining) [2025-02-08 05:40:27,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (76 of 135 remaining) [2025-02-08 05:40:27,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (75 of 135 remaining) [2025-02-08 05:40:27,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (74 of 135 remaining) [2025-02-08 05:40:27,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (73 of 135 remaining) [2025-02-08 05:40:27,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (72 of 135 remaining) [2025-02-08 05:40:27,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (71 of 135 remaining) [2025-02-08 05:40:27,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (70 of 135 remaining) [2025-02-08 05:40:27,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (69 of 135 remaining) [2025-02-08 05:40:27,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (68 of 135 remaining) [2025-02-08 05:40:27,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (67 of 135 remaining) [2025-02-08 05:40:27,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (66 of 135 remaining) [2025-02-08 05:40:27,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (65 of 135 remaining) [2025-02-08 05:40:27,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (64 of 135 remaining) [2025-02-08 05:40:27,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (63 of 135 remaining) [2025-02-08 05:40:27,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (62 of 135 remaining) [2025-02-08 05:40:27,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (61 of 135 remaining) [2025-02-08 05:40:27,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (60 of 135 remaining) [2025-02-08 05:40:27,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (59 of 135 remaining) [2025-02-08 05:40:27,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (58 of 135 remaining) [2025-02-08 05:40:27,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (57 of 135 remaining) [2025-02-08 05:40:27,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (56 of 135 remaining) [2025-02-08 05:40:27,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (55 of 135 remaining) [2025-02-08 05:40:27,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (54 of 135 remaining) [2025-02-08 05:40:27,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (53 of 135 remaining) [2025-02-08 05:40:27,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (52 of 135 remaining) [2025-02-08 05:40:27,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (51 of 135 remaining) [2025-02-08 05:40:27,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (50 of 135 remaining) [2025-02-08 05:40:27,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (49 of 135 remaining) [2025-02-08 05:40:27,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (48 of 135 remaining) [2025-02-08 05:40:27,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (47 of 135 remaining) [2025-02-08 05:40:27,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (46 of 135 remaining) [2025-02-08 05:40:27,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (45 of 135 remaining) [2025-02-08 05:40:27,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (44 of 135 remaining) [2025-02-08 05:40:27,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (43 of 135 remaining) [2025-02-08 05:40:27,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (42 of 135 remaining) [2025-02-08 05:40:27,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (41 of 135 remaining) [2025-02-08 05:40:27,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (40 of 135 remaining) [2025-02-08 05:40:27,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (39 of 135 remaining) [2025-02-08 05:40:27,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (38 of 135 remaining) [2025-02-08 05:40:27,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (37 of 135 remaining) [2025-02-08 05:40:27,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (36 of 135 remaining) [2025-02-08 05:40:27,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (35 of 135 remaining) [2025-02-08 05:40:27,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (34 of 135 remaining) [2025-02-08 05:40:27,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (33 of 135 remaining) [2025-02-08 05:40:27,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (32 of 135 remaining) [2025-02-08 05:40:27,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (31 of 135 remaining) [2025-02-08 05:40:27,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (30 of 135 remaining) [2025-02-08 05:40:27,736 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (29 of 135 remaining) [2025-02-08 05:40:27,736 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (28 of 135 remaining) [2025-02-08 05:40:27,736 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (27 of 135 remaining) [2025-02-08 05:40:27,736 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (26 of 135 remaining) [2025-02-08 05:40:27,736 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (25 of 135 remaining) [2025-02-08 05:40:27,736 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (24 of 135 remaining) [2025-02-08 05:40:27,736 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (23 of 135 remaining) [2025-02-08 05:40:27,736 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (22 of 135 remaining) [2025-02-08 05:40:27,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (21 of 135 remaining) [2025-02-08 05:40:27,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (20 of 135 remaining) [2025-02-08 05:40:27,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (19 of 135 remaining) [2025-02-08 05:40:27,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (18 of 135 remaining) [2025-02-08 05:40:27,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (17 of 135 remaining) [2025-02-08 05:40:27,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (16 of 135 remaining) [2025-02-08 05:40:27,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (15 of 135 remaining) [2025-02-08 05:40:27,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (14 of 135 remaining) [2025-02-08 05:40:27,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (13 of 135 remaining) [2025-02-08 05:40:27,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (12 of 135 remaining) [2025-02-08 05:40:27,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (11 of 135 remaining) [2025-02-08 05:40:27,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (10 of 135 remaining) [2025-02-08 05:40:27,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (9 of 135 remaining) [2025-02-08 05:40:27,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (8 of 135 remaining) [2025-02-08 05:40:27,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (7 of 135 remaining) [2025-02-08 05:40:27,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (6 of 135 remaining) [2025-02-08 05:40:27,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (5 of 135 remaining) [2025-02-08 05:40:27,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (4 of 135 remaining) [2025-02-08 05:40:27,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (3 of 135 remaining) [2025-02-08 05:40:27,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (2 of 135 remaining) [2025-02-08 05:40:27,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (1 of 135 remaining) [2025-02-08 05:40:27,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (0 of 135 remaining) [2025-02-08 05:40:27,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:40:27,739 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:27,748 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:40:27,748 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:40:27,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:40:27 BasicIcfg [2025-02-08 05:40:27,756 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:40:27,756 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:40:27,756 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:40:27,756 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:40:27,757 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:40:22" (3/4) ... [2025-02-08 05:40:27,758 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:40:27,762 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:40:27,762 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:40:27,762 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 05:40:27,762 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-02-08 05:40:27,772 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2025-02-08 05:40:27,773 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:40:27,774 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 05:40:27,774 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:40:27,872 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:40:27,873 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:40:27,873 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:40:27,873 INFO L158 Benchmark]: Toolchain (without parser) took 7694.86ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 112.1MB in the beginning and 95.9MB in the end (delta: 16.2MB). Peak memory consumption was 154.3MB. Max. memory is 16.1GB. [2025-02-08 05:40:27,874 INFO L158 Benchmark]: CDTParser took 0.61ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:40:27,874 INFO L158 Benchmark]: CACSL2BoogieTranslator took 274.24ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 97.8MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:40:27,874 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.44ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 94.7MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:40:27,874 INFO L158 Benchmark]: Boogie Preprocessor took 51.32ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 92.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:40:27,875 INFO L158 Benchmark]: IcfgBuilder took 1422.38ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 44.2MB in the end (delta: 47.8MB). Peak memory consumption was 65.8MB. Max. memory is 16.1GB. [2025-02-08 05:40:27,875 INFO L158 Benchmark]: TraceAbstraction took 5740.30ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 43.5MB in the beginning and 101.1MB in the end (delta: -57.6MB). Peak memory consumption was 88.5MB. Max. memory is 16.1GB. [2025-02-08 05:40:27,875 INFO L158 Benchmark]: Witness Printer took 116.56ms. Allocated memory is still 285.2MB. Free memory was 101.1MB in the beginning and 95.9MB in the end (delta: 5.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:40:27,876 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.61ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 274.24ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 97.8MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.44ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 94.7MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.32ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 92.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1422.38ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 44.2MB in the end (delta: 47.8MB). Peak memory consumption was 65.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5740.30ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 43.5MB in the beginning and 101.1MB in the end (delta: -57.6MB). Peak memory consumption was 88.5MB. Max. memory is 16.1GB. * Witness Printer took 116.56ms. Allocated memory is still 285.2MB. Free memory was 101.1MB in the beginning and 95.9MB in the end (delta: 5.2MB). There was no memory consumed. 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: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: 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: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: 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: 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: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: 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: 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: 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 - 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 - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 125]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 126]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 130]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 159]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 159]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 147]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: 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 9 procedures, 447 locations, 135 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: 5.5s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 299 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 160 mSDsluCounter, 36 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 807 IncrementalHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 36 mSDtfsCounter, 807 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=712occurred in iteration=0, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1756 NumberOfCodeBlocks, 1756 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1738 ConstructedInterpolants, 0 QuantifiedInterpolants, 1887 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 89 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:40:27,899 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