./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-bad-dot-product.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-dot-product.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 39e90898aa78f5642c5c7d6f9df6b2e15e069a046a9465d5d61576c4b07f46b8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:39:49,283 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:39:49,354 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:49,359 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:39:49,360 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:39:49,397 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:39:49,398 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:39:49,398 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:39:49,399 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:39:49,399 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:39:49,399 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:39:49,399 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:39:49,399 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:39:49,399 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:39:49,400 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:39:49,401 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:39:49,401 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:39:49,402 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:39:49,402 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:39:49,402 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:39:49,402 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:39:49,402 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:39:49,402 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:39:49,402 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:39:49,402 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:39:49,402 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:39:49,402 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:39:49,402 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:39:49,402 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:39:49,402 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:39:49,402 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:39:49,402 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:39:49,403 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:39:49,403 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:39:49,403 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:39:49,403 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:39:49,403 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:39:49,403 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:39:49,403 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:39:49,403 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:39:49,403 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:39:49,403 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:39:49,403 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 -> 39e90898aa78f5642c5c7d6f9df6b2e15e069a046a9465d5d61576c4b07f46b8 [2025-02-08 05:39:49,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:39:49,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:39:49,698 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:39:49,699 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:39:49,699 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:39:49,700 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-dot-product.wvr.c [2025-02-08 05:39:50,988 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ee96e2f82/c5c588657a234fde844553dfe11fed51/FLAG96e005518 [2025-02-08 05:39:51,265 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:39:51,266 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-dot-product.wvr.c [2025-02-08 05:39:51,277 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ee96e2f82/c5c588657a234fde844553dfe11fed51/FLAG96e005518 [2025-02-08 05:39:51,297 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ee96e2f82/c5c588657a234fde844553dfe11fed51 [2025-02-08 05:39:51,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:39:51,301 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:39:51,303 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:39:51,303 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:39:51,306 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:39:51,307 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:39:51" (1/1) ... [2025-02-08 05:39:51,308 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7caeae7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:51, skipping insertion in model container [2025-02-08 05:39:51,309 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:39:51" (1/1) ... [2025-02-08 05:39:51,325 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:39:51,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:39:51,552 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:39:51,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:39:51,624 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:39:51,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:51 WrapperNode [2025-02-08 05:39:51,625 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:39:51,626 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:39:51,626 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:39:51,626 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:39:51,632 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:51" (1/1) ... [2025-02-08 05:39:51,645 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:51" (1/1) ... [2025-02-08 05:39:51,697 INFO L138 Inliner]: procedures = 25, calls = 41, calls flagged for inlining = 17, calls inlined = 23, statements flattened = 409 [2025-02-08 05:39:51,697 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:39:51,698 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:39:51,698 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:39:51,698 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:39:51,706 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:51" (1/1) ... [2025-02-08 05:39:51,706 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:51" (1/1) ... [2025-02-08 05:39:51,713 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:51" (1/1) ... [2025-02-08 05:39:51,717 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:51" (1/1) ... [2025-02-08 05:39:51,749 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:51" (1/1) ... [2025-02-08 05:39:51,752 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:51" (1/1) ... [2025-02-08 05:39:51,758 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:51" (1/1) ... [2025-02-08 05:39:51,760 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:51" (1/1) ... [2025-02-08 05:39:51,767 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:39:51,769 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:39:51,769 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:39:51,769 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:39:51,773 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:51" (1/1) ... [2025-02-08 05:39:51,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:39:51,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:39:51,813 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:51,816 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:51,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:39:51,841 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:39:51,841 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:39:51,841 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:39:51,841 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:39:51,841 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 05:39:51,841 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 05:39:51,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:39:51,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:39:51,842 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 05:39:51,842 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 05:39:51,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:39:51,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:39:51,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:39:51,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:39:51,843 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:51,970 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:39:51,972 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:39:52,169 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L53: havoc #t~nondet5#1; [2025-02-08 05:39:52,169 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L53-1: havoc #t~ret4#1; [2025-02-08 05:39:52,169 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L53-2: assume #race~res1~0 == #t~nondet5#1; [2025-02-08 05:39:52,169 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L53-2: assume !(#race~res1~0 == #t~nondet5#1); [2025-02-08 05:39:52,169 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L53-3: havoc #t~mem3#1; [2025-02-08 05:39:52,169 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L53-4: #race~res1~0 := #t~nondet5#1; [2025-02-08 05:39:52,170 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L53-5: havoc #t~nondet5#1; [2025-02-08 05:39:52,170 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L53-6: ~res1~0 := #t~ret4#1; [2025-02-08 05:39:52,170 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L53-7: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret4#1 && #t~ret4#1 <= 2147483647; [2025-02-08 05:39:52,170 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L53-8: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:39:52,170 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L53-9: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:39:52,170 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L53-10: #t~ret4#1 := plus_#res#1; [2025-02-08 05:39:52,170 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54: [2025-02-08 05:39:52,170 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L51-2: havoc #t~post6#1; [2025-02-08 05:39:52,170 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L51-3: ~j~0#1 := 1 + #t~post6#1; [2025-02-08 05:39:52,170 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L51-4: #t~post6#1 := ~j~0#1; [2025-02-08 05:39:52,305 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-2: havoc #t~post13#1; [2025-02-08 05:39:52,305 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-3: ~j~1#1 := 1 + #t~post13#1; [2025-02-08 05:39:52,305 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-4: #t~post13#1 := ~j~1#1; [2025-02-08 05:39:52,306 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66: havoc #t~nondet12#1; [2025-02-08 05:39:52,306 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-1: havoc #t~ret11#1; [2025-02-08 05:39:52,306 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-2: assume #race~res2~0 == #t~nondet12#1; [2025-02-08 05:39:52,306 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-2: assume !(#race~res2~0 == #t~nondet12#1); [2025-02-08 05:39:52,306 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-3: havoc #t~mem10#1; [2025-02-08 05:39:52,306 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-4: #race~res2~0 := #t~nondet12#1; [2025-02-08 05:39:52,306 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-5: havoc #t~nondet12#1; [2025-02-08 05:39:52,306 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-6: ~res2~0 := #t~ret11#1; [2025-02-08 05:39:52,306 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-7: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret11#1 && #t~ret11#1 <= 2147483647; [2025-02-08 05:39:52,307 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-8: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:39:52,307 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-9: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:39:52,307 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-10: #t~ret11#1 := plus_#res#1; [2025-02-08 05:39:52,307 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67: [2025-02-08 05:39:52,451 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L77-2: havoc #t~post20#1; [2025-02-08 05:39:52,451 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L77-3: ~j~2#1 := 1 + #t~post20#1; [2025-02-08 05:39:52,452 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L77-4: #t~post20#1 := ~j~2#1; [2025-02-08 05:39:52,452 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L79: havoc #t~nondet19#1; [2025-02-08 05:39:52,452 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L79-1: havoc #t~ret18#1; [2025-02-08 05:39:52,452 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L79-2: assume #race~res2~0 == #t~nondet19#1; [2025-02-08 05:39:52,452 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L79-2: assume !(#race~res2~0 == #t~nondet19#1); [2025-02-08 05:39:52,452 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L79-3: havoc #t~mem17#1; [2025-02-08 05:39:52,452 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L79-4: #race~res2~0 := #t~nondet19#1; [2025-02-08 05:39:52,452 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L79-5: havoc #t~nondet19#1; [2025-02-08 05:39:52,452 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L79-6: ~res2~0 := #t~ret18#1; [2025-02-08 05:39:52,452 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L79-7: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret18#1 && #t~ret18#1 <= 2147483647; [2025-02-08 05:39:52,452 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L79-8: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:39:52,452 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L79-9: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:39:52,452 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L79-10: #t~ret18#1 := plus_#res#1; [2025-02-08 05:39:52,452 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80: [2025-02-08 05:39:52,648 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:39:52,648 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:39:52,831 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L126 is not an error location. [2025-02-08 05:39:52,832 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L126 is not an error location. [2025-02-08 05:39:52,834 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L126 is not an error location. [2025-02-08 05:39:52,835 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:39:52,837 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:39:52,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:39:52 BoogieIcfgContainer [2025-02-08 05:39:52,838 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:39:52,841 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:39:52,841 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:39:52,846 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:39:52,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:39:51" (1/3) ... [2025-02-08 05:39:52,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11af6b7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:39:52, skipping insertion in model container [2025-02-08 05:39:52,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:51" (2/3) ... [2025-02-08 05:39:52,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11af6b7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:39:52, skipping insertion in model container [2025-02-08 05:39:52,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:39:52" (3/3) ... [2025-02-08 05:39:52,849 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-dot-product.wvr.c [2025-02-08 05:39:52,865 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:39:52,866 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-dot-product.wvr.c that has 4 procedures, 379 locations, 1 initial locations, 8 loop locations, and 45 error locations. [2025-02-08 05:39:52,867 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:39:52,975 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:39:53,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 388 places, 399 transitions, 819 flow [2025-02-08 05:39:53,183 INFO L124 PetriNetUnfolderBase]: 21/396 cut-off events. [2025-02-08 05:39:53,185 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:39:53,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 409 conditions, 396 events. 21/396 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 800 event pairs, 0 based on Foata normal form. 0/330 useless extension candidates. Maximal degree in co-relation 312. Up to 2 conditions per place. [2025-02-08 05:39:53,203 INFO L82 GeneralOperation]: Start removeDead. Operand has 388 places, 399 transitions, 819 flow [2025-02-08 05:39:53,214 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 369 places, 379 transitions, 776 flow [2025-02-08 05:39:53,223 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:39:53,232 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;@353a39f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:39:53,233 INFO L334 AbstractCegarLoop]: Starting to check reachability of 73 error locations. [2025-02-08 05:39:53,241 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:39:53,242 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-02-08 05:39:53,242 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:39:53,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:53,243 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] [2025-02-08 05:39:53,246 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2025-02-08 05:39:53,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:53,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1769282909, now seen corresponding path program 1 times [2025-02-08 05:39:53,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:53,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811889110] [2025-02-08 05:39:53,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:53,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:53,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 05:39:53,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 05:39:53,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:53,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:53,436 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:53,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:53,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811889110] [2025-02-08 05:39:53,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811889110] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:53,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:53,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:53,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627925383] [2025-02-08 05:39:53,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:53,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:53,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:53,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:53,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:53,563 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 399 [2025-02-08 05:39:53,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 379 transitions, 776 flow. Second operand has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 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:53,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:53,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 399 [2025-02-08 05:39:53,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:53,861 INFO L124 PetriNetUnfolderBase]: 59/1071 cut-off events. [2025-02-08 05:39:53,861 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-02-08 05:39:53,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1200 conditions, 1071 events. 59/1071 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 5781 event pairs, 38 based on Foata normal form. 78/965 useless extension candidates. Maximal degree in co-relation 679. Up to 92 conditions per place. [2025-02-08 05:39:53,875 INFO L140 encePairwiseOnDemand]: 373/399 looper letters, 16 selfloop transitions, 2 changer transitions 5/355 dead transitions. [2025-02-08 05:39:53,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 355 transitions, 764 flow [2025-02-08 05:39:53,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:53,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:53,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1104 transitions. [2025-02-08 05:39:53,899 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9223057644110275 [2025-02-08 05:39:53,901 INFO L175 Difference]: Start difference. First operand has 369 places, 379 transitions, 776 flow. Second operand 3 states and 1104 transitions. [2025-02-08 05:39:53,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 355 transitions, 764 flow [2025-02-08 05:39:53,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 355 transitions, 752 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 05:39:53,916 INFO L231 Difference]: Finished difference. Result has 355 places, 350 transitions, 710 flow [2025-02-08 05:39:53,920 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=710, PETRI_PLACES=355, PETRI_TRANSITIONS=350} [2025-02-08 05:39:53,923 INFO L279 CegarLoopForPetriNet]: 369 programPoint places, -14 predicate places. [2025-02-08 05:39:53,924 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 350 transitions, 710 flow [2025-02-08 05:39:53,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 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:53,925 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:53,925 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:53,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:39:53,926 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2025-02-08 05:39:53,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:53,927 INFO L85 PathProgramCache]: Analyzing trace with hash -834695462, now seen corresponding path program 1 times [2025-02-08 05:39:53,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:53,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329402065] [2025-02-08 05:39:53,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:53,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:53,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 05:39:53,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 05:39:53,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:53,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:53,984 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:53,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:53,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329402065] [2025-02-08 05:39:53,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329402065] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:53,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:53,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:53,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228383422] [2025-02-08 05:39:53,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:53,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:53,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:53,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:53,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:54,020 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 399 [2025-02-08 05:39:54,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 350 transitions, 710 flow. Second operand has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 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:54,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:54,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 399 [2025-02-08 05:39:54,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:54,267 INFO L124 PetriNetUnfolderBase]: 51/814 cut-off events. [2025-02-08 05:39:54,268 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:39:54,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 915 conditions, 814 events. 51/814 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3591 event pairs, 34 based on Foata normal form. 0/679 useless extension candidates. Maximal degree in co-relation 883. Up to 85 conditions per place. [2025-02-08 05:39:54,274 INFO L140 encePairwiseOnDemand]: 396/399 looper letters, 16 selfloop transitions, 2 changer transitions 0/349 dead transitions. [2025-02-08 05:39:54,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 349 transitions, 744 flow [2025-02-08 05:39:54,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:54,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:54,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1081 transitions. [2025-02-08 05:39:54,278 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9030910609857978 [2025-02-08 05:39:54,278 INFO L175 Difference]: Start difference. First operand has 355 places, 350 transitions, 710 flow. Second operand 3 states and 1081 transitions. [2025-02-08 05:39:54,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 349 transitions, 744 flow [2025-02-08 05:39:54,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 349 transitions, 740 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:54,288 INFO L231 Difference]: Finished difference. Result has 349 places, 349 transitions, 708 flow [2025-02-08 05:39:54,290 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=708, PETRI_PLACES=349, PETRI_TRANSITIONS=349} [2025-02-08 05:39:54,291 INFO L279 CegarLoopForPetriNet]: 369 programPoint places, -20 predicate places. [2025-02-08 05:39:54,291 INFO L471 AbstractCegarLoop]: Abstraction has has 349 places, 349 transitions, 708 flow [2025-02-08 05:39:54,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 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:54,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:54,292 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:54,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:39:54,292 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2025-02-08 05:39:54,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:54,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1542348750, now seen corresponding path program 1 times [2025-02-08 05:39:54,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:54,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577554416] [2025-02-08 05:39:54,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:54,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:54,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 05:39:54,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 05:39:54,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:54,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:54,362 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:54,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:54,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577554416] [2025-02-08 05:39:54,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577554416] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:54,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:54,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:54,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772120686] [2025-02-08 05:39:54,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:54,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:54,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:54,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:54,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:54,405 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 399 [2025-02-08 05:39:54,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 349 transitions, 708 flow. Second operand has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 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:54,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:54,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 399 [2025-02-08 05:39:54,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:54,630 INFO L124 PetriNetUnfolderBase]: 72/984 cut-off events. [2025-02-08 05:39:54,631 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-02-08 05:39:54,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1116 conditions, 984 events. 72/984 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 5338 event pairs, 56 based on Foata normal form. 0/828 useless extension candidates. Maximal degree in co-relation 1076. Up to 113 conditions per place. [2025-02-08 05:39:54,641 INFO L140 encePairwiseOnDemand]: 396/399 looper letters, 16 selfloop transitions, 2 changer transitions 0/348 dead transitions. [2025-02-08 05:39:54,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 348 transitions, 742 flow [2025-02-08 05:39:54,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:54,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:54,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1081 transitions. [2025-02-08 05:39:54,644 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9030910609857978 [2025-02-08 05:39:54,644 INFO L175 Difference]: Start difference. First operand has 349 places, 349 transitions, 708 flow. Second operand 3 states and 1081 transitions. [2025-02-08 05:39:54,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 348 transitions, 742 flow [2025-02-08 05:39:54,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 348 transitions, 738 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:54,651 INFO L231 Difference]: Finished difference. Result has 348 places, 348 transitions, 706 flow [2025-02-08 05:39:54,652 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=706, PETRI_PLACES=348, PETRI_TRANSITIONS=348} [2025-02-08 05:39:54,653 INFO L279 CegarLoopForPetriNet]: 369 programPoint places, -21 predicate places. [2025-02-08 05:39:54,653 INFO L471 AbstractCegarLoop]: Abstraction has has 348 places, 348 transitions, 706 flow [2025-02-08 05:39:54,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 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:54,654 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:54,654 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] [2025-02-08 05:39:54,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:39:54,654 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2025-02-08 05:39:54,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:54,655 INFO L85 PathProgramCache]: Analyzing trace with hash -56591024, now seen corresponding path program 1 times [2025-02-08 05:39:54,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:54,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808201171] [2025-02-08 05:39:54,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:54,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:54,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 05:39:54,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 05:39:54,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:54,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:54,734 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:54,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:54,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808201171] [2025-02-08 05:39:54,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808201171] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:54,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:54,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:54,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255759366] [2025-02-08 05:39:54,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:54,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:54,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:54,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:54,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:54,767 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 352 out of 399 [2025-02-08 05:39:54,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 348 transitions, 706 flow. Second operand has 3 states, 3 states have (on average 353.0) internal successors, (1059), 3 states have internal predecessors, (1059), 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:54,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:54,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 352 of 399 [2025-02-08 05:39:54,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:54,991 INFO L124 PetriNetUnfolderBase]: 84/1030 cut-off events. [2025-02-08 05:39:54,992 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-08 05:39:54,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1184 conditions, 1030 events. 84/1030 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 5431 event pairs, 59 based on Foata normal form. 0/860 useless extension candidates. Maximal degree in co-relation 1136. Up to 135 conditions per place. [2025-02-08 05:39:55,007 INFO L140 encePairwiseOnDemand]: 394/399 looper letters, 17 selfloop transitions, 1 changer transitions 0/344 dead transitions. [2025-02-08 05:39:55,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 344 transitions, 734 flow [2025-02-08 05:39:55,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:55,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:55,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1078 transitions. [2025-02-08 05:39:55,011 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9005847953216374 [2025-02-08 05:39:55,014 INFO L175 Difference]: Start difference. First operand has 348 places, 348 transitions, 706 flow. Second operand 3 states and 1078 transitions. [2025-02-08 05:39:55,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 344 transitions, 734 flow [2025-02-08 05:39:55,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 344 transitions, 730 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:55,021 INFO L231 Difference]: Finished difference. Result has 344 places, 344 transitions, 696 flow [2025-02-08 05:39:55,022 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=696, PETRI_PLACES=344, PETRI_TRANSITIONS=344} [2025-02-08 05:39:55,023 INFO L279 CegarLoopForPetriNet]: 369 programPoint places, -25 predicate places. [2025-02-08 05:39:55,024 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 344 transitions, 696 flow [2025-02-08 05:39:55,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 353.0) internal successors, (1059), 3 states have internal predecessors, (1059), 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:55,025 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:55,025 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] [2025-02-08 05:39:55,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:39:55,026 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2025-02-08 05:39:55,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:55,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1841516303, now seen corresponding path program 1 times [2025-02-08 05:39:55,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:55,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538647760] [2025-02-08 05:39:55,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:55,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:55,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 05:39:55,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 05:39:55,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:55,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:55,864 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:55,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:55,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538647760] [2025-02-08 05:39:55,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538647760] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:55,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:55,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:39:55,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705493547] [2025-02-08 05:39:55,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:55,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:39:55,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:55,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:39:55,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:39:56,177 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 399 [2025-02-08 05:39:56,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 344 transitions, 696 flow. Second operand has 6 states, 6 states have (on average 314.5) internal successors, (1887), 6 states have internal predecessors, (1887), 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:56,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:56,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 399 [2025-02-08 05:39:56,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:57,769 INFO L124 PetriNetUnfolderBase]: 2535/10119 cut-off events. [2025-02-08 05:39:57,770 INFO L125 PetriNetUnfolderBase]: For 219/219 co-relation queries the response was YES. [2025-02-08 05:39:57,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14002 conditions, 10119 events. 2535/10119 cut-off events. For 219/219 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 105037 event pairs, 2079 based on Foata normal form. 0/8438 useless extension candidates. Maximal degree in co-relation 13955. Up to 3759 conditions per place. [2025-02-08 05:39:57,850 INFO L140 encePairwiseOnDemand]: 387/399 looper letters, 49 selfloop transitions, 10 changer transitions 0/342 dead transitions. [2025-02-08 05:39:57,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 342 transitions, 810 flow [2025-02-08 05:39:57,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:39:57,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:39:57,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1939 transitions. [2025-02-08 05:39:57,855 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8099415204678363 [2025-02-08 05:39:57,855 INFO L175 Difference]: Start difference. First operand has 344 places, 344 transitions, 696 flow. Second operand 6 states and 1939 transitions. [2025-02-08 05:39:57,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 342 transitions, 810 flow [2025-02-08 05:39:57,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 342 transitions, 809 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:57,861 INFO L231 Difference]: Finished difference. Result has 346 places, 342 transitions, 711 flow [2025-02-08 05:39:57,862 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=711, PETRI_PLACES=346, PETRI_TRANSITIONS=342} [2025-02-08 05:39:57,864 INFO L279 CegarLoopForPetriNet]: 369 programPoint places, -23 predicate places. [2025-02-08 05:39:57,865 INFO L471 AbstractCegarLoop]: Abstraction has has 346 places, 342 transitions, 711 flow [2025-02-08 05:39:57,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 314.5) internal successors, (1887), 6 states have internal predecessors, (1887), 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:57,866 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:57,866 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] [2025-02-08 05:39:57,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:39:57,867 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2025-02-08 05:39:57,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:57,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1614696463, now seen corresponding path program 1 times [2025-02-08 05:39:57,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:57,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848976306] [2025-02-08 05:39:57,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:57,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:57,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 05:39:57,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 05:39:57,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:57,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:57,912 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:57,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:57,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848976306] [2025-02-08 05:39:57,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848976306] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:57,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:57,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:57,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638847413] [2025-02-08 05:39:57,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:57,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:57,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:57,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:57,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:57,959 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 352 out of 399 [2025-02-08 05:39:57,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 342 transitions, 711 flow. Second operand has 3 states, 3 states have (on average 353.3333333333333) internal successors, (1060), 3 states have internal predecessors, (1060), 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:57,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:57,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 352 of 399 [2025-02-08 05:39:57,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:58,245 INFO L124 PetriNetUnfolderBase]: 159/1505 cut-off events. [2025-02-08 05:39:58,246 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-08 05:39:58,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1785 conditions, 1505 events. 159/1505 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 10033 event pairs, 135 based on Foata normal form. 0/1288 useless extension candidates. Maximal degree in co-relation 1752. Up to 244 conditions per place. [2025-02-08 05:39:58,263 INFO L140 encePairwiseOnDemand]: 396/399 looper letters, 18 selfloop transitions, 2 changer transitions 0/341 dead transitions. [2025-02-08 05:39:58,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 341 transitions, 749 flow [2025-02-08 05:39:58,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:58,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:58,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1077 transitions. [2025-02-08 05:39:58,267 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.899749373433584 [2025-02-08 05:39:58,267 INFO L175 Difference]: Start difference. First operand has 346 places, 342 transitions, 711 flow. Second operand 3 states and 1077 transitions. [2025-02-08 05:39:58,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 341 transitions, 749 flow [2025-02-08 05:39:58,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 341 transitions, 729 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:39:58,279 INFO L231 Difference]: Finished difference. Result has 342 places, 341 transitions, 693 flow [2025-02-08 05:39:58,280 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=693, PETRI_PLACES=342, PETRI_TRANSITIONS=341} [2025-02-08 05:39:58,280 INFO L279 CegarLoopForPetriNet]: 369 programPoint places, -27 predicate places. [2025-02-08 05:39:58,280 INFO L471 AbstractCegarLoop]: Abstraction has has 342 places, 341 transitions, 693 flow [2025-02-08 05:39:58,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 353.3333333333333) internal successors, (1060), 3 states have internal predecessors, (1060), 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:58,281 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:58,281 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:58,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:39:58,282 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2025-02-08 05:39:58,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:58,283 INFO L85 PathProgramCache]: Analyzing trace with hash 2060550850, now seen corresponding path program 1 times [2025-02-08 05:39:58,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:58,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332823740] [2025-02-08 05:39:58,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:58,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:58,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-08 05:39:58,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-08 05:39:58,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:58,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:58,345 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:58,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:58,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332823740] [2025-02-08 05:39:58,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332823740] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:58,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:58,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:58,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584913053] [2025-02-08 05:39:58,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:58,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:58,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:58,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:58,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:58,373 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 352 out of 399 [2025-02-08 05:39:58,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 341 transitions, 693 flow. Second operand has 3 states, 3 states have (on average 353.0) internal successors, (1059), 3 states have internal predecessors, (1059), 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:58,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:58,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 352 of 399 [2025-02-08 05:39:58,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:58,790 INFO L124 PetriNetUnfolderBase]: 225/2399 cut-off events. [2025-02-08 05:39:58,790 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-02-08 05:39:58,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2749 conditions, 2399 events. 225/2399 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 18613 event pairs, 135 based on Foata normal form. 0/2017 useless extension candidates. Maximal degree in co-relation 2701. Up to 322 conditions per place. [2025-02-08 05:39:58,814 INFO L140 encePairwiseOnDemand]: 394/399 looper letters, 17 selfloop transitions, 1 changer transitions 0/337 dead transitions. [2025-02-08 05:39:58,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 337 transitions, 721 flow [2025-02-08 05:39:58,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:58,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:58,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1078 transitions. [2025-02-08 05:39:58,818 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9005847953216374 [2025-02-08 05:39:58,818 INFO L175 Difference]: Start difference. First operand has 342 places, 341 transitions, 693 flow. Second operand 3 states and 1078 transitions. [2025-02-08 05:39:58,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 337 transitions, 721 flow [2025-02-08 05:39:58,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 337 transitions, 717 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:58,827 INFO L231 Difference]: Finished difference. Result has 338 places, 337 transitions, 683 flow [2025-02-08 05:39:58,827 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=681, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=683, PETRI_PLACES=338, PETRI_TRANSITIONS=337} [2025-02-08 05:39:58,829 INFO L279 CegarLoopForPetriNet]: 369 programPoint places, -31 predicate places. [2025-02-08 05:39:58,829 INFO L471 AbstractCegarLoop]: Abstraction has has 338 places, 337 transitions, 683 flow [2025-02-08 05:39:58,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 353.0) internal successors, (1059), 3 states have internal predecessors, (1059), 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:58,830 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:58,830 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:58,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:39:58,830 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2025-02-08 05:39:58,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:58,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1255122798, now seen corresponding path program 1 times [2025-02-08 05:39:58,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:58,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675820597] [2025-02-08 05:39:58,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:58,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:58,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-08 05:39:58,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-08 05:39:58,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:58,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:58,907 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:58,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:58,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675820597] [2025-02-08 05:39:58,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675820597] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:58,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:58,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:58,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544197666] [2025-02-08 05:39:58,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:58,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:58,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:58,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:58,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:58,919 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 358 out of 399 [2025-02-08 05:39:58,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 337 transitions, 683 flow. Second operand has 3 states, 3 states have (on average 359.3333333333333) internal successors, (1078), 3 states have internal predecessors, (1078), 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:58,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:58,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 358 of 399 [2025-02-08 05:39:58,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:59,024 INFO L124 PetriNetUnfolderBase]: 25/576 cut-off events. [2025-02-08 05:39:59,024 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:39:59,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 629 conditions, 576 events. 25/576 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1882 event pairs, 15 based on Foata normal form. 0/507 useless extension candidates. Maximal degree in co-relation 581. Up to 40 conditions per place. [2025-02-08 05:39:59,030 INFO L140 encePairwiseOnDemand]: 396/399 looper letters, 12 selfloop transitions, 2 changer transitions 0/336 dead transitions. [2025-02-08 05:39:59,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 336 transitions, 709 flow [2025-02-08 05:39:59,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:59,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:59,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1089 transitions. [2025-02-08 05:39:59,034 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9097744360902256 [2025-02-08 05:39:59,034 INFO L175 Difference]: Start difference. First operand has 338 places, 337 transitions, 683 flow. Second operand 3 states and 1089 transitions. [2025-02-08 05:39:59,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 336 transitions, 709 flow [2025-02-08 05:39:59,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 336 transitions, 708 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:59,041 INFO L231 Difference]: Finished difference. Result has 338 places, 336 transitions, 684 flow [2025-02-08 05:39:59,041 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=684, PETRI_PLACES=338, PETRI_TRANSITIONS=336} [2025-02-08 05:39:59,042 INFO L279 CegarLoopForPetriNet]: 369 programPoint places, -31 predicate places. [2025-02-08 05:39:59,042 INFO L471 AbstractCegarLoop]: Abstraction has has 338 places, 336 transitions, 684 flow [2025-02-08 05:39:59,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 359.3333333333333) internal successors, (1078), 3 states have internal predecessors, (1078), 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:59,043 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:59,043 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] [2025-02-08 05:39:59,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:39:59,043 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2025-02-08 05:39:59,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:59,044 INFO L85 PathProgramCache]: Analyzing trace with hash -2078298682, now seen corresponding path program 1 times [2025-02-08 05:39:59,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:59,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550368665] [2025-02-08 05:39:59,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:59,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:59,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-08 05:39:59,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-08 05:39:59,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:59,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:59,121 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:59,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:59,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550368665] [2025-02-08 05:39:59,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550368665] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:59,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:59,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:59,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086159604] [2025-02-08 05:39:59,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:59,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:59,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:59,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:59,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:59,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 352 out of 399 [2025-02-08 05:39:59,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 336 transitions, 684 flow. Second operand has 3 states, 3 states have (on average 353.0) internal successors, (1059), 3 states have internal predecessors, (1059), 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:59,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:59,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 352 of 399 [2025-02-08 05:39:59,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:59,370 INFO L124 PetriNetUnfolderBase]: 102/1303 cut-off events. [2025-02-08 05:39:59,370 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-02-08 05:39:59,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1472 conditions, 1303 events. 102/1303 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 8122 event pairs, 71 based on Foata normal form. 0/1125 useless extension candidates. Maximal degree in co-relation 1424. Up to 150 conditions per place. [2025-02-08 05:39:59,381 INFO L140 encePairwiseOnDemand]: 394/399 looper letters, 17 selfloop transitions, 1 changer transitions 0/332 dead transitions. [2025-02-08 05:39:59,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 332 transitions, 712 flow [2025-02-08 05:39:59,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:59,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:59,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1078 transitions. [2025-02-08 05:39:59,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9005847953216374 [2025-02-08 05:39:59,385 INFO L175 Difference]: Start difference. First operand has 338 places, 336 transitions, 684 flow. Second operand 3 states and 1078 transitions. [2025-02-08 05:39:59,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 332 transitions, 712 flow [2025-02-08 05:39:59,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 332 transitions, 708 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:59,390 INFO L231 Difference]: Finished difference. Result has 334 places, 332 transitions, 674 flow [2025-02-08 05:39:59,391 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=672, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=674, PETRI_PLACES=334, PETRI_TRANSITIONS=332} [2025-02-08 05:39:59,392 INFO L279 CegarLoopForPetriNet]: 369 programPoint places, -35 predicate places. [2025-02-08 05:39:59,392 INFO L471 AbstractCegarLoop]: Abstraction has has 334 places, 332 transitions, 674 flow [2025-02-08 05:39:59,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 353.0) internal successors, (1059), 3 states have internal predecessors, (1059), 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:59,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:59,393 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:59,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:39:59,393 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2025-02-08 05:39:59,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:59,394 INFO L85 PathProgramCache]: Analyzing trace with hash 654321029, now seen corresponding path program 1 times [2025-02-08 05:39:59,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:59,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303651861] [2025-02-08 05:39:59,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:59,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:59,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-08 05:39:59,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-08 05:39:59,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:59,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:59,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:59,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:59,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303651861] [2025-02-08 05:39:59,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303651861] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:59,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:59,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:59,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090936701] [2025-02-08 05:39:59,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:59,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:59,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:59,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:59,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:59,476 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 346 out of 399 [2025-02-08 05:39:59,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 332 transitions, 674 flow. Second operand has 3 states, 3 states have (on average 347.3333333333333) internal successors, (1042), 3 states have internal predecessors, (1042), 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:59,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:59,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 346 of 399 [2025-02-08 05:39:59,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:59,963 INFO L124 PetriNetUnfolderBase]: 637/4025 cut-off events. [2025-02-08 05:39:59,964 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2025-02-08 05:39:59,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5013 conditions, 4025 events. 637/4025 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 36255 event pairs, 325 based on Foata normal form. 0/3525 useless extension candidates. Maximal degree in co-relation 4966. Up to 932 conditions per place. [2025-02-08 05:39:59,995 INFO L140 encePairwiseOnDemand]: 390/399 looper letters, 27 selfloop transitions, 3 changer transitions 0/334 dead transitions. [2025-02-08 05:39:59,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 334 transitions, 743 flow [2025-02-08 05:39:59,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:59,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:59,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1074 transitions. [2025-02-08 05:39:59,999 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8972431077694235 [2025-02-08 05:39:59,999 INFO L175 Difference]: Start difference. First operand has 334 places, 332 transitions, 674 flow. Second operand 3 states and 1074 transitions. [2025-02-08 05:39:59,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 334 transitions, 743 flow [2025-02-08 05:40:00,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 334 transitions, 742 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:00,008 INFO L231 Difference]: Finished difference. Result has 330 places, 329 transitions, 682 flow [2025-02-08 05:40:00,009 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=661, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=682, PETRI_PLACES=330, PETRI_TRANSITIONS=329} [2025-02-08 05:40:00,011 INFO L279 CegarLoopForPetriNet]: 369 programPoint places, -39 predicate places. [2025-02-08 05:40:00,011 INFO L471 AbstractCegarLoop]: Abstraction has has 330 places, 329 transitions, 682 flow [2025-02-08 05:40:00,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 347.3333333333333) internal successors, (1042), 3 states have internal predecessors, (1042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:00,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:00,012 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] [2025-02-08 05:40:00,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:40:00,012 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2025-02-08 05:40:00,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:00,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1286149880, now seen corresponding path program 1 times [2025-02-08 05:40:00,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:00,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894212702] [2025-02-08 05:40:00,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:00,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:00,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-08 05:40:00,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-08 05:40:00,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:00,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:00,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:00,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:00,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894212702] [2025-02-08 05:40:00,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894212702] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:00,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:00,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 05:40:00,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725721659] [2025-02-08 05:40:00,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:00,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 05:40:00,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:00,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 05:40:00,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 05:40:00,464 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 399 [2025-02-08 05:40:00,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 329 transitions, 682 flow. Second operand has 7 states, 7 states have (on average 344.0) internal successors, (2408), 7 states have internal predecessors, (2408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:00,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:00,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 399 [2025-02-08 05:40:00,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:00,842 INFO L124 PetriNetUnfolderBase]: 171/1986 cut-off events. [2025-02-08 05:40:00,842 INFO L125 PetriNetUnfolderBase]: For 19/44 co-relation queries the response was YES. [2025-02-08 05:40:00,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2381 conditions, 1986 events. 171/1986 cut-off events. For 19/44 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 14147 event pairs, 79 based on Foata normal form. 9/1801 useless extension candidates. Maximal degree in co-relation 2332. Up to 184 conditions per place. [2025-02-08 05:40:00,855 INFO L140 encePairwiseOnDemand]: 386/399 looper letters, 47 selfloop transitions, 14 changer transitions 0/357 dead transitions. [2025-02-08 05:40:00,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 357 transitions, 868 flow [2025-02-08 05:40:00,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 05:40:00,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 05:40:00,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 3472 transitions. [2025-02-08 05:40:00,864 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8701754385964913 [2025-02-08 05:40:00,864 INFO L175 Difference]: Start difference. First operand has 330 places, 329 transitions, 682 flow. Second operand 10 states and 3472 transitions. [2025-02-08 05:40:00,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 357 transitions, 868 flow [2025-02-08 05:40:00,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 357 transitions, 868 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:40:00,870 INFO L231 Difference]: Finished difference. Result has 343 places, 336 transitions, 748 flow [2025-02-08 05:40:00,870 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=748, PETRI_PLACES=343, PETRI_TRANSITIONS=336} [2025-02-08 05:40:00,871 INFO L279 CegarLoopForPetriNet]: 369 programPoint places, -26 predicate places. [2025-02-08 05:40:00,871 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 336 transitions, 748 flow [2025-02-08 05:40:00,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 344.0) internal successors, (2408), 7 states have internal predecessors, (2408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:00,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:00,873 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] [2025-02-08 05:40:00,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:40:00,873 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2025-02-08 05:40:00,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:00,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1869044711, now seen corresponding path program 1 times [2025-02-08 05:40:00,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:00,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685531180] [2025-02-08 05:40:00,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:00,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:00,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-08 05:40:00,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-08 05:40:00,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:00,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:01,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:01,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:01,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685531180] [2025-02-08 05:40:01,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685531180] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:01,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:01,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:40:01,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960362541] [2025-02-08 05:40:01,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:01,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:40:01,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:01,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:40:01,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:40:01,055 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 352 out of 399 [2025-02-08 05:40:01,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 336 transitions, 748 flow. Second operand has 5 states, 5 states have (on average 354.0) internal successors, (1770), 5 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:01,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:01,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 352 of 399 [2025-02-08 05:40:01,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:01,422 INFO L124 PetriNetUnfolderBase]: 275/2143 cut-off events. [2025-02-08 05:40:01,422 INFO L125 PetriNetUnfolderBase]: For 96/144 co-relation queries the response was YES. [2025-02-08 05:40:01,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2760 conditions, 2143 events. 275/2143 cut-off events. For 96/144 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 15995 event pairs, 117 based on Foata normal form. 18/1917 useless extension candidates. Maximal degree in co-relation 2702. Up to 298 conditions per place. [2025-02-08 05:40:01,444 INFO L140 encePairwiseOnDemand]: 393/399 looper letters, 31 selfloop transitions, 5 changer transitions 0/351 dead transitions. [2025-02-08 05:40:01,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 351 transitions, 858 flow [2025-02-08 05:40:01,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 05:40:01,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 05:40:01,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1797 transitions. [2025-02-08 05:40:01,449 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9007518796992481 [2025-02-08 05:40:01,449 INFO L175 Difference]: Start difference. First operand has 343 places, 336 transitions, 748 flow. Second operand 5 states and 1797 transitions. [2025-02-08 05:40:01,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 351 transitions, 858 flow [2025-02-08 05:40:01,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 351 transitions, 854 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:01,457 INFO L231 Difference]: Finished difference. Result has 348 places, 338 transitions, 769 flow [2025-02-08 05:40:01,457 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=769, PETRI_PLACES=348, PETRI_TRANSITIONS=338} [2025-02-08 05:40:01,458 INFO L279 CegarLoopForPetriNet]: 369 programPoint places, -21 predicate places. [2025-02-08 05:40:01,459 INFO L471 AbstractCegarLoop]: Abstraction has has 348 places, 338 transitions, 769 flow [2025-02-08 05:40:01,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 354.0) internal successors, (1770), 5 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:01,461 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:01,461 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] [2025-02-08 05:40:01,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:40:01,461 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2025-02-08 05:40:01,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:01,462 INFO L85 PathProgramCache]: Analyzing trace with hash -734646126, now seen corresponding path program 1 times [2025-02-08 05:40:01,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:01,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802043632] [2025-02-08 05:40:01,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:01,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:01,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-08 05:40:01,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-08 05:40:01,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:01,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:01,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:01,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:01,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802043632] [2025-02-08 05:40:01,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802043632] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:01,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:01,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:40:01,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125195402] [2025-02-08 05:40:01,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:01,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:40:01,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:01,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:40:01,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:40:02,311 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 399 [2025-02-08 05:40:02,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 338 transitions, 769 flow. Second operand has 6 states, 6 states have (on average 341.6666666666667) internal successors, (2050), 6 states have internal predecessors, (2050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:02,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:02,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 399 [2025-02-08 05:40:02,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:02,722 INFO L124 PetriNetUnfolderBase]: 453/2448 cut-off events. [2025-02-08 05:40:02,722 INFO L125 PetriNetUnfolderBase]: For 302/356 co-relation queries the response was YES. [2025-02-08 05:40:02,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3527 conditions, 2448 events. 453/2448 cut-off events. For 302/356 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 18928 event pairs, 110 based on Foata normal form. 4/2163 useless extension candidates. Maximal degree in co-relation 3470. Up to 324 conditions per place. [2025-02-08 05:40:02,748 INFO L140 encePairwiseOnDemand]: 392/399 looper letters, 45 selfloop transitions, 5 changer transitions 0/352 dead transitions. [2025-02-08 05:40:02,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 352 transitions, 905 flow [2025-02-08 05:40:02,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:40:02,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:40:02,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2090 transitions. [2025-02-08 05:40:02,753 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.873015873015873 [2025-02-08 05:40:02,753 INFO L175 Difference]: Start difference. First operand has 348 places, 338 transitions, 769 flow. Second operand 6 states and 2090 transitions. [2025-02-08 05:40:02,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 352 transitions, 905 flow [2025-02-08 05:40:02,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 352 transitions, 900 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:02,760 INFO L231 Difference]: Finished difference. Result has 349 places, 336 transitions, 770 flow [2025-02-08 05:40:02,761 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=770, PETRI_PLACES=349, PETRI_TRANSITIONS=336} [2025-02-08 05:40:02,761 INFO L279 CegarLoopForPetriNet]: 369 programPoint places, -20 predicate places. [2025-02-08 05:40:02,761 INFO L471 AbstractCegarLoop]: Abstraction has has 349 places, 336 transitions, 770 flow [2025-02-08 05:40:02,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 341.6666666666667) internal successors, (2050), 6 states have internal predecessors, (2050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:02,762 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:02,763 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] [2025-02-08 05:40:02,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:40:02,763 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2025-02-08 05:40:02,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:02,764 INFO L85 PathProgramCache]: Analyzing trace with hash 339041622, now seen corresponding path program 1 times [2025-02-08 05:40:02,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:02,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646672563] [2025-02-08 05:40:02,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:02,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:02,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-08 05:40:02,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-08 05:40:02,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:02,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:03,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:03,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:03,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646672563] [2025-02-08 05:40:03,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646672563] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:03,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:03,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:40:03,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154301404] [2025-02-08 05:40:03,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:03,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:40:03,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:03,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:40:03,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:40:03,582 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 399 [2025-02-08 05:40:03,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 336 transitions, 770 flow. Second operand has 6 states, 6 states have (on average 341.8333333333333) internal successors, (2051), 6 states have internal predecessors, (2051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:03,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:03,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 399 [2025-02-08 05:40:03,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:04,094 INFO L124 PetriNetUnfolderBase]: 479/2393 cut-off events. [2025-02-08 05:40:04,094 INFO L125 PetriNetUnfolderBase]: For 276/397 co-relation queries the response was YES. [2025-02-08 05:40:04,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3434 conditions, 2393 events. 479/2393 cut-off events. For 276/397 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 18989 event pairs, 87 based on Foata normal form. 0/2167 useless extension candidates. Maximal degree in co-relation 3377. Up to 408 conditions per place. [2025-02-08 05:40:04,112 INFO L140 encePairwiseOnDemand]: 392/399 looper letters, 43 selfloop transitions, 5 changer transitions 0/350 dead transitions. [2025-02-08 05:40:04,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 350 transitions, 902 flow [2025-02-08 05:40:04,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:40:04,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:40:04,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2090 transitions. [2025-02-08 05:40:04,118 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.873015873015873 [2025-02-08 05:40:04,118 INFO L175 Difference]: Start difference. First operand has 349 places, 336 transitions, 770 flow. Second operand 6 states and 2090 transitions. [2025-02-08 05:40:04,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 350 transitions, 902 flow [2025-02-08 05:40:04,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 350 transitions, 892 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:40:04,126 INFO L231 Difference]: Finished difference. Result has 347 places, 334 transitions, 766 flow [2025-02-08 05:40:04,126 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=756, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=766, PETRI_PLACES=347, PETRI_TRANSITIONS=334} [2025-02-08 05:40:04,127 INFO L279 CegarLoopForPetriNet]: 369 programPoint places, -22 predicate places. [2025-02-08 05:40:04,127 INFO L471 AbstractCegarLoop]: Abstraction has has 347 places, 334 transitions, 766 flow [2025-02-08 05:40:04,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 341.8333333333333) internal successors, (2051), 6 states have internal predecessors, (2051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:04,128 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:04,129 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:04,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:40:04,129 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2025-02-08 05:40:04,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:04,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1512182463, now seen corresponding path program 1 times [2025-02-08 05:40:04,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:04,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539740844] [2025-02-08 05:40:04,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:04,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:04,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-08 05:40:04,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-08 05:40:04,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:04,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:04,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:40:04,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:04,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539740844] [2025-02-08 05:40:04,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539740844] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:04,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:04,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:40:04,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619047860] [2025-02-08 05:40:04,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:04,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:40:04,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:04,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:40:04,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:40:04,908 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 399 [2025-02-08 05:40:04,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 334 transitions, 766 flow. Second operand has 6 states, 6 states have (on average 342.1666666666667) internal successors, (2053), 6 states have internal predecessors, (2053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:04,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:04,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 399 [2025-02-08 05:40:04,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:05,238 INFO L124 PetriNetUnfolderBase]: 320/2248 cut-off events. [2025-02-08 05:40:05,238 INFO L125 PetriNetUnfolderBase]: For 140/219 co-relation queries the response was YES. [2025-02-08 05:40:05,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3279 conditions, 2248 events. 320/2248 cut-off events. For 140/219 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 17662 event pairs, 91 based on Foata normal form. 12/2099 useless extension candidates. Maximal degree in co-relation 3222. Up to 278 conditions per place. [2025-02-08 05:40:05,251 INFO L140 encePairwiseOnDemand]: 392/399 looper letters, 45 selfloop transitions, 5 changer transitions 0/348 dead transitions. [2025-02-08 05:40:05,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 348 transitions, 902 flow [2025-02-08 05:40:05,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:40:05,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:40:05,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2090 transitions. [2025-02-08 05:40:05,256 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.873015873015873 [2025-02-08 05:40:05,256 INFO L175 Difference]: Start difference. First operand has 347 places, 334 transitions, 766 flow. Second operand 6 states and 2090 transitions. [2025-02-08 05:40:05,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 348 transitions, 902 flow [2025-02-08 05:40:05,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 348 transitions, 892 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:40:05,263 INFO L231 Difference]: Finished difference. Result has 345 places, 332 transitions, 762 flow [2025-02-08 05:40:05,264 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=762, PETRI_PLACES=345, PETRI_TRANSITIONS=332} [2025-02-08 05:40:05,265 INFO L279 CegarLoopForPetriNet]: 369 programPoint places, -24 predicate places. [2025-02-08 05:40:05,265 INFO L471 AbstractCegarLoop]: Abstraction has has 345 places, 332 transitions, 762 flow [2025-02-08 05:40:05,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 342.1666666666667) internal successors, (2053), 6 states have internal predecessors, (2053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:05,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:05,266 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:05,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:40:05,266 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2025-02-08 05:40:05,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:05,267 INFO L85 PathProgramCache]: Analyzing trace with hash 221722388, now seen corresponding path program 1 times [2025-02-08 05:40:05,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:05,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12603750] [2025-02-08 05:40:05,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:05,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:05,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-08 05:40:05,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-08 05:40:05,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:05,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:05,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:05,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:05,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12603750] [2025-02-08 05:40:05,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12603750] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:05,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:05,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:05,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919540418] [2025-02-08 05:40:05,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:05,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:05,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:05,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:05,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:05,339 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 362 out of 399 [2025-02-08 05:40:05,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 332 transitions, 762 flow. Second operand has 3 states, 3 states have (on average 364.6666666666667) internal successors, (1094), 3 states have internal predecessors, (1094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:05,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:05,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 362 of 399 [2025-02-08 05:40:05,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:05,534 INFO L124 PetriNetUnfolderBase]: 94/1366 cut-off events. [2025-02-08 05:40:05,534 INFO L125 PetriNetUnfolderBase]: For 41/66 co-relation queries the response was YES. [2025-02-08 05:40:05,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1715 conditions, 1366 events. 94/1366 cut-off events. For 41/66 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 8151 event pairs, 23 based on Foata normal form. 3/1279 useless extension candidates. Maximal degree in co-relation 1659. Up to 112 conditions per place. [2025-02-08 05:40:05,548 INFO L140 encePairwiseOnDemand]: 396/399 looper letters, 13 selfloop transitions, 2 changer transitions 0/335 dead transitions. [2025-02-08 05:40:05,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 335 transitions, 800 flow [2025-02-08 05:40:05,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:05,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:05,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1102 transitions. [2025-02-08 05:40:05,551 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2025-02-08 05:40:05,551 INFO L175 Difference]: Start difference. First operand has 345 places, 332 transitions, 762 flow. Second operand 3 states and 1102 transitions. [2025-02-08 05:40:05,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 335 transitions, 800 flow [2025-02-08 05:40:05,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 335 transitions, 790 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:40:05,557 INFO L231 Difference]: Finished difference. Result has 341 places, 331 transitions, 754 flow [2025-02-08 05:40:05,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=754, PETRI_PLACES=341, PETRI_TRANSITIONS=331} [2025-02-08 05:40:05,558 INFO L279 CegarLoopForPetriNet]: 369 programPoint places, -28 predicate places. [2025-02-08 05:40:05,558 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 331 transitions, 754 flow [2025-02-08 05:40:05,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 364.6666666666667) internal successors, (1094), 3 states have internal predecessors, (1094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:05,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:05,559 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] [2025-02-08 05:40:05,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:40:05,559 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2025-02-08 05:40:05,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:05,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1159119134, now seen corresponding path program 1 times [2025-02-08 05:40:05,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:05,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927268081] [2025-02-08 05:40:05,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:05,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:05,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-08 05:40:05,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-08 05:40:05,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:05,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:05,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:05,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:05,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927268081] [2025-02-08 05:40:05,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927268081] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:05,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:05,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:05,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849760725] [2025-02-08 05:40:05,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:05,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:05,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:05,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:05,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:05,606 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 362 out of 399 [2025-02-08 05:40:05,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 331 transitions, 754 flow. Second operand has 3 states, 3 states have (on average 364.6666666666667) internal successors, (1094), 3 states have internal predecessors, (1094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:05,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:05,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 362 of 399 [2025-02-08 05:40:05,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:05,790 INFO L124 PetriNetUnfolderBase]: 96/1323 cut-off events. [2025-02-08 05:40:05,790 INFO L125 PetriNetUnfolderBase]: For 67/88 co-relation queries the response was YES. [2025-02-08 05:40:05,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1660 conditions, 1323 events. 96/1323 cut-off events. For 67/88 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 7900 event pairs, 7 based on Foata normal form. 8/1254 useless extension candidates. Maximal degree in co-relation 1604. Up to 87 conditions per place. [2025-02-08 05:40:05,799 INFO L140 encePairwiseOnDemand]: 395/399 looper letters, 0 selfloop transitions, 0 changer transitions 336/336 dead transitions. [2025-02-08 05:40:05,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 336 transitions, 801 flow [2025-02-08 05:40:05,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:05,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:05,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1103 transitions. [2025-02-08 05:40:05,802 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9214703425229741 [2025-02-08 05:40:05,802 INFO L175 Difference]: Start difference. First operand has 341 places, 331 transitions, 754 flow. Second operand 3 states and 1103 transitions. [2025-02-08 05:40:05,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 336 transitions, 801 flow [2025-02-08 05:40:05,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 336 transitions, 798 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:05,806 INFO L231 Difference]: Finished difference. Result has 341 places, 0 transitions, 0 flow [2025-02-08 05:40:05,807 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=341, PETRI_TRANSITIONS=0} [2025-02-08 05:40:05,807 INFO L279 CegarLoopForPetriNet]: 369 programPoint places, -28 predicate places. [2025-02-08 05:40:05,807 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 0 transitions, 0 flow [2025-02-08 05:40:05,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 364.6666666666667) internal successors, (1094), 3 states have internal predecessors, (1094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:05,810 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (72 of 73 remaining) [2025-02-08 05:40:05,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (71 of 73 remaining) [2025-02-08 05:40:05,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (70 of 73 remaining) [2025-02-08 05:40:05,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (69 of 73 remaining) [2025-02-08 05:40:05,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (68 of 73 remaining) [2025-02-08 05:40:05,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (67 of 73 remaining) [2025-02-08 05:40:05,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (66 of 73 remaining) [2025-02-08 05:40:05,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (65 of 73 remaining) [2025-02-08 05:40:05,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (64 of 73 remaining) [2025-02-08 05:40:05,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (63 of 73 remaining) [2025-02-08 05:40:05,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (62 of 73 remaining) [2025-02-08 05:40:05,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (61 of 73 remaining) [2025-02-08 05:40:05,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (60 of 73 remaining) [2025-02-08 05:40:05,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (59 of 73 remaining) [2025-02-08 05:40:05,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (58 of 73 remaining) [2025-02-08 05:40:05,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (57 of 73 remaining) [2025-02-08 05:40:05,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (56 of 73 remaining) [2025-02-08 05:40:05,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (55 of 73 remaining) [2025-02-08 05:40:05,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (54 of 73 remaining) [2025-02-08 05:40:05,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (53 of 73 remaining) [2025-02-08 05:40:05,813 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (52 of 73 remaining) [2025-02-08 05:40:05,813 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (51 of 73 remaining) [2025-02-08 05:40:05,813 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (50 of 73 remaining) [2025-02-08 05:40:05,813 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (49 of 73 remaining) [2025-02-08 05:40:05,813 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (48 of 73 remaining) [2025-02-08 05:40:05,813 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (47 of 73 remaining) [2025-02-08 05:40:05,813 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (46 of 73 remaining) [2025-02-08 05:40:05,813 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (45 of 73 remaining) [2025-02-08 05:40:05,813 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (44 of 73 remaining) [2025-02-08 05:40:05,813 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (43 of 73 remaining) [2025-02-08 05:40:05,813 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (42 of 73 remaining) [2025-02-08 05:40:05,813 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (41 of 73 remaining) [2025-02-08 05:40:05,813 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (40 of 73 remaining) [2025-02-08 05:40:05,813 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (39 of 73 remaining) [2025-02-08 05:40:05,813 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (38 of 73 remaining) [2025-02-08 05:40:05,813 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (37 of 73 remaining) [2025-02-08 05:40:05,813 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (36 of 73 remaining) [2025-02-08 05:40:05,813 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (35 of 73 remaining) [2025-02-08 05:40:05,814 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (34 of 73 remaining) [2025-02-08 05:40:05,814 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (33 of 73 remaining) [2025-02-08 05:40:05,814 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (32 of 73 remaining) [2025-02-08 05:40:05,814 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (31 of 73 remaining) [2025-02-08 05:40:05,814 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 73 remaining) [2025-02-08 05:40:05,814 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 73 remaining) [2025-02-08 05:40:05,814 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 73 remaining) [2025-02-08 05:40:05,814 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (27 of 73 remaining) [2025-02-08 05:40:05,814 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (26 of 73 remaining) [2025-02-08 05:40:05,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (25 of 73 remaining) [2025-02-08 05:40:05,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (24 of 73 remaining) [2025-02-08 05:40:05,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (23 of 73 remaining) [2025-02-08 05:40:05,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (22 of 73 remaining) [2025-02-08 05:40:05,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (21 of 73 remaining) [2025-02-08 05:40:05,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (20 of 73 remaining) [2025-02-08 05:40:05,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (19 of 73 remaining) [2025-02-08 05:40:05,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (18 of 73 remaining) [2025-02-08 05:40:05,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (17 of 73 remaining) [2025-02-08 05:40:05,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (16 of 73 remaining) [2025-02-08 05:40:05,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (15 of 73 remaining) [2025-02-08 05:40:05,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (14 of 73 remaining) [2025-02-08 05:40:05,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (13 of 73 remaining) [2025-02-08 05:40:05,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (12 of 73 remaining) [2025-02-08 05:40:05,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (11 of 73 remaining) [2025-02-08 05:40:05,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (10 of 73 remaining) [2025-02-08 05:40:05,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (9 of 73 remaining) [2025-02-08 05:40:05,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (8 of 73 remaining) [2025-02-08 05:40:05,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (7 of 73 remaining) [2025-02-08 05:40:05,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (6 of 73 remaining) [2025-02-08 05:40:05,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (5 of 73 remaining) [2025-02-08 05:40:05,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (4 of 73 remaining) [2025-02-08 05:40:05,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (3 of 73 remaining) [2025-02-08 05:40:05,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (2 of 73 remaining) [2025-02-08 05:40:05,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (1 of 73 remaining) [2025-02-08 05:40:05,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (0 of 73 remaining) [2025-02-08 05:40:05,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:40:05,817 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:05,822 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:40:05,822 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:40:05,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:40:05 BasicIcfg [2025-02-08 05:40:05,827 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:40:05,827 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:40:05,828 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:40:05,828 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:40:05,828 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:52" (3/4) ... [2025-02-08 05:40:05,830 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:40:05,832 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:40:05,832 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:40:05,832 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 05:40:05,837 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2025-02-08 05:40:05,838 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:40:05,838 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:40:05,839 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:40:05,926 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:40:05,927 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:40:05,927 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:40:05,929 INFO L158 Benchmark]: Toolchain (without parser) took 14626.70ms. Allocated memory was 142.6MB in the beginning and 931.1MB in the end (delta: 788.5MB). Free memory was 113.5MB in the beginning and 435.0MB in the end (delta: -321.5MB). Peak memory consumption was 463.9MB. Max. memory is 16.1GB. [2025-02-08 05:40:05,929 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:40:05,929 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.19ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 99.8MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:40:05,929 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.12ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 96.5MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:40:05,930 INFO L158 Benchmark]: Boogie Preprocessor took 70.56ms. Allocated memory is still 142.6MB. Free memory was 96.5MB in the beginning and 94.4MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:40:05,930 INFO L158 Benchmark]: IcfgBuilder took 1069.10ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 102.4MB in the end (delta: -8.0MB). Peak memory consumption was 56.9MB. Max. memory is 16.1GB. [2025-02-08 05:40:05,931 INFO L158 Benchmark]: TraceAbstraction took 12986.28ms. Allocated memory was 142.6MB in the beginning and 931.1MB in the end (delta: 788.5MB). Free memory was 102.4MB in the beginning and 443.4MB in the end (delta: -341.0MB). Peak memory consumption was 440.6MB. Max. memory is 16.1GB. [2025-02-08 05:40:05,931 INFO L158 Benchmark]: Witness Printer took 99.30ms. Allocated memory is still 931.1MB. Free memory was 443.4MB in the beginning and 435.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:40:05,932 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.19ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 323.19ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 99.8MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.12ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 96.5MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 70.56ms. Allocated memory is still 142.6MB. Free memory was 96.5MB in the beginning and 94.4MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1069.10ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 102.4MB in the end (delta: -8.0MB). Peak memory consumption was 56.9MB. Max. memory is 16.1GB. * TraceAbstraction took 12986.28ms. Allocated memory was 142.6MB in the beginning and 931.1MB in the end (delta: 788.5MB). Free memory was 102.4MB in the beginning and 443.4MB in the end (delta: -341.0MB). Peak memory consumption was 440.6MB. Max. memory is 16.1GB. * Witness Printer took 99.30ms. Allocated memory is still 931.1MB. Free memory was 443.4MB in the beginning and 435.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: 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: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: 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: 118]: 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: 118]: 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: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 547 locations, 73 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: 12.8s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1468 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 836 mSDsluCounter, 501 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 432 mSDsCounter, 394 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2415 IncrementalHoareTripleChecker+Invalid, 2809 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 394 mSolverCounterUnsat, 69 mSDtfsCounter, 2415 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=776occurred in iteration=0, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1796 NumberOfCodeBlocks, 1796 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1779 ConstructedInterpolants, 0 QuantifiedInterpolants, 2551 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 1/1 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 45 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:40:05,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE