./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt.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-bad-buffer-mult-alt.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 2e9e4bd6e9b16aa5f22ad2335ca34ba741869a12ab5a04a80108cf42ed170c0f --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:39:36,145 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:39:36,198 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:39:36,202 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:39:36,202 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:39:36,220 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:39:36,221 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:39:36,221 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:39:36,222 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:39:36,222 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:39:36,223 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:39:36,223 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:39:36,223 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:39:36,223 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:39:36,223 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:39:36,223 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:39:36,223 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:39:36,223 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:39:36,223 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:39:36,224 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:39:36,224 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:39:36,224 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:39:36,224 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:39:36,224 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:39:36,225 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:39:36,225 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:39:36,225 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:39:36,225 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:39:36,225 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:39:36,225 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:39:36,225 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:39:36,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:39:36,225 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:39:36,225 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:39:36,225 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:39:36,226 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:39:36,226 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:39:36,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:39:36,226 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:39:36,226 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:39:36,226 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:39:36,226 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:39:36,227 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 -> 2e9e4bd6e9b16aa5f22ad2335ca34ba741869a12ab5a04a80108cf42ed170c0f [2025-02-08 05:39:36,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:39:36,465 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:39:36,467 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:39:36,467 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:39:36,468 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:39:36,472 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt.wvr.c [2025-02-08 05:39:37,630 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7b45bb63e/65daf4d68f444fe4a5fc33b6144048db/FLAGe51a6c9e3 [2025-02-08 05:39:37,854 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:39:37,855 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt.wvr.c [2025-02-08 05:39:37,861 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7b45bb63e/65daf4d68f444fe4a5fc33b6144048db/FLAGe51a6c9e3 [2025-02-08 05:39:38,205 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7b45bb63e/65daf4d68f444fe4a5fc33b6144048db [2025-02-08 05:39:38,207 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:39:38,208 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:39:38,209 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:39:38,209 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:39:38,212 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:39:38,212 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:39:38" (1/1) ... [2025-02-08 05:39:38,213 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e3eb5c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:38, skipping insertion in model container [2025-02-08 05:39:38,213 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:39:38" (1/1) ... [2025-02-08 05:39:38,229 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:39:38,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:39:38,394 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:39:38,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:39:38,462 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:39:38,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:38 WrapperNode [2025-02-08 05:39:38,463 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:39:38,464 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:39:38,464 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:39:38,465 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:39:38,469 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:39:38" (1/1) ... [2025-02-08 05:39:38,483 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:39:38" (1/1) ... [2025-02-08 05:39:38,525 INFO L138 Inliner]: procedures = 25, calls = 60, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 601 [2025-02-08 05:39:38,529 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:39:38,529 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:39:38,533 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:39:38,533 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:39:38,539 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:38" (1/1) ... [2025-02-08 05:39:38,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:38" (1/1) ... [2025-02-08 05:39:38,542 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:38" (1/1) ... [2025-02-08 05:39:38,542 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:38" (1/1) ... [2025-02-08 05:39:38,563 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:38" (1/1) ... [2025-02-08 05:39:38,569 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:38" (1/1) ... [2025-02-08 05:39:38,571 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:38" (1/1) ... [2025-02-08 05:39:38,572 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:38" (1/1) ... [2025-02-08 05:39:38,579 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:39:38,583 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:39:38,583 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:39:38,583 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:39:38,584 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:38" (1/1) ... [2025-02-08 05:39:38,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:39:38,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:39:38,615 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:39:38,618 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:39:38,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:39:38,637 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:39:38,637 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:39:38,637 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:39:38,637 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:39:38,637 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 05:39:38,638 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 05:39:38,638 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-08 05:39:38,638 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-08 05:39:38,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:39:38,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:39:38,638 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 05:39:38,638 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 05:39:38,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:39:38,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:39:38,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:39:38,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:39:38,639 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:39:38,727 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:39:38,728 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:39:39,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L94: havoc #t~nondet20#1; [2025-02-08 05:39:39,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L94-1: havoc #t~ret19#1; [2025-02-08 05:39:39,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L94-2: assume #race~total~0 == #t~nondet20#1; [2025-02-08 05:39:39,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L94-2: assume !(#race~total~0 == #t~nondet20#1); [2025-02-08 05:39:39,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L94-3: havoc #t~mem18#1; [2025-02-08 05:39:39,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L94-4: #race~total~0 := #t~nondet20#1; [2025-02-08 05:39:39,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L94-5: havoc #t~nondet20#1; [2025-02-08 05:39:39,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L94-6: ~total~0 := #t~ret19#1; [2025-02-08 05:39:39,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L94-7: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret19#1 && #t~ret19#1 <= 2147483647; [2025-02-08 05:39:39,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L94-8: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:39:39,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L94-9: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:39:39,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L94-10: #t~ret19#1 := plus_#res#1; [2025-02-08 05:39:39,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L95: havoc #t~nondet22#1; [2025-02-08 05:39:39,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L95-1: assume #race~q1_front~0 == #t~nondet22#1; [2025-02-08 05:39:39,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L95-1: assume !(#race~q1_front~0 == #t~nondet22#1); [2025-02-08 05:39:39,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L95-2: havoc #t~post21#1; [2025-02-08 05:39:39,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L95-3: #race~q1_front~0 := #t~nondet22#1; [2025-02-08 05:39:39,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L95-4: havoc #t~nondet22#1; [2025-02-08 05:39:39,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L95-5: ~q1_front~0 := 1 + #t~post21#1; [2025-02-08 05:39:39,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L95-6: assume 0 == #race~q1_front~0; [2025-02-08 05:39:39,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L95-6: assume !(0 == #race~q1_front~0); [2025-02-08 05:39:39,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L95-7: #t~post21#1 := ~q1_front~0; [2025-02-08 05:39:39,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L95-8: #race~q1_front~0 := 0; [2025-02-08 05:39:39,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96: [2025-02-08 05:39:39,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L97: #race~i~0 := 0; [2025-02-08 05:39:39,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L98: havoc #t~short23#1; [2025-02-08 05:39:39,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L98-1: ~cond~2#1 := (if 0 == (if #t~short23#1 then 1 else 0) then 0 else 1); [2025-02-08 05:39:39,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L98-2: assume 0 == #race~q1_back~0; [2025-02-08 05:39:39,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L98-2: assume !(0 == #race~q1_back~0); [2025-02-08 05:39:39,075 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L98-3: #t~short23#1 := ~q1_front~0 < ~q1_back~0; [2025-02-08 05:39:39,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L98-4: assume 0 == #race~q1_front~0; [2025-02-08 05:39:39,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L98-4: assume !(0 == #race~q1_front~0); [2025-02-08 05:39:39,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L98-5: #race~q1_back~0 := 0; [2025-02-08 05:39:39,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L98-6: assume #t~short23#1; [2025-02-08 05:39:39,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L98-6: assume !#t~short23#1; [2025-02-08 05:39:39,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L98-7: #race~q1_front~0 := 0; [2025-02-08 05:39:39,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L98-8: assume 0 == #race~N~0; [2025-02-08 05:39:39,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L98-8: assume !(0 == #race~N~0); [2025-02-08 05:39:39,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L98-9: #t~short23#1 := ~i~0 < ~N~0; [2025-02-08 05:39:39,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L98-10: assume 0 == #race~i~0; [2025-02-08 05:39:39,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L98-10: assume !(0 == #race~i~0); [2025-02-08 05:39:39,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L98-11: #race~N~0 := 0; [2025-02-08 05:39:39,077 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L99: [2025-02-08 05:39:39,380 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112: havoc #t~nondet29#1; [2025-02-08 05:39:39,380 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112-1: havoc #t~ret28#1; [2025-02-08 05:39:39,380 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112-2: assume #race~total~0 == #t~nondet29#1; [2025-02-08 05:39:39,380 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112-2: assume !(#race~total~0 == #t~nondet29#1); [2025-02-08 05:39:39,380 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112-3: havoc #t~mem27#1; [2025-02-08 05:39:39,380 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112-4: #race~total~0 := #t~nondet29#1; [2025-02-08 05:39:39,381 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112-5: havoc #t~nondet29#1; [2025-02-08 05:39:39,381 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112-6: ~total~0 := #t~ret28#1; [2025-02-08 05:39:39,381 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112-7: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647; [2025-02-08 05:39:39,381 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112-8: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:39:39,381 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112-9: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:39:39,381 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112-10: #t~ret28#1 := plus_#res#1; [2025-02-08 05:39:39,381 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113: havoc #t~nondet31#1; [2025-02-08 05:39:39,381 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113-1: assume #race~q2_front~0 == #t~nondet31#1; [2025-02-08 05:39:39,381 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113-1: assume !(#race~q2_front~0 == #t~nondet31#1); [2025-02-08 05:39:39,381 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113-2: havoc #t~post30#1; [2025-02-08 05:39:39,381 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113-3: #race~q2_front~0 := #t~nondet31#1; [2025-02-08 05:39:39,381 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113-4: havoc #t~nondet31#1; [2025-02-08 05:39:39,381 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113-5: ~q2_front~0 := 1 + #t~post30#1; [2025-02-08 05:39:39,381 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113-6: assume 0 == #race~q2_front~0; [2025-02-08 05:39:39,381 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113-6: assume !(0 == #race~q2_front~0); [2025-02-08 05:39:39,381 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113-7: #t~post30#1 := ~q2_front~0; [2025-02-08 05:39:39,381 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113-8: #race~q2_front~0 := 0; [2025-02-08 05:39:39,381 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114: [2025-02-08 05:39:39,381 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L115: #race~j~0 := 0; [2025-02-08 05:39:39,381 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L116: havoc #t~short32#1; [2025-02-08 05:39:39,381 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L116-1: ~cond~3#1 := (if 0 == (if #t~short32#1 then 1 else 0) then 0 else 1); [2025-02-08 05:39:39,381 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L116-2: assume 0 == #race~q2_back~0; [2025-02-08 05:39:39,381 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L116-2: assume !(0 == #race~q2_back~0); [2025-02-08 05:39:39,381 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L116-3: #t~short32#1 := ~q2_front~0 < ~q2_back~0; [2025-02-08 05:39:39,382 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L116-4: assume 0 == #race~q2_front~0; [2025-02-08 05:39:39,382 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L116-4: assume !(0 == #race~q2_front~0); [2025-02-08 05:39:39,382 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L116-5: #race~q2_back~0 := 0; [2025-02-08 05:39:39,382 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L116-6: assume #t~short32#1; [2025-02-08 05:39:39,382 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L116-6: assume !#t~short32#1; [2025-02-08 05:39:39,382 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L116-7: #race~q2_front~0 := 0; [2025-02-08 05:39:39,382 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L116-8: assume 0 == #race~M~0; [2025-02-08 05:39:39,382 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L116-8: assume !(0 == #race~M~0); [2025-02-08 05:39:39,382 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L116-9: #t~short32#1 := ~j~0 < ~M~0; [2025-02-08 05:39:39,382 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L116-10: assume 0 == #race~j~0; [2025-02-08 05:39:39,382 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L116-10: assume !(0 == #race~j~0); [2025-02-08 05:39:39,382 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L116-11: #race~M~0 := 0; [2025-02-08 05:39:39,382 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L117: [2025-02-08 05:39:39,383 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:39:39,383 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:39:39,670 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L173 is not an error location. [2025-02-08 05:39:39,671 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L173 is not an error location. [2025-02-08 05:39:39,672 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:39:39,672 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:39:39,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:39:39 BoogieIcfgContainer [2025-02-08 05:39:39,672 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:39:39,674 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:39:39,674 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:39:39,678 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:39:39,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:39:38" (1/3) ... [2025-02-08 05:39:39,679 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@786c6507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:39:39, skipping insertion in model container [2025-02-08 05:39:39,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:38" (2/3) ... [2025-02-08 05:39:39,679 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@786c6507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:39:39, skipping insertion in model container [2025-02-08 05:39:39,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:39:39" (3/3) ... [2025-02-08 05:39:39,680 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt.wvr.c [2025-02-08 05:39:39,692 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:39:39,693 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-buffer-mult-alt.wvr.c that has 5 procedures, 407 locations, 1 initial locations, 6 loop locations, and 95 error locations. [2025-02-08 05:39:39,693 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:39:39,784 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-08 05:39:39,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 419 places, 421 transitions, 870 flow [2025-02-08 05:39:39,910 INFO L124 PetriNetUnfolderBase]: 15/417 cut-off events. [2025-02-08 05:39:39,913 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:39:39,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 417 events. 15/417 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 562 event pairs, 0 based on Foata normal form. 0/319 useless extension candidates. Maximal degree in co-relation 377. Up to 2 conditions per place. [2025-02-08 05:39:39,922 INFO L82 GeneralOperation]: Start removeDead. Operand has 419 places, 421 transitions, 870 flow [2025-02-08 05:39:39,931 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 399 places, 400 transitions, 824 flow [2025-02-08 05:39:39,936 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:39:39,945 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;@6cfa13ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:39:39,945 INFO L334 AbstractCegarLoop]: Starting to check reachability of 141 error locations. [2025-02-08 05:39:39,953 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:39:39,954 INFO L124 PetriNetUnfolderBase]: 0/32 cut-off events. [2025-02-08 05:39:39,954 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:39:39,954 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:39,955 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] [2025-02-08 05:39:39,955 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 137 more)] === [2025-02-08 05:39:39,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:39,960 INFO L85 PathProgramCache]: Analyzing trace with hash 73792608, now seen corresponding path program 1 times [2025-02-08 05:39:39,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:39,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947227661] [2025-02-08 05:39:39,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:39,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:40,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 05:39:40,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 05:39:40,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:40,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:40,085 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:39:40,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:40,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947227661] [2025-02-08 05:39:40,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947227661] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:40,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:40,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:40,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970423087] [2025-02-08 05:39:40,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:40,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:40,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:40,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:40,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:40,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 328 out of 421 [2025-02-08 05:39:40,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 400 transitions, 824 flow. Second operand has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 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:39:40,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:40,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 328 of 421 [2025-02-08 05:39:40,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:40,584 INFO L124 PetriNetUnfolderBase]: 605/1573 cut-off events. [2025-02-08 05:39:40,585 INFO L125 PetriNetUnfolderBase]: For 214/214 co-relation queries the response was YES. [2025-02-08 05:39:40,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2633 conditions, 1573 events. 605/1573 cut-off events. For 214/214 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8670 event pairs, 485 based on Foata normal form. 6/1413 useless extension candidates. Maximal degree in co-relation 2224. Up to 866 conditions per place. [2025-02-08 05:39:40,597 INFO L140 encePairwiseOnDemand]: 356/421 looper letters, 23 selfloop transitions, 2 changer transitions 8/337 dead transitions. [2025-02-08 05:39:40,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 337 transitions, 752 flow [2025-02-08 05:39:40,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:40,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:40,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1074 transitions. [2025-02-08 05:39:40,614 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.850356294536817 [2025-02-08 05:39:40,616 INFO L175 Difference]: Start difference. First operand has 399 places, 400 transitions, 824 flow. Second operand 3 states and 1074 transitions. [2025-02-08 05:39:40,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 337 transitions, 752 flow [2025-02-08 05:39:40,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 337 transitions, 736 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-02-08 05:39:40,630 INFO L231 Difference]: Finished difference. Result has 336 places, 329 transitions, 670 flow [2025-02-08 05:39:40,633 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=670, PETRI_PLACES=336, PETRI_TRANSITIONS=329} [2025-02-08 05:39:40,637 INFO L279 CegarLoopForPetriNet]: 399 programPoint places, -63 predicate places. [2025-02-08 05:39:40,638 INFO L471 AbstractCegarLoop]: Abstraction has has 336 places, 329 transitions, 670 flow [2025-02-08 05:39:40,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 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:39:40,639 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:40,639 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] [2025-02-08 05:39:40,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:39:40,639 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 137 more)] === [2025-02-08 05:39:40,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:40,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1960121347, now seen corresponding path program 1 times [2025-02-08 05:39:40,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:40,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263079939] [2025-02-08 05:39:40,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:40,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:40,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 05:39:40,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 05:39:40,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:40,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:40,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:39:40,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:40,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263079939] [2025-02-08 05:39:40,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263079939] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:40,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:40,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:40,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574505032] [2025-02-08 05:39:40,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:40,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:40,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:40,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:40,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:40,726 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 328 out of 421 [2025-02-08 05:39:40,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 329 transitions, 670 flow. Second operand has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 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:39:40,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:40,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 328 of 421 [2025-02-08 05:39:40,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:40,935 INFO L124 PetriNetUnfolderBase]: 288/999 cut-off events. [2025-02-08 05:39:40,936 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 05:39:40,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1485 conditions, 999 events. 288/999 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4610 event pairs, 221 based on Foata normal form. 0/876 useless extension candidates. Maximal degree in co-relation 1445. Up to 427 conditions per place. [2025-02-08 05:39:40,943 INFO L140 encePairwiseOnDemand]: 418/421 looper letters, 23 selfloop transitions, 2 changer transitions 0/328 dead transitions. [2025-02-08 05:39:40,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 328 transitions, 718 flow [2025-02-08 05:39:40,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:40,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:40,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1010 transitions. [2025-02-08 05:39:40,946 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7996832937450514 [2025-02-08 05:39:40,946 INFO L175 Difference]: Start difference. First operand has 336 places, 329 transitions, 670 flow. Second operand 3 states and 1010 transitions. [2025-02-08 05:39:40,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 328 transitions, 718 flow [2025-02-08 05:39:40,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 328 transitions, 714 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:40,952 INFO L231 Difference]: Finished difference. Result has 327 places, 328 transitions, 668 flow [2025-02-08 05:39:40,952 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=668, PETRI_PLACES=327, PETRI_TRANSITIONS=328} [2025-02-08 05:39:40,953 INFO L279 CegarLoopForPetriNet]: 399 programPoint places, -72 predicate places. [2025-02-08 05:39:40,953 INFO L471 AbstractCegarLoop]: Abstraction has has 327 places, 328 transitions, 668 flow [2025-02-08 05:39:40,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 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:39:40,954 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:40,954 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] [2025-02-08 05:39:40,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:39:40,954 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 137 more)] === [2025-02-08 05:39:40,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:40,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1669861778, now seen corresponding path program 1 times [2025-02-08 05:39:40,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:40,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523191057] [2025-02-08 05:39:40,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:40,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:40,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 05:39:40,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 05:39:40,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:40,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:40,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:40,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:40,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523191057] [2025-02-08 05:39:40,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523191057] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:40,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:40,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:40,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097166149] [2025-02-08 05:39:40,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:40,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:40,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:40,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:40,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:41,007 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 421 [2025-02-08 05:39:41,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 328 transitions, 668 flow. Second operand has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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:39:41,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:41,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 421 [2025-02-08 05:39:41,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:41,184 INFO L124 PetriNetUnfolderBase]: 288/998 cut-off events. [2025-02-08 05:39:41,185 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 05:39:41,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1483 conditions, 998 events. 288/998 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4589 event pairs, 221 based on Foata normal form. 0/876 useless extension candidates. Maximal degree in co-relation 1435. Up to 426 conditions per place. [2025-02-08 05:39:41,191 INFO L140 encePairwiseOnDemand]: 418/421 looper letters, 22 selfloop transitions, 2 changer transitions 0/327 dead transitions. [2025-02-08 05:39:41,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 327 transitions, 714 flow [2025-02-08 05:39:41,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:41,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:41,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1012 transitions. [2025-02-08 05:39:41,194 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8012668250197942 [2025-02-08 05:39:41,194 INFO L175 Difference]: Start difference. First operand has 327 places, 328 transitions, 668 flow. Second operand 3 states and 1012 transitions. [2025-02-08 05:39:41,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 327 transitions, 714 flow [2025-02-08 05:39:41,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 327 transitions, 710 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:41,236 INFO L231 Difference]: Finished difference. Result has 326 places, 327 transitions, 666 flow [2025-02-08 05:39:41,236 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=666, PETRI_PLACES=326, PETRI_TRANSITIONS=327} [2025-02-08 05:39:41,237 INFO L279 CegarLoopForPetriNet]: 399 programPoint places, -73 predicate places. [2025-02-08 05:39:41,237 INFO L471 AbstractCegarLoop]: Abstraction has has 326 places, 327 transitions, 666 flow [2025-02-08 05:39:41,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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:39:41,238 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:41,238 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] [2025-02-08 05:39:41,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:39:41,238 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 137 more)] === [2025-02-08 05:39:41,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:41,239 INFO L85 PathProgramCache]: Analyzing trace with hash 2073565455, now seen corresponding path program 1 times [2025-02-08 05:39:41,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:41,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278272749] [2025-02-08 05:39:41,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:41,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:41,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-08 05:39:41,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 05:39:41,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:41,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:41,285 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:39:41,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:41,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278272749] [2025-02-08 05:39:41,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278272749] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:41,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:41,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:41,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516512692] [2025-02-08 05:39:41,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:41,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:41,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:41,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:41,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:41,304 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 421 [2025-02-08 05:39:41,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 327 transitions, 666 flow. Second operand has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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:39:41,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:41,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 421 [2025-02-08 05:39:41,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:41,428 INFO L124 PetriNetUnfolderBase]: 288/997 cut-off events. [2025-02-08 05:39:41,429 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 05:39:41,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1482 conditions, 997 events. 288/997 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4644 event pairs, 221 based on Foata normal form. 0/876 useless extension candidates. Maximal degree in co-relation 1426. Up to 426 conditions per place. [2025-02-08 05:39:41,434 INFO L140 encePairwiseOnDemand]: 418/421 looper letters, 22 selfloop transitions, 2 changer transitions 0/326 dead transitions. [2025-02-08 05:39:41,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 326 transitions, 712 flow [2025-02-08 05:39:41,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:41,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:41,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1012 transitions. [2025-02-08 05:39:41,436 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8012668250197942 [2025-02-08 05:39:41,436 INFO L175 Difference]: Start difference. First operand has 326 places, 327 transitions, 666 flow. Second operand 3 states and 1012 transitions. [2025-02-08 05:39:41,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 326 transitions, 712 flow [2025-02-08 05:39:41,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 326 transitions, 708 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:41,440 INFO L231 Difference]: Finished difference. Result has 325 places, 326 transitions, 664 flow [2025-02-08 05:39:41,441 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=664, PETRI_PLACES=325, PETRI_TRANSITIONS=326} [2025-02-08 05:39:41,441 INFO L279 CegarLoopForPetriNet]: 399 programPoint places, -74 predicate places. [2025-02-08 05:39:41,442 INFO L471 AbstractCegarLoop]: Abstraction has has 325 places, 326 transitions, 664 flow [2025-02-08 05:39:41,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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:39:41,442 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:41,442 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] [2025-02-08 05:39:41,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:39:41,443 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 137 more)] === [2025-02-08 05:39:41,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:41,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1223032988, now seen corresponding path program 1 times [2025-02-08 05:39:41,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:41,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166086015] [2025-02-08 05:39:41,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:41,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:41,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-08 05:39:41,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-08 05:39:41,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:41,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:41,508 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:39:41,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:41,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166086015] [2025-02-08 05:39:41,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166086015] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:41,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:41,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:41,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942943043] [2025-02-08 05:39:41,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:41,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:41,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:41,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:41,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:41,521 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 421 [2025-02-08 05:39:41,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 326 transitions, 664 flow. Second operand has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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:39:41,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:41,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 421 [2025-02-08 05:39:41,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:41,653 INFO L124 PetriNetUnfolderBase]: 288/996 cut-off events. [2025-02-08 05:39:41,654 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 05:39:41,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1481 conditions, 996 events. 288/996 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4636 event pairs, 221 based on Foata normal form. 0/876 useless extension candidates. Maximal degree in co-relation 1417. Up to 426 conditions per place. [2025-02-08 05:39:41,660 INFO L140 encePairwiseOnDemand]: 418/421 looper letters, 22 selfloop transitions, 2 changer transitions 0/325 dead transitions. [2025-02-08 05:39:41,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 325 transitions, 710 flow [2025-02-08 05:39:41,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:41,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:41,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1012 transitions. [2025-02-08 05:39:41,663 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8012668250197942 [2025-02-08 05:39:41,663 INFO L175 Difference]: Start difference. First operand has 325 places, 326 transitions, 664 flow. Second operand 3 states and 1012 transitions. [2025-02-08 05:39:41,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 325 transitions, 710 flow [2025-02-08 05:39:41,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 325 transitions, 706 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:41,667 INFO L231 Difference]: Finished difference. Result has 324 places, 325 transitions, 662 flow [2025-02-08 05:39:41,667 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=662, PETRI_PLACES=324, PETRI_TRANSITIONS=325} [2025-02-08 05:39:41,669 INFO L279 CegarLoopForPetriNet]: 399 programPoint places, -75 predicate places. [2025-02-08 05:39:41,669 INFO L471 AbstractCegarLoop]: Abstraction has has 324 places, 325 transitions, 662 flow [2025-02-08 05:39:41,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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:39:41,670 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:41,670 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:41,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:39:41,670 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 137 more)] === [2025-02-08 05:39:41,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:41,671 INFO L85 PathProgramCache]: Analyzing trace with hash 631410291, now seen corresponding path program 1 times [2025-02-08 05:39:41,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:41,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985594401] [2025-02-08 05:39:41,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:41,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:41,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-08 05:39:41,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-08 05:39:41,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:41,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:41,736 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:39:41,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:41,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985594401] [2025-02-08 05:39:41,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985594401] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:41,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:41,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:41,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274993421] [2025-02-08 05:39:41,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:41,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:41,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:41,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:41,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:41,750 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 421 [2025-02-08 05:39:41,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 325 transitions, 662 flow. Second operand has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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:39:41,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:41,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 421 [2025-02-08 05:39:41,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:41,876 INFO L124 PetriNetUnfolderBase]: 288/995 cut-off events. [2025-02-08 05:39:41,876 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 05:39:41,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1480 conditions, 995 events. 288/995 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4628 event pairs, 221 based on Foata normal form. 0/876 useless extension candidates. Maximal degree in co-relation 1408. Up to 426 conditions per place. [2025-02-08 05:39:41,880 INFO L140 encePairwiseOnDemand]: 418/421 looper letters, 22 selfloop transitions, 2 changer transitions 0/324 dead transitions. [2025-02-08 05:39:41,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 324 transitions, 708 flow [2025-02-08 05:39:41,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:41,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:41,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1012 transitions. [2025-02-08 05:39:41,883 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8012668250197942 [2025-02-08 05:39:41,883 INFO L175 Difference]: Start difference. First operand has 324 places, 325 transitions, 662 flow. Second operand 3 states and 1012 transitions. [2025-02-08 05:39:41,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 324 transitions, 708 flow [2025-02-08 05:39:41,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 324 transitions, 704 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:41,887 INFO L231 Difference]: Finished difference. Result has 323 places, 324 transitions, 660 flow [2025-02-08 05:39:41,887 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=660, PETRI_PLACES=323, PETRI_TRANSITIONS=324} [2025-02-08 05:39:41,888 INFO L279 CegarLoopForPetriNet]: 399 programPoint places, -76 predicate places. [2025-02-08 05:39:41,888 INFO L471 AbstractCegarLoop]: Abstraction has has 323 places, 324 transitions, 660 flow [2025-02-08 05:39:41,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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:39:41,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:41,889 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] [2025-02-08 05:39:41,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:39:41,889 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 137 more)] === [2025-02-08 05:39:41,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:41,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1370157057, now seen corresponding path program 1 times [2025-02-08 05:39:41,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:41,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225332932] [2025-02-08 05:39:41,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:41,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:41,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-08 05:39:41,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-08 05:39:41,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:41,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:41,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:39:41,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:41,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225332932] [2025-02-08 05:39:41,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225332932] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:41,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:41,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:41,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207747040] [2025-02-08 05:39:41,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:41,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:41,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:41,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:41,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:41,941 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 421 [2025-02-08 05:39:41,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 324 transitions, 660 flow. Second operand has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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:39:41,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:41,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 421 [2025-02-08 05:39:41,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:42,060 INFO L124 PetriNetUnfolderBase]: 288/994 cut-off events. [2025-02-08 05:39:42,060 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 05:39:42,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1479 conditions, 994 events. 288/994 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4631 event pairs, 221 based on Foata normal form. 0/876 useless extension candidates. Maximal degree in co-relation 1399. Up to 426 conditions per place. [2025-02-08 05:39:42,065 INFO L140 encePairwiseOnDemand]: 418/421 looper letters, 22 selfloop transitions, 2 changer transitions 0/323 dead transitions. [2025-02-08 05:39:42,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 323 transitions, 706 flow [2025-02-08 05:39:42,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:42,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:42,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1012 transitions. [2025-02-08 05:39:42,071 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8012668250197942 [2025-02-08 05:39:42,071 INFO L175 Difference]: Start difference. First operand has 323 places, 324 transitions, 660 flow. Second operand 3 states and 1012 transitions. [2025-02-08 05:39:42,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 323 transitions, 706 flow [2025-02-08 05:39:42,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 323 transitions, 702 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:42,077 INFO L231 Difference]: Finished difference. Result has 322 places, 323 transitions, 658 flow [2025-02-08 05:39:42,079 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=658, PETRI_PLACES=322, PETRI_TRANSITIONS=323} [2025-02-08 05:39:42,081 INFO L279 CegarLoopForPetriNet]: 399 programPoint places, -77 predicate places. [2025-02-08 05:39:42,081 INFO L471 AbstractCegarLoop]: Abstraction has has 322 places, 323 transitions, 658 flow [2025-02-08 05:39:42,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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:39:42,082 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:42,082 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] [2025-02-08 05:39:42,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:39:42,082 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 137 more)] === [2025-02-08 05:39:42,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:42,083 INFO L85 PathProgramCache]: Analyzing trace with hash -2072358331, now seen corresponding path program 1 times [2025-02-08 05:39:42,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:42,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893980817] [2025-02-08 05:39:42,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:42,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:42,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 05:39:42,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 05:39:42,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:42,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:42,138 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:39:42,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:42,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893980817] [2025-02-08 05:39:42,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893980817] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:42,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:42,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:42,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961825465] [2025-02-08 05:39:42,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:42,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:42,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:42,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:42,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:42,153 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 421 [2025-02-08 05:39:42,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 323 transitions, 658 flow. Second operand has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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:39:42,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:42,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 421 [2025-02-08 05:39:42,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:42,279 INFO L124 PetriNetUnfolderBase]: 288/993 cut-off events. [2025-02-08 05:39:42,279 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 05:39:42,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1478 conditions, 993 events. 288/993 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4627 event pairs, 221 based on Foata normal form. 0/876 useless extension candidates. Maximal degree in co-relation 1390. Up to 426 conditions per place. [2025-02-08 05:39:42,284 INFO L140 encePairwiseOnDemand]: 418/421 looper letters, 22 selfloop transitions, 2 changer transitions 0/322 dead transitions. [2025-02-08 05:39:42,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 322 transitions, 704 flow [2025-02-08 05:39:42,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:42,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:42,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1012 transitions. [2025-02-08 05:39:42,287 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8012668250197942 [2025-02-08 05:39:42,287 INFO L175 Difference]: Start difference. First operand has 322 places, 323 transitions, 658 flow. Second operand 3 states and 1012 transitions. [2025-02-08 05:39:42,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 322 transitions, 704 flow [2025-02-08 05:39:42,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 322 transitions, 700 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:42,291 INFO L231 Difference]: Finished difference. Result has 321 places, 322 transitions, 656 flow [2025-02-08 05:39:42,292 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=652, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=656, PETRI_PLACES=321, PETRI_TRANSITIONS=322} [2025-02-08 05:39:42,293 INFO L279 CegarLoopForPetriNet]: 399 programPoint places, -78 predicate places. [2025-02-08 05:39:42,293 INFO L471 AbstractCegarLoop]: Abstraction has has 321 places, 322 transitions, 656 flow [2025-02-08 05:39:42,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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:39:42,294 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:42,294 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] [2025-02-08 05:39:42,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:39:42,294 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 137 more)] === [2025-02-08 05:39:42,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:42,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1112626139, now seen corresponding path program 1 times [2025-02-08 05:39:42,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:42,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818268052] [2025-02-08 05:39:42,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:42,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:42,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-08 05:39:42,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-08 05:39:42,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:42,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:42,354 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:39:42,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:42,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818268052] [2025-02-08 05:39:42,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818268052] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:42,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:42,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:42,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236880058] [2025-02-08 05:39:42,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:42,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:42,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:42,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:42,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:42,367 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 421 [2025-02-08 05:39:42,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 322 transitions, 656 flow. Second operand has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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:39:42,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:42,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 421 [2025-02-08 05:39:42,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:42,472 INFO L124 PetriNetUnfolderBase]: 288/992 cut-off events. [2025-02-08 05:39:42,472 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 05:39:42,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1477 conditions, 992 events. 288/992 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4628 event pairs, 221 based on Foata normal form. 0/876 useless extension candidates. Maximal degree in co-relation 1381. Up to 426 conditions per place. [2025-02-08 05:39:42,476 INFO L140 encePairwiseOnDemand]: 418/421 looper letters, 22 selfloop transitions, 2 changer transitions 0/321 dead transitions. [2025-02-08 05:39:42,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 321 transitions, 702 flow [2025-02-08 05:39:42,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:42,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:42,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1012 transitions. [2025-02-08 05:39:42,479 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8012668250197942 [2025-02-08 05:39:42,479 INFO L175 Difference]: Start difference. First operand has 321 places, 322 transitions, 656 flow. Second operand 3 states and 1012 transitions. [2025-02-08 05:39:42,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 321 transitions, 702 flow [2025-02-08 05:39:42,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 321 transitions, 698 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:42,482 INFO L231 Difference]: Finished difference. Result has 320 places, 321 transitions, 654 flow [2025-02-08 05:39:42,483 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=654, PETRI_PLACES=320, PETRI_TRANSITIONS=321} [2025-02-08 05:39:42,483 INFO L279 CegarLoopForPetriNet]: 399 programPoint places, -79 predicate places. [2025-02-08 05:39:42,483 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 321 transitions, 654 flow [2025-02-08 05:39:42,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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:39:42,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:42,484 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] [2025-02-08 05:39:42,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:39:42,484 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 137 more)] === [2025-02-08 05:39:42,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:42,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1291860836, now seen corresponding path program 1 times [2025-02-08 05:39:42,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:42,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583688310] [2025-02-08 05:39:42,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:42,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:42,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-08 05:39:42,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-08 05:39:42,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:42,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:42,514 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:39:42,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:42,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583688310] [2025-02-08 05:39:42,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583688310] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:42,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:42,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:42,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699944202] [2025-02-08 05:39:42,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:42,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:42,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:42,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:42,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:42,520 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 421 [2025-02-08 05:39:42,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 321 transitions, 654 flow. Second operand has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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:39:42,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:42,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 421 [2025-02-08 05:39:42,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:42,626 INFO L124 PetriNetUnfolderBase]: 288/991 cut-off events. [2025-02-08 05:39:42,627 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 05:39:42,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1473 conditions, 991 events. 288/991 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4646 event pairs, 221 based on Foata normal form. 0/876 useless extension candidates. Maximal degree in co-relation 1369. Up to 423 conditions per place. [2025-02-08 05:39:42,633 INFO L140 encePairwiseOnDemand]: 419/421 looper letters, 20 selfloop transitions, 1 changer transitions 0/320 dead transitions. [2025-02-08 05:39:42,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 320 transitions, 694 flow [2025-02-08 05:39:42,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:42,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:42,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1021 transitions. [2025-02-08 05:39:42,636 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8083927157561361 [2025-02-08 05:39:42,636 INFO L175 Difference]: Start difference. First operand has 320 places, 321 transitions, 654 flow. Second operand 3 states and 1021 transitions. [2025-02-08 05:39:42,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 320 transitions, 694 flow [2025-02-08 05:39:42,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 320 transitions, 690 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:42,641 INFO L231 Difference]: Finished difference. Result has 319 places, 320 transitions, 650 flow [2025-02-08 05:39:42,641 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=648, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=650, PETRI_PLACES=319, PETRI_TRANSITIONS=320} [2025-02-08 05:39:42,642 INFO L279 CegarLoopForPetriNet]: 399 programPoint places, -80 predicate places. [2025-02-08 05:39:42,642 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 320 transitions, 650 flow [2025-02-08 05:39:42,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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:39:42,643 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:42,643 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] [2025-02-08 05:39:42,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:39:42,643 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 137 more)] === [2025-02-08 05:39:42,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:42,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1403327767, now seen corresponding path program 1 times [2025-02-08 05:39:42,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:42,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993214772] [2025-02-08 05:39:42,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:42,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:42,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-08 05:39:42,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-08 05:39:42,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:42,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:42,715 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:39:42,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:42,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993214772] [2025-02-08 05:39:42,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993214772] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:42,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:42,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:42,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333184726] [2025-02-08 05:39:42,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:42,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:42,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:42,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:42,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:42,727 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 421 [2025-02-08 05:39:42,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 320 transitions, 650 flow. Second operand has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 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:39:42,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:42,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 421 [2025-02-08 05:39:42,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:42,883 INFO L124 PetriNetUnfolderBase]: 288/990 cut-off events. [2025-02-08 05:39:42,883 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 05:39:42,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1473 conditions, 990 events. 288/990 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4642 event pairs, 221 based on Foata normal form. 0/876 useless extension candidates. Maximal degree in co-relation 1369. Up to 425 conditions per place. [2025-02-08 05:39:42,888 INFO L140 encePairwiseOnDemand]: 418/421 looper letters, 21 selfloop transitions, 2 changer transitions 0/319 dead transitions. [2025-02-08 05:39:42,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 319 transitions, 694 flow [2025-02-08 05:39:42,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:42,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:42,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1014 transitions. [2025-02-08 05:39:42,891 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8028503562945368 [2025-02-08 05:39:42,891 INFO L175 Difference]: Start difference. First operand has 319 places, 320 transitions, 650 flow. Second operand 3 states and 1014 transitions. [2025-02-08 05:39:42,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 319 transitions, 694 flow [2025-02-08 05:39:42,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 319 transitions, 693 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:42,898 INFO L231 Difference]: Finished difference. Result has 319 places, 319 transitions, 651 flow [2025-02-08 05:39:42,898 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=651, PETRI_PLACES=319, PETRI_TRANSITIONS=319} [2025-02-08 05:39:42,899 INFO L279 CegarLoopForPetriNet]: 399 programPoint places, -80 predicate places. [2025-02-08 05:39:42,899 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 319 transitions, 651 flow [2025-02-08 05:39:42,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 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:39:42,900 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:42,900 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] [2025-02-08 05:39:42,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:39:42,900 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 137 more)] === [2025-02-08 05:39:42,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:42,901 INFO L85 PathProgramCache]: Analyzing trace with hash 802335372, now seen corresponding path program 1 times [2025-02-08 05:39:42,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:42,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572590188] [2025-02-08 05:39:42,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:42,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:42,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-08 05:39:42,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-08 05:39:42,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:42,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:43,413 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:39:43,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:43,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572590188] [2025-02-08 05:39:43,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572590188] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:43,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:43,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:39:43,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791011451] [2025-02-08 05:39:43,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:43,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:39:43,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:43,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:39:43,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:39:43,562 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 421 [2025-02-08 05:39:43,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 319 transitions, 651 flow. Second operand has 6 states, 6 states have (on average 310.5) internal successors, (1863), 6 states have internal predecessors, (1863), 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:39:43,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:43,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 421 [2025-02-08 05:39:43,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:43,732 INFO L124 PetriNetUnfolderBase]: 288/988 cut-off events. [2025-02-08 05:39:43,732 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 05:39:43,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1494 conditions, 988 events. 288/988 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4611 event pairs, 221 based on Foata normal form. 0/876 useless extension candidates. Maximal degree in co-relation 1391. Up to 438 conditions per place. [2025-02-08 05:39:43,736 INFO L140 encePairwiseOnDemand]: 409/421 looper letters, 34 selfloop transitions, 10 changer transitions 0/317 dead transitions. [2025-02-08 05:39:43,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 317 transitions, 735 flow [2025-02-08 05:39:43,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:39:43,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:39:43,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1900 transitions. [2025-02-08 05:39:43,740 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7521773555027712 [2025-02-08 05:39:43,740 INFO L175 Difference]: Start difference. First operand has 319 places, 319 transitions, 651 flow. Second operand 6 states and 1900 transitions. [2025-02-08 05:39:43,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 317 transitions, 735 flow [2025-02-08 05:39:43,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 317 transitions, 731 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:43,745 INFO L231 Difference]: Finished difference. Result has 320 places, 317 transitions, 663 flow [2025-02-08 05:39:43,745 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=663, PETRI_PLACES=320, PETRI_TRANSITIONS=317} [2025-02-08 05:39:43,746 INFO L279 CegarLoopForPetriNet]: 399 programPoint places, -79 predicate places. [2025-02-08 05:39:43,746 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 317 transitions, 663 flow [2025-02-08 05:39:43,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 310.5) internal successors, (1863), 6 states have internal predecessors, (1863), 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:39:43,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:43,747 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:43,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:39:43,748 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 137 more)] === [2025-02-08 05:39:43,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:43,748 INFO L85 PathProgramCache]: Analyzing trace with hash -529497755, now seen corresponding path program 1 times [2025-02-08 05:39:43,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:43,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307826481] [2025-02-08 05:39:43,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:43,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:43,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-08 05:39:43,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-08 05:39:43,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:43,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:43,784 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:39:43,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:43,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307826481] [2025-02-08 05:39:43,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307826481] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:43,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:43,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:43,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920669274] [2025-02-08 05:39:43,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:43,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:43,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:43,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:43,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:43,792 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 421 [2025-02-08 05:39:43,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 317 transitions, 663 flow. Second operand has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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:39:43,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:43,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 421 [2025-02-08 05:39:43,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:43,914 INFO L124 PetriNetUnfolderBase]: 288/987 cut-off events. [2025-02-08 05:39:43,914 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 05:39:43,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1478 conditions, 987 events. 288/987 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4606 event pairs, 221 based on Foata normal form. 0/876 useless extension candidates. Maximal degree in co-relation 1445. Up to 423 conditions per place. [2025-02-08 05:39:43,920 INFO L140 encePairwiseOnDemand]: 419/421 looper letters, 20 selfloop transitions, 1 changer transitions 0/316 dead transitions. [2025-02-08 05:39:43,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 316 transitions, 703 flow [2025-02-08 05:39:43,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:43,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:43,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1021 transitions. [2025-02-08 05:39:43,922 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8083927157561361 [2025-02-08 05:39:43,922 INFO L175 Difference]: Start difference. First operand has 320 places, 317 transitions, 663 flow. Second operand 3 states and 1021 transitions. [2025-02-08 05:39:43,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 316 transitions, 703 flow [2025-02-08 05:39:43,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 316 transitions, 683 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:39:43,926 INFO L231 Difference]: Finished difference. Result has 316 places, 316 transitions, 643 flow [2025-02-08 05:39:43,926 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=641, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=643, PETRI_PLACES=316, PETRI_TRANSITIONS=316} [2025-02-08 05:39:43,927 INFO L279 CegarLoopForPetriNet]: 399 programPoint places, -83 predicate places. [2025-02-08 05:39:43,927 INFO L471 AbstractCegarLoop]: Abstraction has has 316 places, 316 transitions, 643 flow [2025-02-08 05:39:43,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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:39:43,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:43,928 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] [2025-02-08 05:39:43,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:39:43,928 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 137 more)] === [2025-02-08 05:39:43,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:43,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1993405037, now seen corresponding path program 1 times [2025-02-08 05:39:43,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:43,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247400954] [2025-02-08 05:39:43,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:43,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:43,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-08 05:39:43,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-08 05:39:43,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:43,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:43,975 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:39:43,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:43,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247400954] [2025-02-08 05:39:43,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247400954] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:43,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:43,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:43,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529219575] [2025-02-08 05:39:43,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:43,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:43,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:43,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:43,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:43,983 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 421 [2025-02-08 05:39:43,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 316 transitions, 643 flow. Second operand has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 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:39:43,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:43,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 421 [2025-02-08 05:39:43,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:44,108 INFO L124 PetriNetUnfolderBase]: 288/986 cut-off events. [2025-02-08 05:39:44,108 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 05:39:44,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1470 conditions, 986 events. 288/986 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4622 event pairs, 221 based on Foata normal form. 0/876 useless extension candidates. Maximal degree in co-relation 1366. Up to 425 conditions per place. [2025-02-08 05:39:44,112 INFO L140 encePairwiseOnDemand]: 418/421 looper letters, 21 selfloop transitions, 2 changer transitions 0/315 dead transitions. [2025-02-08 05:39:44,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 315 transitions, 687 flow [2025-02-08 05:39:44,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:44,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:44,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1014 transitions. [2025-02-08 05:39:44,115 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8028503562945368 [2025-02-08 05:39:44,115 INFO L175 Difference]: Start difference. First operand has 316 places, 316 transitions, 643 flow. Second operand 3 states and 1014 transitions. [2025-02-08 05:39:44,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 315 transitions, 687 flow [2025-02-08 05:39:44,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 315 transitions, 686 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:44,118 INFO L231 Difference]: Finished difference. Result has 316 places, 315 transitions, 644 flow [2025-02-08 05:39:44,119 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=644, PETRI_PLACES=316, PETRI_TRANSITIONS=315} [2025-02-08 05:39:44,119 INFO L279 CegarLoopForPetriNet]: 399 programPoint places, -83 predicate places. [2025-02-08 05:39:44,119 INFO L471 AbstractCegarLoop]: Abstraction has has 316 places, 315 transitions, 644 flow [2025-02-08 05:39:44,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 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:39:44,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:44,120 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] [2025-02-08 05:39:44,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:39:44,120 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 137 more)] === [2025-02-08 05:39:44,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:44,121 INFO L85 PathProgramCache]: Analyzing trace with hash -378440414, now seen corresponding path program 1 times [2025-02-08 05:39:44,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:44,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6127173] [2025-02-08 05:39:44,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:44,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:44,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-08 05:39:44,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-08 05:39:44,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:44,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:44,177 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:39:44,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:44,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6127173] [2025-02-08 05:39:44,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6127173] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:44,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:44,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:44,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61579516] [2025-02-08 05:39:44,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:44,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:44,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:44,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:44,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:44,186 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 421 [2025-02-08 05:39:44,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 315 transitions, 644 flow. Second operand has 3 states, 3 states have (on average 331.0) internal successors, (993), 3 states have internal predecessors, (993), 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:39:44,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:44,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 421 [2025-02-08 05:39:44,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:44,288 INFO L124 PetriNetUnfolderBase]: 288/984 cut-off events. [2025-02-08 05:39:44,288 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 05:39:44,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1470 conditions, 984 events. 288/984 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4585 event pairs, 221 based on Foata normal form. 0/876 useless extension candidates. Maximal degree in co-relation 1366. Up to 425 conditions per place. [2025-02-08 05:39:44,292 INFO L140 encePairwiseOnDemand]: 418/421 looper letters, 22 selfloop transitions, 1 changer transitions 0/313 dead transitions. [2025-02-08 05:39:44,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 313 transitions, 686 flow [2025-02-08 05:39:44,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:44,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:44,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1015 transitions. [2025-02-08 05:39:44,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8036421219319082 [2025-02-08 05:39:44,295 INFO L175 Difference]: Start difference. First operand has 316 places, 315 transitions, 644 flow. Second operand 3 states and 1015 transitions. [2025-02-08 05:39:44,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 313 transitions, 686 flow [2025-02-08 05:39:44,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 313 transitions, 682 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:44,298 INFO L231 Difference]: Finished difference. Result has 314 places, 313 transitions, 638 flow [2025-02-08 05:39:44,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=638, PETRI_PLACES=314, PETRI_TRANSITIONS=313} [2025-02-08 05:39:44,300 INFO L279 CegarLoopForPetriNet]: 399 programPoint places, -85 predicate places. [2025-02-08 05:39:44,300 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 313 transitions, 638 flow [2025-02-08 05:39:44,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.0) internal successors, (993), 3 states have internal predecessors, (993), 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:39:44,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:44,300 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] [2025-02-08 05:39:44,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:39:44,301 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 137 more)] === [2025-02-08 05:39:44,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:44,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1157724016, now seen corresponding path program 1 times [2025-02-08 05:39:44,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:44,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150150934] [2025-02-08 05:39:44,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:44,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:44,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-08 05:39:44,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-08 05:39:44,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:44,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:44,355 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:39:44,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:44,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150150934] [2025-02-08 05:39:44,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150150934] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:44,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:44,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:44,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223903344] [2025-02-08 05:39:44,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:44,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:44,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:44,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:44,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:44,364 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 421 [2025-02-08 05:39:44,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 313 transitions, 638 flow. Second operand has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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:39:44,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:44,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 421 [2025-02-08 05:39:44,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:44,475 INFO L124 PetriNetUnfolderBase]: 288/983 cut-off events. [2025-02-08 05:39:44,475 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 05:39:44,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1466 conditions, 983 events. 288/983 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4599 event pairs, 221 based on Foata normal form. 0/876 useless extension candidates. Maximal degree in co-relation 1362. Up to 423 conditions per place. [2025-02-08 05:39:44,479 INFO L140 encePairwiseOnDemand]: 419/421 looper letters, 20 selfloop transitions, 1 changer transitions 0/312 dead transitions. [2025-02-08 05:39:44,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 312 transitions, 678 flow [2025-02-08 05:39:44,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:44,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:44,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1021 transitions. [2025-02-08 05:39:44,481 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8083927157561361 [2025-02-08 05:39:44,482 INFO L175 Difference]: Start difference. First operand has 314 places, 313 transitions, 638 flow. Second operand 3 states and 1021 transitions. [2025-02-08 05:39:44,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 312 transitions, 678 flow [2025-02-08 05:39:44,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 312 transitions, 677 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:44,485 INFO L231 Difference]: Finished difference. Result has 314 places, 312 transitions, 637 flow [2025-02-08 05:39:44,485 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=637, PETRI_PLACES=314, PETRI_TRANSITIONS=312} [2025-02-08 05:39:44,486 INFO L279 CegarLoopForPetriNet]: 399 programPoint places, -85 predicate places. [2025-02-08 05:39:44,486 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 312 transitions, 637 flow [2025-02-08 05:39:44,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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:39:44,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:44,488 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] [2025-02-08 05:39:44,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:39:44,488 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 137 more)] === [2025-02-08 05:39:44,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:44,489 INFO L85 PathProgramCache]: Analyzing trace with hash 176294381, now seen corresponding path program 1 times [2025-02-08 05:39:44,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:44,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673569961] [2025-02-08 05:39:44,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:44,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:44,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-08 05:39:44,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-08 05:39:44,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:44,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:44,532 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:39:44,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:44,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673569961] [2025-02-08 05:39:44,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673569961] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:44,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:44,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:44,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566663807] [2025-02-08 05:39:44,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:44,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:44,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:44,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:44,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:44,543 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 421 [2025-02-08 05:39:44,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 312 transitions, 637 flow. Second operand has 3 states, 3 states have (on average 331.0) internal successors, (993), 3 states have internal predecessors, (993), 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:39:44,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:44,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 421 [2025-02-08 05:39:44,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:44,653 INFO L124 PetriNetUnfolderBase]: 288/981 cut-off events. [2025-02-08 05:39:44,653 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 05:39:44,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1467 conditions, 981 events. 288/981 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4596 event pairs, 221 based on Foata normal form. 0/876 useless extension candidates. Maximal degree in co-relation 1363. Up to 425 conditions per place. [2025-02-08 05:39:44,656 INFO L140 encePairwiseOnDemand]: 418/421 looper letters, 22 selfloop transitions, 1 changer transitions 0/310 dead transitions. [2025-02-08 05:39:44,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 310 transitions, 679 flow [2025-02-08 05:39:44,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:44,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:44,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1015 transitions. [2025-02-08 05:39:44,658 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8036421219319082 [2025-02-08 05:39:44,658 INFO L175 Difference]: Start difference. First operand has 314 places, 312 transitions, 637 flow. Second operand 3 states and 1015 transitions. [2025-02-08 05:39:44,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 310 transitions, 679 flow [2025-02-08 05:39:44,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 310 transitions, 678 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:44,661 INFO L231 Difference]: Finished difference. Result has 313 places, 310 transitions, 634 flow [2025-02-08 05:39:44,661 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=634, PETRI_PLACES=313, PETRI_TRANSITIONS=310} [2025-02-08 05:39:44,662 INFO L279 CegarLoopForPetriNet]: 399 programPoint places, -86 predicate places. [2025-02-08 05:39:44,662 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 310 transitions, 634 flow [2025-02-08 05:39:44,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.0) internal successors, (993), 3 states have internal predecessors, (993), 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:39:44,662 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:44,662 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] [2025-02-08 05:39:44,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:39:44,663 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 137 more)] === [2025-02-08 05:39:44,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:44,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1200448263, now seen corresponding path program 1 times [2025-02-08 05:39:44,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:44,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811758983] [2025-02-08 05:39:44,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:44,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:44,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-02-08 05:39:44,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-02-08 05:39:44,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:44,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:44,712 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:39:44,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:44,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811758983] [2025-02-08 05:39:44,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811758983] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:44,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:44,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:44,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327006193] [2025-02-08 05:39:44,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:44,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:44,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:44,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:44,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:44,720 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 421 [2025-02-08 05:39:44,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 310 transitions, 634 flow. Second operand has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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:39:44,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:44,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 421 [2025-02-08 05:39:44,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:44,928 INFO L124 PetriNetUnfolderBase]: 570/1731 cut-off events. [2025-02-08 05:39:44,928 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-02-08 05:39:44,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2690 conditions, 1731 events. 570/1731 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 10755 event pairs, 442 based on Foata normal form. 0/1529 useless extension candidates. Maximal degree in co-relation 2586. Up to 423 conditions per place. [2025-02-08 05:39:44,936 INFO L140 encePairwiseOnDemand]: 419/421 looper letters, 38 selfloop transitions, 1 changer transitions 0/327 dead transitions. [2025-02-08 05:39:44,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 327 transitions, 754 flow [2025-02-08 05:39:44,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:44,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:44,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1039 transitions. [2025-02-08 05:39:44,939 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8226444972288203 [2025-02-08 05:39:44,939 INFO L175 Difference]: Start difference. First operand has 313 places, 310 transitions, 634 flow. Second operand 3 states and 1039 transitions. [2025-02-08 05:39:44,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 327 transitions, 754 flow [2025-02-08 05:39:44,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 327 transitions, 753 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:44,942 INFO L231 Difference]: Finished difference. Result has 313 places, 309 transitions, 633 flow [2025-02-08 05:39:44,943 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=631, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=633, PETRI_PLACES=313, PETRI_TRANSITIONS=309} [2025-02-08 05:39:44,943 INFO L279 CegarLoopForPetriNet]: 399 programPoint places, -86 predicate places. [2025-02-08 05:39:44,943 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 309 transitions, 633 flow [2025-02-08 05:39:44,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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:39:44,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:44,944 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] [2025-02-08 05:39:44,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:39:44,944 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 137 more)] === [2025-02-08 05:39:44,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:44,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1715380900, now seen corresponding path program 1 times [2025-02-08 05:39:44,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:44,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985713325] [2025-02-08 05:39:44,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:44,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:44,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-02-08 05:39:44,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-02-08 05:39:44,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:44,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:45,006 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:39:45,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:45,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985713325] [2025-02-08 05:39:45,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985713325] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:45,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:45,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:45,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451859208] [2025-02-08 05:39:45,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:45,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:45,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:45,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:45,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:45,018 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 421 [2025-02-08 05:39:45,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 309 transitions, 633 flow. Second operand has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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:39:45,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:45,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 421 [2025-02-08 05:39:45,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:45,274 INFO L124 PetriNetUnfolderBase]: 668/2037 cut-off events. [2025-02-08 05:39:45,275 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-02-08 05:39:45,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3160 conditions, 2037 events. 668/2037 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 13390 event pairs, 501 based on Foata normal form. 0/1776 useless extension candidates. Maximal degree in co-relation 3056. Up to 782 conditions per place. [2025-02-08 05:39:45,281 INFO L140 encePairwiseOnDemand]: 418/421 looper letters, 35 selfloop transitions, 2 changer transitions 0/324 dead transitions. [2025-02-08 05:39:45,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 324 transitions, 745 flow [2025-02-08 05:39:45,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:45,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:45,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1037 transitions. [2025-02-08 05:39:45,283 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8210609659540776 [2025-02-08 05:39:45,283 INFO L175 Difference]: Start difference. First operand has 313 places, 309 transitions, 633 flow. Second operand 3 states and 1037 transitions. [2025-02-08 05:39:45,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 324 transitions, 745 flow [2025-02-08 05:39:45,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 324 transitions, 744 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:45,289 INFO L231 Difference]: Finished difference. Result has 314 places, 309 transitions, 640 flow [2025-02-08 05:39:45,289 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=640, PETRI_PLACES=314, PETRI_TRANSITIONS=309} [2025-02-08 05:39:45,290 INFO L279 CegarLoopForPetriNet]: 399 programPoint places, -85 predicate places. [2025-02-08 05:39:45,290 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 309 transitions, 640 flow [2025-02-08 05:39:45,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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:39:45,290 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:45,290 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] [2025-02-08 05:39:45,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:39:45,290 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 137 more)] === [2025-02-08 05:39:45,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:45,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1719319539, now seen corresponding path program 1 times [2025-02-08 05:39:45,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:45,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99757463] [2025-02-08 05:39:45,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:45,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:45,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-02-08 05:39:45,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-02-08 05:39:45,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:45,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:45,338 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:39:45,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:45,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99757463] [2025-02-08 05:39:45,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99757463] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:45,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:45,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:45,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127194922] [2025-02-08 05:39:45,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:45,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:45,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:45,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:45,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:45,345 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 421 [2025-02-08 05:39:45,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 309 transitions, 640 flow. Second operand has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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:39:45,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:45,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 421 [2025-02-08 05:39:45,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:45,771 INFO L124 PetriNetUnfolderBase]: 1328/3770 cut-off events. [2025-02-08 05:39:45,772 INFO L125 PetriNetUnfolderBase]: For 307/307 co-relation queries the response was YES. [2025-02-08 05:39:45,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6240 conditions, 3770 events. 1328/3770 cut-off events. For 307/307 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 30302 event pairs, 1058 based on Foata normal form. 0/3305 useless extension candidates. Maximal degree in co-relation 6135. Up to 996 conditions per place. [2025-02-08 05:39:45,794 INFO L140 encePairwiseOnDemand]: 419/421 looper letters, 40 selfloop transitions, 1 changer transitions 0/327 dead transitions. [2025-02-08 05:39:45,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 327 transitions, 771 flow [2025-02-08 05:39:45,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:45,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:45,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1039 transitions. [2025-02-08 05:39:45,796 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8226444972288203 [2025-02-08 05:39:45,797 INFO L175 Difference]: Start difference. First operand has 314 places, 309 transitions, 640 flow. Second operand 3 states and 1039 transitions. [2025-02-08 05:39:45,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 327 transitions, 771 flow [2025-02-08 05:39:45,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 327 transitions, 768 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:45,800 INFO L231 Difference]: Finished difference. Result has 314 places, 308 transitions, 638 flow [2025-02-08 05:39:45,801 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=638, PETRI_PLACES=314, PETRI_TRANSITIONS=308} [2025-02-08 05:39:45,801 INFO L279 CegarLoopForPetriNet]: 399 programPoint places, -85 predicate places. [2025-02-08 05:39:45,801 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 308 transitions, 638 flow [2025-02-08 05:39:45,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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:39:45,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:45,802 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] [2025-02-08 05:39:45,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 05:39:45,802 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 137 more)] === [2025-02-08 05:39:45,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:45,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1296374739, now seen corresponding path program 1 times [2025-02-08 05:39:45,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:45,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896829692] [2025-02-08 05:39:45,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:45,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:45,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-08 05:39:45,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-08 05:39:45,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:45,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:45,869 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:39:45,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:45,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896829692] [2025-02-08 05:39:45,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896829692] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:45,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:45,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:45,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813301151] [2025-02-08 05:39:45,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:45,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:45,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:45,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:45,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:45,878 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 421 [2025-02-08 05:39:45,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 308 transitions, 638 flow. Second operand has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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:39:45,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:45,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 421 [2025-02-08 05:39:45,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:46,436 INFO L124 PetriNetUnfolderBase]: 1502/4450 cut-off events. [2025-02-08 05:39:46,436 INFO L125 PetriNetUnfolderBase]: For 357/357 co-relation queries the response was YES. [2025-02-08 05:39:46,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7182 conditions, 4450 events. 1502/4450 cut-off events. For 357/357 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 38050 event pairs, 1145 based on Foata normal form. 0/3842 useless extension candidates. Maximal degree in co-relation 7077. Up to 1807 conditions per place. [2025-02-08 05:39:46,456 INFO L140 encePairwiseOnDemand]: 418/421 looper letters, 37 selfloop transitions, 2 changer transitions 0/324 dead transitions. [2025-02-08 05:39:46,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 324 transitions, 760 flow [2025-02-08 05:39:46,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:46,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:46,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1037 transitions. [2025-02-08 05:39:46,458 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8210609659540776 [2025-02-08 05:39:46,458 INFO L175 Difference]: Start difference. First operand has 314 places, 308 transitions, 638 flow. Second operand 3 states and 1037 transitions. [2025-02-08 05:39:46,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 324 transitions, 760 flow [2025-02-08 05:39:46,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 324 transitions, 759 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:46,464 INFO L231 Difference]: Finished difference. Result has 315 places, 308 transitions, 645 flow [2025-02-08 05:39:46,465 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=645, PETRI_PLACES=315, PETRI_TRANSITIONS=308} [2025-02-08 05:39:46,465 INFO L279 CegarLoopForPetriNet]: 399 programPoint places, -84 predicate places. [2025-02-08 05:39:46,465 INFO L471 AbstractCegarLoop]: Abstraction has has 315 places, 308 transitions, 645 flow [2025-02-08 05:39:46,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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:39:46,466 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:46,466 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:46,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 05:39:46,466 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 137 more)] === [2025-02-08 05:39:46,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:46,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1548417959, now seen corresponding path program 1 times [2025-02-08 05:39:46,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:46,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046127317] [2025-02-08 05:39:46,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:46,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:46,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-02-08 05:39:46,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-02-08 05:39:46,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:46,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:46,544 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:39:46,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:46,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046127317] [2025-02-08 05:39:46,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046127317] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:46,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:46,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:46,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057859899] [2025-02-08 05:39:46,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:46,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:46,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:46,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:46,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:46,548 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 334 out of 421 [2025-02-08 05:39:46,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 308 transitions, 645 flow. Second operand has 3 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 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:39:46,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:46,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 334 of 421 [2025-02-08 05:39:46,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:47,168 INFO L124 PetriNetUnfolderBase]: 1502/4359 cut-off events. [2025-02-08 05:39:47,168 INFO L125 PetriNetUnfolderBase]: For 584/584 co-relation queries the response was YES. [2025-02-08 05:39:47,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7398 conditions, 4359 events. 1502/4359 cut-off events. For 584/584 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 36856 event pairs, 1218 based on Foata normal form. 9/3818 useless extension candidates. Maximal degree in co-relation 7293. Up to 2255 conditions per place. [2025-02-08 05:39:47,178 INFO L140 encePairwiseOnDemand]: 419/421 looper letters, 0 selfloop transitions, 0 changer transitions 307/307 dead transitions. [2025-02-08 05:39:47,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 307 transitions, 685 flow [2025-02-08 05:39:47,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:47,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:47,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1022 transitions. [2025-02-08 05:39:47,180 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8091844813935075 [2025-02-08 05:39:47,180 INFO L175 Difference]: Start difference. First operand has 315 places, 308 transitions, 645 flow. Second operand 3 states and 1022 transitions. [2025-02-08 05:39:47,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 307 transitions, 685 flow [2025-02-08 05:39:47,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 307 transitions, 683 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:47,183 INFO L231 Difference]: Finished difference. Result has 315 places, 0 transitions, 0 flow [2025-02-08 05:39:47,184 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=641, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=315, PETRI_TRANSITIONS=0} [2025-02-08 05:39:47,184 INFO L279 CegarLoopForPetriNet]: 399 programPoint places, -84 predicate places. [2025-02-08 05:39:47,184 INFO L471 AbstractCegarLoop]: Abstraction has has 315 places, 0 transitions, 0 flow [2025-02-08 05:39:47,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 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:39:47,186 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (140 of 141 remaining) [2025-02-08 05:39:47,187 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (139 of 141 remaining) [2025-02-08 05:39:47,187 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (138 of 141 remaining) [2025-02-08 05:39:47,187 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (137 of 141 remaining) [2025-02-08 05:39:47,187 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (136 of 141 remaining) [2025-02-08 05:39:47,187 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (135 of 141 remaining) [2025-02-08 05:39:47,187 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (134 of 141 remaining) [2025-02-08 05:39:47,187 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (133 of 141 remaining) [2025-02-08 05:39:47,187 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (132 of 141 remaining) [2025-02-08 05:39:47,187 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (131 of 141 remaining) [2025-02-08 05:39:47,187 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (130 of 141 remaining) [2025-02-08 05:39:47,187 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (129 of 141 remaining) [2025-02-08 05:39:47,187 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (128 of 141 remaining) [2025-02-08 05:39:47,187 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (127 of 141 remaining) [2025-02-08 05:39:47,188 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (126 of 141 remaining) [2025-02-08 05:39:47,188 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (125 of 141 remaining) [2025-02-08 05:39:47,188 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (124 of 141 remaining) [2025-02-08 05:39:47,188 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (123 of 141 remaining) [2025-02-08 05:39:47,188 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (122 of 141 remaining) [2025-02-08 05:39:47,188 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (121 of 141 remaining) [2025-02-08 05:39:47,188 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (120 of 141 remaining) [2025-02-08 05:39:47,188 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (119 of 141 remaining) [2025-02-08 05:39:47,188 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (118 of 141 remaining) [2025-02-08 05:39:47,188 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (117 of 141 remaining) [2025-02-08 05:39:47,188 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (116 of 141 remaining) [2025-02-08 05:39:47,188 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (115 of 141 remaining) [2025-02-08 05:39:47,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (114 of 141 remaining) [2025-02-08 05:39:47,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (113 of 141 remaining) [2025-02-08 05:39:47,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (112 of 141 remaining) [2025-02-08 05:39:47,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (111 of 141 remaining) [2025-02-08 05:39:47,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (110 of 141 remaining) [2025-02-08 05:39:47,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (109 of 141 remaining) [2025-02-08 05:39:47,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (108 of 141 remaining) [2025-02-08 05:39:47,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (107 of 141 remaining) [2025-02-08 05:39:47,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (106 of 141 remaining) [2025-02-08 05:39:47,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (105 of 141 remaining) [2025-02-08 05:39:47,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (104 of 141 remaining) [2025-02-08 05:39:47,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (103 of 141 remaining) [2025-02-08 05:39:47,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (102 of 141 remaining) [2025-02-08 05:39:47,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (101 of 141 remaining) [2025-02-08 05:39:47,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (100 of 141 remaining) [2025-02-08 05:39:47,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (99 of 141 remaining) [2025-02-08 05:39:47,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (98 of 141 remaining) [2025-02-08 05:39:47,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (97 of 141 remaining) [2025-02-08 05:39:47,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (96 of 141 remaining) [2025-02-08 05:39:47,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (95 of 141 remaining) [2025-02-08 05:39:47,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (94 of 141 remaining) [2025-02-08 05:39:47,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (93 of 141 remaining) [2025-02-08 05:39:47,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (92 of 141 remaining) [2025-02-08 05:39:47,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (91 of 141 remaining) [2025-02-08 05:39:47,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (90 of 141 remaining) [2025-02-08 05:39:47,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (89 of 141 remaining) [2025-02-08 05:39:47,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (88 of 141 remaining) [2025-02-08 05:39:47,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (87 of 141 remaining) [2025-02-08 05:39:47,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (86 of 141 remaining) [2025-02-08 05:39:47,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (85 of 141 remaining) [2025-02-08 05:39:47,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (84 of 141 remaining) [2025-02-08 05:39:47,191 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (83 of 141 remaining) [2025-02-08 05:39:47,191 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (82 of 141 remaining) [2025-02-08 05:39:47,191 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (81 of 141 remaining) [2025-02-08 05:39:47,191 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (80 of 141 remaining) [2025-02-08 05:39:47,191 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (79 of 141 remaining) [2025-02-08 05:39:47,191 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (78 of 141 remaining) [2025-02-08 05:39:47,191 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (77 of 141 remaining) [2025-02-08 05:39:47,191 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (76 of 141 remaining) [2025-02-08 05:39:47,191 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (75 of 141 remaining) [2025-02-08 05:39:47,191 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (74 of 141 remaining) [2025-02-08 05:39:47,191 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (73 of 141 remaining) [2025-02-08 05:39:47,191 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (72 of 141 remaining) [2025-02-08 05:39:47,191 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (71 of 141 remaining) [2025-02-08 05:39:47,191 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (70 of 141 remaining) [2025-02-08 05:39:47,191 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (69 of 141 remaining) [2025-02-08 05:39:47,191 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (68 of 141 remaining) [2025-02-08 05:39:47,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (67 of 141 remaining) [2025-02-08 05:39:47,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (66 of 141 remaining) [2025-02-08 05:39:47,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (65 of 141 remaining) [2025-02-08 05:39:47,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (64 of 141 remaining) [2025-02-08 05:39:47,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (63 of 141 remaining) [2025-02-08 05:39:47,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (62 of 141 remaining) [2025-02-08 05:39:47,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (61 of 141 remaining) [2025-02-08 05:39:47,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (60 of 141 remaining) [2025-02-08 05:39:47,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (59 of 141 remaining) [2025-02-08 05:39:47,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (58 of 141 remaining) [2025-02-08 05:39:47,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (57 of 141 remaining) [2025-02-08 05:39:47,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (56 of 141 remaining) [2025-02-08 05:39:47,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (55 of 141 remaining) [2025-02-08 05:39:47,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (54 of 141 remaining) [2025-02-08 05:39:47,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (53 of 141 remaining) [2025-02-08 05:39:47,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (52 of 141 remaining) [2025-02-08 05:39:47,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (51 of 141 remaining) [2025-02-08 05:39:47,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (50 of 141 remaining) [2025-02-08 05:39:47,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (49 of 141 remaining) [2025-02-08 05:39:47,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (48 of 141 remaining) [2025-02-08 05:39:47,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (47 of 141 remaining) [2025-02-08 05:39:47,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (46 of 141 remaining) [2025-02-08 05:39:47,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (45 of 141 remaining) [2025-02-08 05:39:47,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (44 of 141 remaining) [2025-02-08 05:39:47,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (43 of 141 remaining) [2025-02-08 05:39:47,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (42 of 141 remaining) [2025-02-08 05:39:47,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (41 of 141 remaining) [2025-02-08 05:39:47,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (40 of 141 remaining) [2025-02-08 05:39:47,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (39 of 141 remaining) [2025-02-08 05:39:47,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (38 of 141 remaining) [2025-02-08 05:39:47,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (37 of 141 remaining) [2025-02-08 05:39:47,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (36 of 141 remaining) [2025-02-08 05:39:47,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (35 of 141 remaining) [2025-02-08 05:39:47,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (34 of 141 remaining) [2025-02-08 05:39:47,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (33 of 141 remaining) [2025-02-08 05:39:47,193 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (32 of 141 remaining) [2025-02-08 05:39:47,193 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (31 of 141 remaining) [2025-02-08 05:39:47,193 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (30 of 141 remaining) [2025-02-08 05:39:47,193 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (29 of 141 remaining) [2025-02-08 05:39:47,193 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (28 of 141 remaining) [2025-02-08 05:39:47,193 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (27 of 141 remaining) [2025-02-08 05:39:47,193 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (26 of 141 remaining) [2025-02-08 05:39:47,193 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (25 of 141 remaining) [2025-02-08 05:39:47,193 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (24 of 141 remaining) [2025-02-08 05:39:47,193 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (23 of 141 remaining) [2025-02-08 05:39:47,193 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (22 of 141 remaining) [2025-02-08 05:39:47,193 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (21 of 141 remaining) [2025-02-08 05:39:47,193 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (20 of 141 remaining) [2025-02-08 05:39:47,193 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (19 of 141 remaining) [2025-02-08 05:39:47,193 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (18 of 141 remaining) [2025-02-08 05:39:47,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (17 of 141 remaining) [2025-02-08 05:39:47,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (16 of 141 remaining) [2025-02-08 05:39:47,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (15 of 141 remaining) [2025-02-08 05:39:47,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (14 of 141 remaining) [2025-02-08 05:39:47,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (13 of 141 remaining) [2025-02-08 05:39:47,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (12 of 141 remaining) [2025-02-08 05:39:47,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (11 of 141 remaining) [2025-02-08 05:39:47,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (10 of 141 remaining) [2025-02-08 05:39:47,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (9 of 141 remaining) [2025-02-08 05:39:47,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (8 of 141 remaining) [2025-02-08 05:39:47,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (7 of 141 remaining) [2025-02-08 05:39:47,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (6 of 141 remaining) [2025-02-08 05:39:47,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (5 of 141 remaining) [2025-02-08 05:39:47,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (4 of 141 remaining) [2025-02-08 05:39:47,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (3 of 141 remaining) [2025-02-08 05:39:47,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (2 of 141 remaining) [2025-02-08 05:39:47,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (1 of 141 remaining) [2025-02-08 05:39:47,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (0 of 141 remaining) [2025-02-08 05:39:47,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 05:39:47,196 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:47,200 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:39:47,200 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:39:47,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:39:47 BasicIcfg [2025-02-08 05:39:47,208 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:39:47,209 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:39:47,209 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:39:47,209 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:39:47,210 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:39:39" (3/4) ... [2025-02-08 05:39:47,211 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:39:47,214 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:39:47,214 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:39:47,214 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 05:39:47,214 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-02-08 05:39:47,220 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2025-02-08 05:39:47,220 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:39:47,220 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 05:39:47,221 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:39:47,289 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:39:47,290 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:39:47,290 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:39:47,291 INFO L158 Benchmark]: Toolchain (without parser) took 9082.54ms. Allocated memory was 142.6MB in the beginning and 805.3MB in the end (delta: 662.7MB). Free memory was 105.4MB in the beginning and 579.7MB in the end (delta: -474.3MB). Peak memory consumption was 184.4MB. Max. memory is 16.1GB. [2025-02-08 05:39:47,291 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:39:47,291 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.87ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 91.1MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:39:47,292 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.68ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 87.1MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:39:47,292 INFO L158 Benchmark]: Boogie Preprocessor took 52.98ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 85.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:39:47,292 INFO L158 Benchmark]: IcfgBuilder took 1089.55ms. Allocated memory is still 142.6MB. Free memory was 85.2MB in the beginning and 102.9MB in the end (delta: -17.7MB). Peak memory consumption was 69.8MB. Max. memory is 16.1GB. [2025-02-08 05:39:47,293 INFO L158 Benchmark]: TraceAbstraction took 7534.12ms. Allocated memory was 142.6MB in the beginning and 805.3MB in the end (delta: 662.7MB). Free memory was 102.1MB in the beginning and 588.1MB in the end (delta: -486.0MB). Peak memory consumption was 580.9MB. Max. memory is 16.1GB. [2025-02-08 05:39:47,294 INFO L158 Benchmark]: Witness Printer took 81.08ms. Allocated memory is still 805.3MB. Free memory was 583.9MB in the beginning and 579.7MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:39:47,295 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.46ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 254.87ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 91.1MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.68ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 87.1MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 52.98ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 85.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1089.55ms. Allocated memory is still 142.6MB. Free memory was 85.2MB in the beginning and 102.9MB in the end (delta: -17.7MB). Peak memory consumption was 69.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7534.12ms. Allocated memory was 142.6MB in the beginning and 805.3MB in the end (delta: 662.7MB). Free memory was 102.1MB in the beginning and 588.1MB in the end (delta: -486.0MB). Peak memory consumption was 580.9MB. Max. memory is 16.1GB. * Witness Printer took 81.08ms. Allocated memory is still 805.3MB. Free memory was 583.9MB in the beginning and 579.7MB in the end (delta: 4.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: 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: 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: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: 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: 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: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: 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: 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: 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: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 165]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 165]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 141]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 141]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 141]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 141]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 141]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 141]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 141]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 141]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 153]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: 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, 501 locations, 141 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.4s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 439 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 238 mSDsluCounter, 38 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 66 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1216 IncrementalHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66 mSolverCounterUnsat, 38 mSDtfsCounter, 1216 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=824occurred in iteration=0, InterpolantAutomatonStates: 69, 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.2s InterpolantComputationTime, 2754 NumberOfCodeBlocks, 2754 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2732 ConstructedInterpolants, 0 QuantifiedInterpolants, 2889 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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 95 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:39:47,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE