./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-exp-term-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-exp-term-subst.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 2a508120cc7913f10b79dda7ca65a8b88f829725798d520aee5d1c1d04a1fc13 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:37:25,843 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:37:25,918 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:37:25,925 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:37:25,929 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:37:25,954 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:37:25,955 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:37:25,955 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:37:25,959 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:37:25,959 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:37:25,959 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:37:25,959 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:37:25,959 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:37:25,959 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:37:25,959 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:37:25,959 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:37:25,959 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:37:25,959 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:37:25,959 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:37:25,959 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:37:25,960 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:37:25,960 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:37:25,960 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:37:25,960 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:37:25,960 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:37:25,960 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:37:25,960 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:37:25,960 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:37:25,960 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:37:25,960 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:37:25,960 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:37:25,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:37:25,960 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:37:25,960 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:37:25,960 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:37:25,960 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:37:25,960 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:37:25,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:37:25,960 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:37:25,961 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:37:25,961 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:37:25,961 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:37:25,961 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 -> 2a508120cc7913f10b79dda7ca65a8b88f829725798d520aee5d1c1d04a1fc13 [2025-02-08 05:37:26,210 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:37:26,217 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:37:26,219 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:37:26,220 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:37:26,220 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:37:26,221 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-exp-term-subst.wvr.c [2025-02-08 05:37:27,472 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ea5489fad/1bc67166d2f94cf59d815ddd1b638606/FLAG3f195a7e2 [2025-02-08 05:37:27,775 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:37:27,780 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-exp-term-subst.wvr.c [2025-02-08 05:37:27,787 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ea5489fad/1bc67166d2f94cf59d815ddd1b638606/FLAG3f195a7e2 [2025-02-08 05:37:28,060 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ea5489fad/1bc67166d2f94cf59d815ddd1b638606 [2025-02-08 05:37:28,062 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:37:28,063 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:37:28,064 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:28,064 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:37:28,067 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:37:28,068 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:28" (1/1) ... [2025-02-08 05:37:28,069 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e979e6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:28, skipping insertion in model container [2025-02-08 05:37:28,069 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:28" (1/1) ... [2025-02-08 05:37:28,080 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:37:28,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:28,266 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:37:28,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:28,297 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:37:28,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:28 WrapperNode [2025-02-08 05:37:28,298 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:28,298 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:28,298 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:37:28,298 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:37:28,303 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:28" (1/1) ... [2025-02-08 05:37:28,308 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:28" (1/1) ... [2025-02-08 05:37:28,329 INFO L138 Inliner]: procedures = 22, calls = 17, calls flagged for inlining = 10, calls inlined = 14, statements flattened = 317 [2025-02-08 05:37:28,329 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:28,330 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:37:28,330 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:37:28,330 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:37:28,335 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:28" (1/1) ... [2025-02-08 05:37:28,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:28" (1/1) ... [2025-02-08 05:37:28,338 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:28" (1/1) ... [2025-02-08 05:37:28,338 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:28" (1/1) ... [2025-02-08 05:37:28,342 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:28" (1/1) ... [2025-02-08 05:37:28,343 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:28" (1/1) ... [2025-02-08 05:37:28,344 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:28" (1/1) ... [2025-02-08 05:37:28,344 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:28" (1/1) ... [2025-02-08 05:37:28,346 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:37:28,347 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:37:28,347 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:37:28,347 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:37:28,347 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:28" (1/1) ... [2025-02-08 05:37:28,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:37:28,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:37:28,388 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:37:28,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:37:28,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:37:28,409 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:37:28,409 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:37:28,409 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:37:28,409 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:37:28,409 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 05:37:28,409 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 05:37:28,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:37:28,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:37:28,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:37:28,410 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:37:28,481 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:37:28,482 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:37:28,626 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L44-14: #t~ite5#1 := #t~ret4#1; [2025-02-08 05:37:28,627 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L44-15: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret4#1 && #t~ret4#1 <= 2147483647; [2025-02-08 05:37:28,627 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L44-16: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:28,627 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L44-17: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:28,627 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L44-18: #t~ret4#1 := minus_#res#1; [2025-02-08 05:37:28,721 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-14: #t~ite13#1 := #t~ret12#1; [2025-02-08 05:37:28,722 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-15: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret12#1 && #t~ret12#1 <= 2147483647; [2025-02-08 05:37:28,722 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-16: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:28,722 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-17: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:28,722 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-18: #t~ret12#1 := minus_#res#1; [2025-02-08 05:37:28,814 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-14: #t~ite21#1 := #t~ret20#1; [2025-02-08 05:37:28,814 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-15: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret20#1 && #t~ret20#1 <= 2147483647; [2025-02-08 05:37:28,814 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-16: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:28,814 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-17: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:28,814 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-18: #t~ret20#1 := minus_#res#1; [2025-02-08 05:37:28,919 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:37:28,919 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:37:28,944 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:37:28,944 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:37:28,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:28 BoogieIcfgContainer [2025-02-08 05:37:28,944 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:37:28,946 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:37:28,946 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:37:28,950 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:37:28,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:37:28" (1/3) ... [2025-02-08 05:37:28,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f939cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:28, skipping insertion in model container [2025-02-08 05:37:28,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:28" (2/3) ... [2025-02-08 05:37:28,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f939cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:28, skipping insertion in model container [2025-02-08 05:37:28,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:28" (3/3) ... [2025-02-08 05:37:28,951 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-exp-term-subst.wvr.c [2025-02-08 05:37:28,961 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:37:28,962 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-exp-term-subst.wvr.c that has 4 procedures, 392 locations, 1 initial locations, 0 loop locations, and 44 error locations. [2025-02-08 05:37:28,962 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:37:29,102 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:37:29,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 401 places, 415 transitions, 851 flow [2025-02-08 05:37:29,303 INFO L124 PetriNetUnfolderBase]: 24/412 cut-off events. [2025-02-08 05:37:29,304 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:37:29,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 425 conditions, 412 events. 24/412 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1377 event pairs, 0 based on Foata normal form. 0/341 useless extension candidates. Maximal degree in co-relation 291. Up to 2 conditions per place. [2025-02-08 05:37:29,315 INFO L82 GeneralOperation]: Start removeDead. Operand has 401 places, 415 transitions, 851 flow [2025-02-08 05:37:29,322 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 380 places, 392 transitions, 802 flow [2025-02-08 05:37:29,328 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:37:29,336 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;@725ee391, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:37:29,336 INFO L334 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2025-02-08 05:37:29,345 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:37:29,345 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-02-08 05:37:29,345 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:37:29,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:29,346 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] [2025-02-08 05:37:29,346 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-02-08 05:37:29,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:29,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1390910504, now seen corresponding path program 1 times [2025-02-08 05:37:29,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:29,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698273963] [2025-02-08 05:37:29,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:29,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:29,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 05:37:29,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 05:37:29,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:29,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:29,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:29,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:29,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698273963] [2025-02-08 05:37:29,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698273963] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:29,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:29,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:29,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684837925] [2025-02-08 05:37:29,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:29,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:29,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:29,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:29,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:29,536 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 389 out of 415 [2025-02-08 05:37:29,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 392 transitions, 802 flow. Second operand has 3 states, 3 states have (on average 390.3333333333333) internal successors, (1171), 3 states have internal predecessors, (1171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:29,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:29,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 389 of 415 [2025-02-08 05:37:29,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:29,718 INFO L124 PetriNetUnfolderBase]: 85/1332 cut-off events. [2025-02-08 05:37:29,718 INFO L125 PetriNetUnfolderBase]: For 28/32 co-relation queries the response was YES. [2025-02-08 05:37:29,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1419 conditions, 1332 events. 85/1332 cut-off events. For 28/32 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 9313 event pairs, 20 based on Foata normal form. 39/1104 useless extension candidates. Maximal degree in co-relation 1287. Up to 50 conditions per place. [2025-02-08 05:37:29,738 INFO L140 encePairwiseOnDemand]: 405/415 looper letters, 13 selfloop transitions, 2 changer transitions 1/384 dead transitions. [2025-02-08 05:37:29,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 384 transitions, 816 flow [2025-02-08 05:37:29,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:29,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:29,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1190 transitions. [2025-02-08 05:37:29,754 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9558232931726908 [2025-02-08 05:37:29,755 INFO L175 Difference]: Start difference. First operand has 380 places, 392 transitions, 802 flow. Second operand 3 states and 1190 transitions. [2025-02-08 05:37:29,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 384 transitions, 816 flow [2025-02-08 05:37:29,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 384 transitions, 804 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 05:37:29,767 INFO L231 Difference]: Finished difference. Result has 375 places, 383 transitions, 776 flow [2025-02-08 05:37:29,771 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=776, PETRI_PLACES=375, PETRI_TRANSITIONS=383} [2025-02-08 05:37:29,773 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -5 predicate places. [2025-02-08 05:37:29,774 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 383 transitions, 776 flow [2025-02-08 05:37:29,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 390.3333333333333) internal successors, (1171), 3 states have internal predecessors, (1171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:29,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:29,775 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] [2025-02-08 05:37:29,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:37:29,776 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-02-08 05:37:29,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:29,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1456867335, now seen corresponding path program 1 times [2025-02-08 05:37:29,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:29,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915649758] [2025-02-08 05:37:29,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:29,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:29,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 05:37:29,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 05:37:29,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:29,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:29,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:29,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:29,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915649758] [2025-02-08 05:37:29,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915649758] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:29,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:29,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:29,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573753656] [2025-02-08 05:37:29,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:29,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:29,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:29,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:29,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:29,892 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 389 out of 415 [2025-02-08 05:37:29,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 383 transitions, 776 flow. Second operand has 3 states, 3 states have (on average 390.3333333333333) internal successors, (1171), 3 states have internal predecessors, (1171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:29,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:29,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 389 of 415 [2025-02-08 05:37:29,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:29,995 INFO L124 PetriNetUnfolderBase]: 47/772 cut-off events. [2025-02-08 05:37:29,995 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2025-02-08 05:37:30,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 772 events. 47/772 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4435 event pairs, 12 based on Foata normal form. 0/627 useless extension candidates. Maximal degree in co-relation 789. Up to 38 conditions per place. [2025-02-08 05:37:30,007 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 13 selfloop transitions, 2 changer transitions 0/382 dead transitions. [2025-02-08 05:37:30,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 382 transitions, 804 flow [2025-02-08 05:37:30,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:30,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:30,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1183 transitions. [2025-02-08 05:37:30,013 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9502008032128514 [2025-02-08 05:37:30,014 INFO L175 Difference]: Start difference. First operand has 375 places, 383 transitions, 776 flow. Second operand 3 states and 1183 transitions. [2025-02-08 05:37:30,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 382 transitions, 804 flow [2025-02-08 05:37:30,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 382 transitions, 800 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:30,020 INFO L231 Difference]: Finished difference. Result has 373 places, 382 transitions, 774 flow [2025-02-08 05:37:30,022 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=774, PETRI_PLACES=373, PETRI_TRANSITIONS=382} [2025-02-08 05:37:30,022 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -7 predicate places. [2025-02-08 05:37:30,023 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 382 transitions, 774 flow [2025-02-08 05:37:30,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 390.3333333333333) internal successors, (1171), 3 states have internal predecessors, (1171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:30,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:30,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] [2025-02-08 05:37:30,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:37:30,025 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-02-08 05:37:30,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:30,026 INFO L85 PathProgramCache]: Analyzing trace with hash 74168611, now seen corresponding path program 1 times [2025-02-08 05:37:30,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:30,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332054571] [2025-02-08 05:37:30,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:30,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:30,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 05:37:30,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 05:37:30,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:30,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:30,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:30,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:30,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332054571] [2025-02-08 05:37:30,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332054571] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:30,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:30,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:30,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696462120] [2025-02-08 05:37:30,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:30,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:30,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:30,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:30,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:30,108 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 389 out of 415 [2025-02-08 05:37:30,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 382 transitions, 774 flow. Second operand has 3 states, 3 states have (on average 390.3333333333333) internal successors, (1171), 3 states have internal predecessors, (1171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:30,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:30,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 389 of 415 [2025-02-08 05:37:30,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:30,189 INFO L124 PetriNetUnfolderBase]: 45/595 cut-off events. [2025-02-08 05:37:30,190 INFO L125 PetriNetUnfolderBase]: For 9/12 co-relation queries the response was YES. [2025-02-08 05:37:30,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 656 conditions, 595 events. 45/595 cut-off events. For 9/12 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2973 event pairs, 20 based on Foata normal form. 0/491 useless extension candidates. Maximal degree in co-relation 614. Up to 50 conditions per place. [2025-02-08 05:37:30,200 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 13 selfloop transitions, 2 changer transitions 0/381 dead transitions. [2025-02-08 05:37:30,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 381 transitions, 802 flow [2025-02-08 05:37:30,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:30,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:30,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1183 transitions. [2025-02-08 05:37:30,203 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9502008032128514 [2025-02-08 05:37:30,203 INFO L175 Difference]: Start difference. First operand has 373 places, 382 transitions, 774 flow. Second operand 3 states and 1183 transitions. [2025-02-08 05:37:30,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 381 transitions, 802 flow [2025-02-08 05:37:30,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 381 transitions, 798 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:30,231 INFO L231 Difference]: Finished difference. Result has 372 places, 381 transitions, 772 flow [2025-02-08 05:37:30,232 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=772, PETRI_PLACES=372, PETRI_TRANSITIONS=381} [2025-02-08 05:37:30,237 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -8 predicate places. [2025-02-08 05:37:30,237 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 381 transitions, 772 flow [2025-02-08 05:37:30,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 390.3333333333333) internal successors, (1171), 3 states have internal predecessors, (1171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:30,238 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:30,238 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:30,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:37:30,238 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-02-08 05:37:30,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:30,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1932264345, now seen corresponding path program 1 times [2025-02-08 05:37:30,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:30,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251837858] [2025-02-08 05:37:30,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:30,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:30,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 05:37:30,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 05:37:30,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:30,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:30,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:30,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:30,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251837858] [2025-02-08 05:37:30,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251837858] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:30,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:30,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:30,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916375547] [2025-02-08 05:37:30,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:30,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:30,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:30,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:30,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:30,387 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 415 [2025-02-08 05:37:30,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 381 transitions, 772 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:30,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:30,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 415 [2025-02-08 05:37:30,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:30,505 INFO L124 PetriNetUnfolderBase]: 104/1299 cut-off events. [2025-02-08 05:37:30,506 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 05:37:30,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1411 conditions, 1299 events. 104/1299 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 9502 event pairs, 39 based on Foata normal form. 0/1035 useless extension candidates. Maximal degree in co-relation 1361. Up to 85 conditions per place. [2025-02-08 05:37:30,522 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 15 selfloop transitions, 2 changer transitions 0/380 dead transitions. [2025-02-08 05:37:30,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 380 transitions, 804 flow [2025-02-08 05:37:30,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:30,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:30,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1179 transitions. [2025-02-08 05:37:30,524 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.946987951807229 [2025-02-08 05:37:30,524 INFO L175 Difference]: Start difference. First operand has 372 places, 381 transitions, 772 flow. Second operand 3 states and 1179 transitions. [2025-02-08 05:37:30,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 380 transitions, 804 flow [2025-02-08 05:37:30,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 380 transitions, 800 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:30,528 INFO L231 Difference]: Finished difference. Result has 371 places, 380 transitions, 770 flow [2025-02-08 05:37:30,529 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=770, PETRI_PLACES=371, PETRI_TRANSITIONS=380} [2025-02-08 05:37:30,529 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -9 predicate places. [2025-02-08 05:37:30,530 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 380 transitions, 770 flow [2025-02-08 05:37:30,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:30,530 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:30,530 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] [2025-02-08 05:37:30,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:37:30,531 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-02-08 05:37:30,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:30,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1773170855, now seen corresponding path program 1 times [2025-02-08 05:37:30,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:30,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031826828] [2025-02-08 05:37:30,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:30,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:30,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-08 05:37:30,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-08 05:37:30,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:30,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:30,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:30,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:30,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031826828] [2025-02-08 05:37:30,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031826828] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:30,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:30,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:30,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735075150] [2025-02-08 05:37:30,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:30,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:30,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:30,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:30,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:30,594 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 415 [2025-02-08 05:37:30,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 380 transitions, 770 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:30,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:30,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 415 [2025-02-08 05:37:30,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:30,703 INFO L124 PetriNetUnfolderBase]: 61/831 cut-off events. [2025-02-08 05:37:30,703 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:37:30,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 904 conditions, 831 events. 61/831 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5077 event pairs, 21 based on Foata normal form. 0/675 useless extension candidates. Maximal degree in co-relation 846. Up to 58 conditions per place. [2025-02-08 05:37:30,719 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 15 selfloop transitions, 2 changer transitions 0/379 dead transitions. [2025-02-08 05:37:30,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 379 transitions, 802 flow [2025-02-08 05:37:30,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:30,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:30,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1179 transitions. [2025-02-08 05:37:30,722 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.946987951807229 [2025-02-08 05:37:30,722 INFO L175 Difference]: Start difference. First operand has 371 places, 380 transitions, 770 flow. Second operand 3 states and 1179 transitions. [2025-02-08 05:37:30,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 379 transitions, 802 flow [2025-02-08 05:37:30,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 379 transitions, 798 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:30,729 INFO L231 Difference]: Finished difference. Result has 370 places, 379 transitions, 768 flow [2025-02-08 05:37:30,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=768, PETRI_PLACES=370, PETRI_TRANSITIONS=379} [2025-02-08 05:37:30,730 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -10 predicate places. [2025-02-08 05:37:30,730 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 379 transitions, 768 flow [2025-02-08 05:37:30,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:30,731 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:30,731 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] [2025-02-08 05:37:30,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:37:30,731 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-02-08 05:37:30,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:30,731 INFO L85 PathProgramCache]: Analyzing trace with hash -2019832891, now seen corresponding path program 1 times [2025-02-08 05:37:30,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:30,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612142188] [2025-02-08 05:37:30,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:30,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:30,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-08 05:37:30,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 05:37:30,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:30,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:30,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:30,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:30,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612142188] [2025-02-08 05:37:30,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612142188] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:30,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:30,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:30,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579984789] [2025-02-08 05:37:30,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:30,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:30,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:30,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:30,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:30,813 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 415 [2025-02-08 05:37:30,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 379 transitions, 768 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:30,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:30,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 415 [2025-02-08 05:37:30,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:30,943 INFO L124 PetriNetUnfolderBase]: 104/1267 cut-off events. [2025-02-08 05:37:30,943 INFO L125 PetriNetUnfolderBase]: For 21/26 co-relation queries the response was YES. [2025-02-08 05:37:30,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1364 conditions, 1267 events. 104/1267 cut-off events. For 21/26 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 8193 event pairs, 39 based on Foata normal form. 0/1015 useless extension candidates. Maximal degree in co-relation 1298. Up to 85 conditions per place. [2025-02-08 05:37:30,955 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 15 selfloop transitions, 2 changer transitions 0/378 dead transitions. [2025-02-08 05:37:30,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 378 transitions, 800 flow [2025-02-08 05:37:30,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:30,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:30,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1179 transitions. [2025-02-08 05:37:30,957 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.946987951807229 [2025-02-08 05:37:30,957 INFO L175 Difference]: Start difference. First operand has 370 places, 379 transitions, 768 flow. Second operand 3 states and 1179 transitions. [2025-02-08 05:37:30,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 378 transitions, 800 flow [2025-02-08 05:37:30,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 378 transitions, 796 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:30,962 INFO L231 Difference]: Finished difference. Result has 369 places, 378 transitions, 766 flow [2025-02-08 05:37:30,963 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=766, PETRI_PLACES=369, PETRI_TRANSITIONS=378} [2025-02-08 05:37:30,963 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -11 predicate places. [2025-02-08 05:37:30,963 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 378 transitions, 766 flow [2025-02-08 05:37:30,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:30,964 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:30,964 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] [2025-02-08 05:37:30,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:37:30,964 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-02-08 05:37:30,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:30,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1070171071, now seen corresponding path program 1 times [2025-02-08 05:37:30,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:30,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157166041] [2025-02-08 05:37:30,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:30,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:30,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-08 05:37:30,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-08 05:37:30,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:30,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:31,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:31,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:31,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157166041] [2025-02-08 05:37:31,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157166041] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:31,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:31,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:31,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719017370] [2025-02-08 05:37:31,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:31,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:31,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:31,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:31,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:31,041 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 381 out of 415 [2025-02-08 05:37:31,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 378 transitions, 766 flow. Second operand has 3 states, 3 states have (on average 382.3333333333333) internal successors, (1147), 3 states have internal predecessors, (1147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:31,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:31,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 381 of 415 [2025-02-08 05:37:31,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:31,314 INFO L124 PetriNetUnfolderBase]: 255/2491 cut-off events. [2025-02-08 05:37:31,314 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-02-08 05:37:31,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2808 conditions, 2491 events. 255/2491 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 23399 event pairs, 117 based on Foata normal form. 0/2048 useless extension candidates. Maximal degree in co-relation 2734. Up to 251 conditions per place. [2025-02-08 05:37:31,340 INFO L140 encePairwiseOnDemand]: 407/415 looper letters, 21 selfloop transitions, 2 changer transitions 0/376 dead transitions. [2025-02-08 05:37:31,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 376 transitions, 810 flow [2025-02-08 05:37:31,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:31,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:31,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2025-02-08 05:37:31,343 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2025-02-08 05:37:31,343 INFO L175 Difference]: Start difference. First operand has 369 places, 378 transitions, 766 flow. Second operand 3 states and 1172 transitions. [2025-02-08 05:37:31,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 376 transitions, 810 flow [2025-02-08 05:37:31,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 376 transitions, 806 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:31,349 INFO L231 Difference]: Finished difference. Result has 364 places, 374 transitions, 764 flow [2025-02-08 05:37:31,349 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=764, PETRI_PLACES=364, PETRI_TRANSITIONS=374} [2025-02-08 05:37:31,350 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -16 predicate places. [2025-02-08 05:37:31,350 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 374 transitions, 764 flow [2025-02-08 05:37:31,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 382.3333333333333) internal successors, (1147), 3 states have internal predecessors, (1147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:31,351 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:31,351 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:31,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:37:31,351 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-02-08 05:37:31,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:31,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1937189374, now seen corresponding path program 1 times [2025-02-08 05:37:31,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:31,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534930926] [2025-02-08 05:37:31,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:31,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:31,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-08 05:37:31,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-08 05:37:31,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:31,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:31,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:31,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:31,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534930926] [2025-02-08 05:37:31,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534930926] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:31,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:31,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:31,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544016616] [2025-02-08 05:37:31,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:31,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:31,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:31,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:31,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:31,432 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 381 out of 415 [2025-02-08 05:37:31,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 374 transitions, 764 flow. Second operand has 3 states, 3 states have (on average 382.3333333333333) internal successors, (1147), 3 states have internal predecessors, (1147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:31,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:31,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 381 of 415 [2025-02-08 05:37:31,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:31,581 INFO L124 PetriNetUnfolderBase]: 136/1441 cut-off events. [2025-02-08 05:37:31,581 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-02-08 05:37:31,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1605 conditions, 1441 events. 136/1441 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 10965 event pairs, 52 based on Foata normal form. 0/1199 useless extension candidates. Maximal degree in co-relation 1434. Up to 135 conditions per place. [2025-02-08 05:37:31,595 INFO L140 encePairwiseOnDemand]: 407/415 looper letters, 21 selfloop transitions, 2 changer transitions 0/372 dead transitions. [2025-02-08 05:37:31,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 372 transitions, 808 flow [2025-02-08 05:37:31,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:31,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:31,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2025-02-08 05:37:31,597 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2025-02-08 05:37:31,597 INFO L175 Difference]: Start difference. First operand has 364 places, 374 transitions, 764 flow. Second operand 3 states and 1172 transitions. [2025-02-08 05:37:31,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 372 transitions, 808 flow [2025-02-08 05:37:31,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 372 transitions, 808 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:31,601 INFO L231 Difference]: Finished difference. Result has 361 places, 370 transitions, 766 flow [2025-02-08 05:37:31,601 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=766, PETRI_PLACES=361, PETRI_TRANSITIONS=370} [2025-02-08 05:37:31,602 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -19 predicate places. [2025-02-08 05:37:31,602 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 370 transitions, 766 flow [2025-02-08 05:37:31,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 382.3333333333333) internal successors, (1147), 3 states have internal predecessors, (1147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:31,602 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:31,602 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] [2025-02-08 05:37:31,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:37:31,602 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-02-08 05:37:31,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:31,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1624747141, now seen corresponding path program 1 times [2025-02-08 05:37:31,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:31,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986119255] [2025-02-08 05:37:31,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:31,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:31,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-08 05:37:31,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-08 05:37:31,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:31,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:31,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:31,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:31,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986119255] [2025-02-08 05:37:31,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986119255] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:31,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:31,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:31,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486774972] [2025-02-08 05:37:31,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:31,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:31,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:31,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:31,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:31,657 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 381 out of 415 [2025-02-08 05:37:31,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 370 transitions, 766 flow. Second operand has 3 states, 3 states have (on average 382.6666666666667) internal successors, (1148), 3 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:31,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:31,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 381 of 415 [2025-02-08 05:37:31,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:31,945 INFO L124 PetriNetUnfolderBase]: 434/3858 cut-off events. [2025-02-08 05:37:31,945 INFO L125 PetriNetUnfolderBase]: For 57/78 co-relation queries the response was YES. [2025-02-08 05:37:31,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4331 conditions, 3858 events. 434/3858 cut-off events. For 57/78 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 39507 event pairs, 182 based on Foata normal form. 0/3234 useless extension candidates. Maximal degree in co-relation 3187. Up to 431 conditions per place. [2025-02-08 05:37:31,973 INFO L140 encePairwiseOnDemand]: 407/415 looper letters, 21 selfloop transitions, 2 changer transitions 0/368 dead transitions. [2025-02-08 05:37:31,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 368 transitions, 810 flow [2025-02-08 05:37:31,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:31,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:31,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2025-02-08 05:37:31,975 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2025-02-08 05:37:31,975 INFO L175 Difference]: Start difference. First operand has 361 places, 370 transitions, 766 flow. Second operand 3 states and 1172 transitions. [2025-02-08 05:37:31,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 368 transitions, 810 flow [2025-02-08 05:37:31,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 368 transitions, 810 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:31,979 INFO L231 Difference]: Finished difference. Result has 358 places, 366 transitions, 768 flow [2025-02-08 05:37:31,979 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=768, PETRI_PLACES=358, PETRI_TRANSITIONS=366} [2025-02-08 05:37:31,979 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -22 predicate places. [2025-02-08 05:37:31,980 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 366 transitions, 768 flow [2025-02-08 05:37:31,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 382.6666666666667) internal successors, (1148), 3 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:31,980 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:31,980 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:31,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:37:31,980 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-02-08 05:37:31,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:31,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1995796140, now seen corresponding path program 1 times [2025-02-08 05:37:31,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:31,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692817176] [2025-02-08 05:37:31,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:31,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:31,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-08 05:37:31,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-08 05:37:31,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:31,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:32,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:32,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:32,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692817176] [2025-02-08 05:37:32,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692817176] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:32,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:32,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:37:32,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219050075] [2025-02-08 05:37:32,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:32,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:32,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:32,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:32,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:32,035 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 393 out of 415 [2025-02-08 05:37:32,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 366 transitions, 768 flow. Second operand has 3 states, 3 states have (on average 394.3333333333333) internal successors, (1183), 3 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:32,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:32,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 393 of 415 [2025-02-08 05:37:32,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:32,146 INFO L124 PetriNetUnfolderBase]: 85/1220 cut-off events. [2025-02-08 05:37:32,146 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:37:32,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1323 conditions, 1220 events. 85/1220 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 9118 event pairs, 10 based on Foata normal form. 0/1040 useless extension candidates. Maximal degree in co-relation 1069. Up to 35 conditions per place. [2025-02-08 05:37:32,159 INFO L140 encePairwiseOnDemand]: 411/415 looper letters, 14 selfloop transitions, 3 changer transitions 0/370 dead transitions. [2025-02-08 05:37:32,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 370 transitions, 812 flow [2025-02-08 05:37:32,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:32,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:32,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1197 transitions. [2025-02-08 05:37:32,161 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9614457831325302 [2025-02-08 05:37:32,161 INFO L175 Difference]: Start difference. First operand has 358 places, 366 transitions, 768 flow. Second operand 3 states and 1197 transitions. [2025-02-08 05:37:32,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 370 transitions, 812 flow [2025-02-08 05:37:32,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 370 transitions, 812 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:32,165 INFO L231 Difference]: Finished difference. Result has 362 places, 368 transitions, 790 flow [2025-02-08 05:37:32,165 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=790, PETRI_PLACES=362, PETRI_TRANSITIONS=368} [2025-02-08 05:37:32,166 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -18 predicate places. [2025-02-08 05:37:32,166 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 368 transitions, 790 flow [2025-02-08 05:37:32,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 394.3333333333333) internal successors, (1183), 3 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:32,166 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:32,166 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:32,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:37:32,167 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-02-08 05:37:32,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:32,167 INFO L85 PathProgramCache]: Analyzing trace with hash 149416181, now seen corresponding path program 1 times [2025-02-08 05:37:32,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:32,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778100122] [2025-02-08 05:37:32,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:32,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:32,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-08 05:37:32,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-08 05:37:32,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:32,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:32,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:32,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:32,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778100122] [2025-02-08 05:37:32,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778100122] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:32,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:32,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:32,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466895620] [2025-02-08 05:37:32,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:32,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:32,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:32,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:32,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:32,221 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 415 [2025-02-08 05:37:32,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 368 transitions, 790 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:32,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:32,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 415 [2025-02-08 05:37:32,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:32,480 INFO L124 PetriNetUnfolderBase]: 181/2083 cut-off events. [2025-02-08 05:37:32,481 INFO L125 PetriNetUnfolderBase]: For 28/34 co-relation queries the response was YES. [2025-02-08 05:37:32,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2375 conditions, 2083 events. 181/2083 cut-off events. For 28/34 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 18198 event pairs, 16 based on Foata normal form. 1/1810 useless extension candidates. Maximal degree in co-relation 2003. Up to 166 conditions per place. [2025-02-08 05:37:32,501 INFO L140 encePairwiseOnDemand]: 407/415 looper letters, 20 selfloop transitions, 4 changer transitions 0/373 dead transitions. [2025-02-08 05:37:32,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 373 transitions, 853 flow [2025-02-08 05:37:32,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:32,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:32,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1189 transitions. [2025-02-08 05:37:32,503 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9550200803212852 [2025-02-08 05:37:32,503 INFO L175 Difference]: Start difference. First operand has 362 places, 368 transitions, 790 flow. Second operand 3 states and 1189 transitions. [2025-02-08 05:37:32,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 373 transitions, 853 flow [2025-02-08 05:37:32,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 373 transitions, 847 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:32,509 INFO L231 Difference]: Finished difference. Result has 359 places, 368 transitions, 804 flow [2025-02-08 05:37:32,509 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=776, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=804, PETRI_PLACES=359, PETRI_TRANSITIONS=368} [2025-02-08 05:37:32,509 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -21 predicate places. [2025-02-08 05:37:32,509 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 368 transitions, 804 flow [2025-02-08 05:37:32,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:32,510 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:32,510 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:32,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:37:32,511 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-02-08 05:37:32,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:32,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1855056794, now seen corresponding path program 1 times [2025-02-08 05:37:32,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:32,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18043791] [2025-02-08 05:37:32,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:32,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:32,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-08 05:37:32,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-08 05:37:32,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:32,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:32,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:32,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:32,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18043791] [2025-02-08 05:37:32,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18043791] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:32,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:32,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:32,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349726791] [2025-02-08 05:37:32,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:32,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:32,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:32,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:32,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:32,586 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 415 [2025-02-08 05:37:32,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 368 transitions, 804 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:32,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:32,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 415 [2025-02-08 05:37:32,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:32,956 INFO L124 PetriNetUnfolderBase]: 229/2778 cut-off events. [2025-02-08 05:37:32,956 INFO L125 PetriNetUnfolderBase]: For 34/65 co-relation queries the response was YES. [2025-02-08 05:37:32,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3114 conditions, 2778 events. 229/2778 cut-off events. For 34/65 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 24746 event pairs, 36 based on Foata normal form. 2/2406 useless extension candidates. Maximal degree in co-relation 2787. Up to 198 conditions per place. [2025-02-08 05:37:32,994 INFO L140 encePairwiseOnDemand]: 407/415 looper letters, 20 selfloop transitions, 4 changer transitions 0/373 dead transitions. [2025-02-08 05:37:32,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 373 transitions, 867 flow [2025-02-08 05:37:32,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:32,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:32,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1189 transitions. [2025-02-08 05:37:32,997 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9550200803212852 [2025-02-08 05:37:32,997 INFO L175 Difference]: Start difference. First operand has 359 places, 368 transitions, 804 flow. Second operand 3 states and 1189 transitions. [2025-02-08 05:37:32,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 373 transitions, 867 flow [2025-02-08 05:37:32,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 373 transitions, 867 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:33,001 INFO L231 Difference]: Finished difference. Result has 358 places, 368 transitions, 824 flow [2025-02-08 05:37:33,001 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=796, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=824, PETRI_PLACES=358, PETRI_TRANSITIONS=368} [2025-02-08 05:37:33,002 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -22 predicate places. [2025-02-08 05:37:33,002 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 368 transitions, 824 flow [2025-02-08 05:37:33,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:33,003 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:33,003 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:33,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:37:33,003 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-02-08 05:37:33,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:33,003 INFO L85 PathProgramCache]: Analyzing trace with hash 480643777, now seen corresponding path program 1 times [2025-02-08 05:37:33,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:33,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516115056] [2025-02-08 05:37:33,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:33,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:33,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-08 05:37:33,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-08 05:37:33,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:33,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:33,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:33,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:33,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516115056] [2025-02-08 05:37:33,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516115056] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:33,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:33,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:33,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245485014] [2025-02-08 05:37:33,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:33,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:33,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:33,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:33,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:33,074 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 415 [2025-02-08 05:37:33,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 368 transitions, 824 flow. Second operand has 3 states, 3 states have (on average 395.3333333333333) internal successors, (1186), 3 states have internal predecessors, (1186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:33,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:33,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 415 [2025-02-08 05:37:33,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:33,341 INFO L124 PetriNetUnfolderBase]: 209/2842 cut-off events. [2025-02-08 05:37:33,341 INFO L125 PetriNetUnfolderBase]: For 6/35 co-relation queries the response was YES. [2025-02-08 05:37:33,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3170 conditions, 2842 events. 209/2842 cut-off events. For 6/35 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 26667 event pairs, 14 based on Foata normal form. 4/2482 useless extension candidates. Maximal degree in co-relation 2843. Up to 62 conditions per place. [2025-02-08 05:37:33,376 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 11 selfloop transitions, 2 changer transitions 0/369 dead transitions. [2025-02-08 05:37:33,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 369 transitions, 854 flow [2025-02-08 05:37:33,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:33,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:33,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1196 transitions. [2025-02-08 05:37:33,379 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9606425702811245 [2025-02-08 05:37:33,379 INFO L175 Difference]: Start difference. First operand has 358 places, 368 transitions, 824 flow. Second operand 3 states and 1196 transitions. [2025-02-08 05:37:33,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 369 transitions, 854 flow [2025-02-08 05:37:33,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 369 transitions, 854 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:33,383 INFO L231 Difference]: Finished difference. Result has 359 places, 367 transitions, 826 flow [2025-02-08 05:37:33,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=826, PETRI_PLACES=359, PETRI_TRANSITIONS=367} [2025-02-08 05:37:33,384 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -21 predicate places. [2025-02-08 05:37:33,384 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 367 transitions, 826 flow [2025-02-08 05:37:33,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 395.3333333333333) internal successors, (1186), 3 states have internal predecessors, (1186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:33,385 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:33,385 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] [2025-02-08 05:37:33,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:37:33,385 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-02-08 05:37:33,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:33,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1720558413, now seen corresponding path program 1 times [2025-02-08 05:37:33,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:33,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430295846] [2025-02-08 05:37:33,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:33,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:33,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-08 05:37:33,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-08 05:37:33,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:33,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:33,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:33,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:33,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430295846] [2025-02-08 05:37:33,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430295846] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:33,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:33,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:37:33,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899629574] [2025-02-08 05:37:33,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:33,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:33,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:33,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:33,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:33,423 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 393 out of 415 [2025-02-08 05:37:33,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 367 transitions, 826 flow. Second operand has 3 states, 3 states have (on average 394.6666666666667) internal successors, (1184), 3 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:33,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:33,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 393 of 415 [2025-02-08 05:37:33,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:33,726 INFO L124 PetriNetUnfolderBase]: 231/2803 cut-off events. [2025-02-08 05:37:33,727 INFO L125 PetriNetUnfolderBase]: For 27/76 co-relation queries the response was YES. [2025-02-08 05:37:33,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3221 conditions, 2803 events. 231/2803 cut-off events. For 27/76 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 26494 event pairs, 42 based on Foata normal form. 0/2434 useless extension candidates. Maximal degree in co-relation 2795. Up to 136 conditions per place. [2025-02-08 05:37:33,760 INFO L140 encePairwiseOnDemand]: 411/415 looper letters, 14 selfloop transitions, 3 changer transitions 0/371 dead transitions. [2025-02-08 05:37:33,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 371 transitions, 870 flow [2025-02-08 05:37:33,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:33,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:33,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1197 transitions. [2025-02-08 05:37:33,762 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9614457831325302 [2025-02-08 05:37:33,762 INFO L175 Difference]: Start difference. First operand has 359 places, 367 transitions, 826 flow. Second operand 3 states and 1197 transitions. [2025-02-08 05:37:33,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 371 transitions, 870 flow [2025-02-08 05:37:33,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 371 transitions, 866 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:33,766 INFO L231 Difference]: Finished difference. Result has 361 places, 369 transitions, 844 flow [2025-02-08 05:37:33,767 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=844, PETRI_PLACES=361, PETRI_TRANSITIONS=369} [2025-02-08 05:37:33,767 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -19 predicate places. [2025-02-08 05:37:33,767 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 369 transitions, 844 flow [2025-02-08 05:37:33,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 394.6666666666667) internal successors, (1184), 3 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:33,768 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:33,768 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] [2025-02-08 05:37:33,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:37:33,768 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-02-08 05:37:33,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:33,769 INFO L85 PathProgramCache]: Analyzing trace with hash 2115516154, now seen corresponding path program 1 times [2025-02-08 05:37:33,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:33,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660708375] [2025-02-08 05:37:33,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:33,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:33,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-08 05:37:33,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-08 05:37:33,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:33,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:33,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:33,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:33,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660708375] [2025-02-08 05:37:33,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660708375] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:33,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:33,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:33,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137947210] [2025-02-08 05:37:33,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:33,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:33,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:33,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:33,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:33,813 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 393 out of 415 [2025-02-08 05:37:33,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 369 transitions, 844 flow. Second operand has 3 states, 3 states have (on average 394.6666666666667) internal successors, (1184), 3 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:33,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:33,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 393 of 415 [2025-02-08 05:37:33,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:34,230 INFO L124 PetriNetUnfolderBase]: 355/4024 cut-off events. [2025-02-08 05:37:34,230 INFO L125 PetriNetUnfolderBase]: For 60/116 co-relation queries the response was YES. [2025-02-08 05:37:34,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4674 conditions, 4024 events. 355/4024 cut-off events. For 60/116 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 40818 event pairs, 32 based on Foata normal form. 2/3537 useless extension candidates. Maximal degree in co-relation 3711. Up to 132 conditions per place. [2025-02-08 05:37:34,268 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 12 selfloop transitions, 2 changer transitions 0/370 dead transitions. [2025-02-08 05:37:34,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 370 transitions, 876 flow [2025-02-08 05:37:34,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:34,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:34,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1194 transitions. [2025-02-08 05:37:34,271 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9590361445783132 [2025-02-08 05:37:34,271 INFO L175 Difference]: Start difference. First operand has 361 places, 369 transitions, 844 flow. Second operand 3 states and 1194 transitions. [2025-02-08 05:37:34,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 370 transitions, 876 flow [2025-02-08 05:37:34,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 370 transitions, 870 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:34,275 INFO L231 Difference]: Finished difference. Result has 360 places, 368 transitions, 840 flow [2025-02-08 05:37:34,275 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=840, PETRI_PLACES=360, PETRI_TRANSITIONS=368} [2025-02-08 05:37:34,276 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -20 predicate places. [2025-02-08 05:37:34,276 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 368 transitions, 840 flow [2025-02-08 05:37:34,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 394.6666666666667) internal successors, (1184), 3 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:34,277 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:34,277 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] [2025-02-08 05:37:34,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:37:34,277 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-02-08 05:37:34,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:34,278 INFO L85 PathProgramCache]: Analyzing trace with hash -805038125, now seen corresponding path program 1 times [2025-02-08 05:37:34,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:34,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632252996] [2025-02-08 05:37:34,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:34,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:34,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-08 05:37:34,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-08 05:37:34,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:34,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:34,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:34,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:34,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632252996] [2025-02-08 05:37:34,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632252996] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:34,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:34,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:34,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516614652] [2025-02-08 05:37:34,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:34,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:34,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:34,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:34,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:34,340 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 415 [2025-02-08 05:37:34,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 368 transitions, 840 flow. Second operand has 3 states, 3 states have (on average 388.6666666666667) internal successors, (1166), 3 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:34,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:34,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 415 [2025-02-08 05:37:34,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:34,938 INFO L124 PetriNetUnfolderBase]: 574/5469 cut-off events. [2025-02-08 05:37:34,938 INFO L125 PetriNetUnfolderBase]: For 74/82 co-relation queries the response was YES. [2025-02-08 05:37:34,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6502 conditions, 5469 events. 574/5469 cut-off events. For 74/82 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 60278 event pairs, 68 based on Foata normal form. 1/4892 useless extension candidates. Maximal degree in co-relation 5607. Up to 585 conditions per place. [2025-02-08 05:37:34,991 INFO L140 encePairwiseOnDemand]: 407/415 looper letters, 19 selfloop transitions, 4 changer transitions 0/372 dead transitions. [2025-02-08 05:37:34,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 372 transitions, 898 flow [2025-02-08 05:37:34,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:34,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:34,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1188 transitions. [2025-02-08 05:37:34,997 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9542168674698795 [2025-02-08 05:37:34,997 INFO L175 Difference]: Start difference. First operand has 360 places, 368 transitions, 840 flow. Second operand 3 states and 1188 transitions. [2025-02-08 05:37:34,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 372 transitions, 898 flow [2025-02-08 05:37:35,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 372 transitions, 894 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:35,013 INFO L231 Difference]: Finished difference. Result has 357 places, 368 transitions, 856 flow [2025-02-08 05:37:35,017 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=856, PETRI_PLACES=357, PETRI_TRANSITIONS=368} [2025-02-08 05:37:35,017 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -23 predicate places. [2025-02-08 05:37:35,017 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 368 transitions, 856 flow [2025-02-08 05:37:35,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.6666666666667) internal successors, (1166), 3 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:35,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:35,018 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] [2025-02-08 05:37:35,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:37:35,019 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-02-08 05:37:35,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:35,019 INFO L85 PathProgramCache]: Analyzing trace with hash 602723531, now seen corresponding path program 1 times [2025-02-08 05:37:35,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:35,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061894778] [2025-02-08 05:37:35,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:35,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:35,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-08 05:37:35,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-08 05:37:35,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:35,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:35,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:35,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:35,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061894778] [2025-02-08 05:37:35,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061894778] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:35,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:35,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:37:35,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942035052] [2025-02-08 05:37:35,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:35,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:35,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:35,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:35,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:35,068 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 393 out of 415 [2025-02-08 05:37:35,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 368 transitions, 856 flow. Second operand has 3 states, 3 states have (on average 395.0) internal successors, (1185), 3 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:35,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:35,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 393 of 415 [2025-02-08 05:37:35,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:35,542 INFO L124 PetriNetUnfolderBase]: 376/3768 cut-off events. [2025-02-08 05:37:35,543 INFO L125 PetriNetUnfolderBase]: For 107/136 co-relation queries the response was YES. [2025-02-08 05:37:35,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4583 conditions, 3768 events. 376/3768 cut-off events. For 107/136 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 37217 event pairs, 64 based on Foata normal form. 2/3325 useless extension candidates. Maximal degree in co-relation 4026. Up to 287 conditions per place. [2025-02-08 05:37:35,584 INFO L140 encePairwiseOnDemand]: 411/415 looper letters, 14 selfloop transitions, 3 changer transitions 0/372 dead transitions. [2025-02-08 05:37:35,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 372 transitions, 900 flow [2025-02-08 05:37:35,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:35,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:35,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1197 transitions. [2025-02-08 05:37:35,591 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9614457831325302 [2025-02-08 05:37:35,591 INFO L175 Difference]: Start difference. First operand has 357 places, 368 transitions, 856 flow. Second operand 3 states and 1197 transitions. [2025-02-08 05:37:35,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 372 transitions, 900 flow [2025-02-08 05:37:35,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 372 transitions, 900 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:35,598 INFO L231 Difference]: Finished difference. Result has 361 places, 370 transitions, 878 flow [2025-02-08 05:37:35,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=856, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=878, PETRI_PLACES=361, PETRI_TRANSITIONS=370} [2025-02-08 05:37:35,599 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -19 predicate places. [2025-02-08 05:37:35,599 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 370 transitions, 878 flow [2025-02-08 05:37:35,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 395.0) internal successors, (1185), 3 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:35,603 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:35,603 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] [2025-02-08 05:37:35,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:37:35,604 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-02-08 05:37:35,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:35,604 INFO L85 PathProgramCache]: Analyzing trace with hash 764491832, now seen corresponding path program 1 times [2025-02-08 05:37:35,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:35,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095520377] [2025-02-08 05:37:35,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:35,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:35,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-08 05:37:35,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-08 05:37:35,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:35,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:35,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:35,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:35,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095520377] [2025-02-08 05:37:35,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095520377] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:35,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:35,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:35,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12528499] [2025-02-08 05:37:35,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:35,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:35,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:35,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:35,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:35,653 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 393 out of 415 [2025-02-08 05:37:35,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 370 transitions, 878 flow. Second operand has 3 states, 3 states have (on average 395.0) internal successors, (1185), 3 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:35,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:35,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 393 of 415 [2025-02-08 05:37:35,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:35,918 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1047] L56-10-->L56-9: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet24#1=|v_thread3Thread1of1ForFork0_#t~nondet24#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet24#1][255], [424#(= |#race~sort_label_is_null_1~0| 0), 462#true, 428#(= |#race~sort_label_is_null_3~0| 0), Black: 452#(not |thread2Thread1of1ForFork1_#t~short11#1|), Black: 422#true, 467#true, Black: 458#true, Black: 426#true, 460#(= |#race~sort_label_4~0| 0), Black: 430#true, Black: 464#(not |thread3Thread1of1ForFork0_#t~short19#1|), 432#(= |#race~sort_label_is_null_5~0| 0), Black: 436#(not |thread1Thread1of1ForFork2_#t~short3#1|), 445#(= |#race~sort_label_2~0| 0), 135#L77true, Black: 439#true, 93#L56-9true, Black: 443#true, 441#(= |#race~sort_label_0~0| 0)]) [2025-02-08 05:37:35,918 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is cut-off event [2025-02-08 05:37:35,919 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2025-02-08 05:37:35,919 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2025-02-08 05:37:35,919 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2025-02-08 05:37:35,931 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1047] L56-10-->L56-9: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet24#1=|v_thread3Thread1of1ForFork0_#t~nondet24#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet24#1][255], [424#(= |#race~sort_label_is_null_1~0| 0), 428#(= |#race~sort_label_is_null_3~0| 0), Black: 452#(not |thread2Thread1of1ForFork1_#t~short11#1|), Black: 422#true, 467#true, Black: 458#true, Black: 426#true, 460#(= |#race~sort_label_4~0| 0), Black: 430#true, Black: 462#true, 432#(= |#race~sort_label_is_null_5~0| 0), Black: 436#(not |thread1Thread1of1ForFork2_#t~short3#1|), 445#(= |#race~sort_label_2~0| 0), 135#L77true, Black: 439#true, 464#(not |thread3Thread1of1ForFork0_#t~short19#1|), 93#L56-9true, Black: 443#true, 441#(= |#race~sort_label_0~0| 0)]) [2025-02-08 05:37:35,931 INFO L294 olderBase$Statistics]: this new event has 173 ancestors and is not cut-off event [2025-02-08 05:37:35,931 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is not cut-off event [2025-02-08 05:37:35,932 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is not cut-off event [2025-02-08 05:37:35,932 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is not cut-off event [2025-02-08 05:37:35,940 INFO L124 PetriNetUnfolderBase]: 363/3105 cut-off events. [2025-02-08 05:37:35,940 INFO L125 PetriNetUnfolderBase]: For 208/236 co-relation queries the response was YES. [2025-02-08 05:37:35,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4157 conditions, 3105 events. 363/3105 cut-off events. For 208/236 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 29891 event pairs, 48 based on Foata normal form. 2/2841 useless extension candidates. Maximal degree in co-relation 3575. Up to 248 conditions per place. [2025-02-08 05:37:35,976 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 12 selfloop transitions, 2 changer transitions 0/371 dead transitions. [2025-02-08 05:37:35,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 371 transitions, 910 flow [2025-02-08 05:37:35,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:35,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:35,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1194 transitions. [2025-02-08 05:37:35,978 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9590361445783132 [2025-02-08 05:37:35,978 INFO L175 Difference]: Start difference. First operand has 361 places, 370 transitions, 878 flow. Second operand 3 states and 1194 transitions. [2025-02-08 05:37:35,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 371 transitions, 910 flow [2025-02-08 05:37:35,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 371 transitions, 904 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:35,982 INFO L231 Difference]: Finished difference. Result has 360 places, 369 transitions, 874 flow [2025-02-08 05:37:35,983 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=874, PETRI_PLACES=360, PETRI_TRANSITIONS=369} [2025-02-08 05:37:35,983 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -20 predicate places. [2025-02-08 05:37:35,983 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 369 transitions, 874 flow [2025-02-08 05:37:35,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 395.0) internal successors, (1185), 3 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:35,984 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:35,984 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:37:35,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:37:35,984 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-02-08 05:37:35,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:35,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1810296452, now seen corresponding path program 1 times [2025-02-08 05:37:35,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:35,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795586775] [2025-02-08 05:37:35,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:35,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:35,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-08 05:37:36,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-08 05:37:36,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:36,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:36,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:36,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:36,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795586775] [2025-02-08 05:37:36,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795586775] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:36,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:36,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:36,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200924256] [2025-02-08 05:37:36,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:36,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:36,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:36,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:36,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:36,037 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 396 out of 415 [2025-02-08 05:37:36,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 369 transitions, 874 flow. Second operand has 3 states, 3 states have (on average 399.0) internal successors, (1197), 3 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:36,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:36,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 396 of 415 [2025-02-08 05:37:36,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:36,510 INFO L124 PetriNetUnfolderBase]: 343/4516 cut-off events. [2025-02-08 05:37:36,511 INFO L125 PetriNetUnfolderBase]: For 7/17 co-relation queries the response was YES. [2025-02-08 05:37:36,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5512 conditions, 4516 events. 343/4516 cut-off events. For 7/17 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 47888 event pairs, 11 based on Foata normal form. 0/4130 useless extension candidates. Maximal degree in co-relation 4955. Up to 210 conditions per place. [2025-02-08 05:37:36,549 INFO L140 encePairwiseOnDemand]: 413/415 looper letters, 8 selfloop transitions, 1 changer transitions 0/368 dead transitions. [2025-02-08 05:37:36,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 368 transitions, 890 flow [2025-02-08 05:37:36,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:36,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:36,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1198 transitions. [2025-02-08 05:37:36,551 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9622489959839358 [2025-02-08 05:37:36,551 INFO L175 Difference]: Start difference. First operand has 360 places, 369 transitions, 874 flow. Second operand 3 states and 1198 transitions. [2025-02-08 05:37:36,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 368 transitions, 890 flow [2025-02-08 05:37:36,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 368 transitions, 886 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:36,558 INFO L231 Difference]: Finished difference. Result has 359 places, 368 transitions, 870 flow [2025-02-08 05:37:36,559 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=868, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=870, PETRI_PLACES=359, PETRI_TRANSITIONS=368} [2025-02-08 05:37:36,559 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -21 predicate places. [2025-02-08 05:37:36,559 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 368 transitions, 870 flow [2025-02-08 05:37:36,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 399.0) internal successors, (1197), 3 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:36,560 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:36,560 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:36,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:37:36,560 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-02-08 05:37:36,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:36,561 INFO L85 PathProgramCache]: Analyzing trace with hash -20043352, now seen corresponding path program 1 times [2025-02-08 05:37:36,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:36,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891681116] [2025-02-08 05:37:36,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:36,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:36,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-08 05:37:36,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-08 05:37:36,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:36,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:36,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:36,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:36,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891681116] [2025-02-08 05:37:36,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891681116] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:36,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:36,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:36,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106909709] [2025-02-08 05:37:36,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:36,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:36,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:36,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:36,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:36,612 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 393 out of 415 [2025-02-08 05:37:36,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 368 transitions, 870 flow. Second operand has 3 states, 3 states have (on average 396.0) internal successors, (1188), 3 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:36,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:36,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 393 of 415 [2025-02-08 05:37:36,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:37,152 INFO L124 PetriNetUnfolderBase]: 398/5097 cut-off events. [2025-02-08 05:37:37,153 INFO L125 PetriNetUnfolderBase]: For 11/35 co-relation queries the response was YES. [2025-02-08 05:37:37,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6117 conditions, 5097 events. 398/5097 cut-off events. For 11/35 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 55798 event pairs, 25 based on Foata normal form. 0/4667 useless extension candidates. Maximal degree in co-relation 5985. Up to 193 conditions per place. [2025-02-08 05:37:37,186 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 10 selfloop transitions, 1 changer transitions 0/366 dead transitions. [2025-02-08 05:37:37,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 366 transitions, 888 flow [2025-02-08 05:37:37,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:37,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:37,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1192 transitions. [2025-02-08 05:37:37,188 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.957429718875502 [2025-02-08 05:37:37,188 INFO L175 Difference]: Start difference. First operand has 359 places, 368 transitions, 870 flow. Second operand 3 states and 1192 transitions. [2025-02-08 05:37:37,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 366 transitions, 888 flow [2025-02-08 05:37:37,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 366 transitions, 887 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:37,193 INFO L231 Difference]: Finished difference. Result has 358 places, 366 transitions, 867 flow [2025-02-08 05:37:37,193 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=865, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=867, PETRI_PLACES=358, PETRI_TRANSITIONS=366} [2025-02-08 05:37:37,194 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -22 predicate places. [2025-02-08 05:37:37,194 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 366 transitions, 867 flow [2025-02-08 05:37:37,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 396.0) internal successors, (1188), 3 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:37,195 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:37,195 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:37,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 05:37:37,195 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-02-08 05:37:37,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:37,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1911066950, now seen corresponding path program 1 times [2025-02-08 05:37:37,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:37,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732083390] [2025-02-08 05:37:37,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:37,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:37,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-02-08 05:37:37,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-02-08 05:37:37,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:37,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:37,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:37,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:37,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732083390] [2025-02-08 05:37:37,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732083390] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:37,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:37,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:37,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11758422] [2025-02-08 05:37:37,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:37,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:37,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:37,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:37,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:37,261 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 393 out of 415 [2025-02-08 05:37:37,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 366 transitions, 867 flow. Second operand has 3 states, 3 states have (on average 396.0) internal successors, (1188), 3 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:37,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:37,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 393 of 415 [2025-02-08 05:37:37,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:37,562 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1052] L56-9-->L56-7: Formula: (= |v_#race~result_8~0_3| |v_thread3Thread1of1ForFork0_#t~nondet24#1_3|) InVars {thread3Thread1of1ForFork0_#t~nondet24#1=|v_thread3Thread1of1ForFork0_#t~nondet24#1_3|} OutVars{thread3Thread1of1ForFork0_#t~nondet24#1=|v_thread3Thread1of1ForFork0_#t~nondet24#1_3|, #race~result_8~0=|v_#race~result_8~0_3|} AuxVars[] AssignedVars[#race~result_8~0][267], [424#(= |#race~sort_label_is_null_1~0| 0), 33#L56-7true, 428#(= |#race~sort_label_is_null_3~0| 0), Black: 452#(not |thread2Thread1of1ForFork1_#t~short11#1|), Black: 422#true, Black: 426#true, Black: 458#true, 473#true, 460#(= |#race~sort_label_4~0| 0), Black: 430#true, Black: 464#(not |thread3Thread1of1ForFork0_#t~short19#1|), 432#(= |#race~sort_label_is_null_5~0| 0), Black: 436#(not |thread1Thread1of1ForFork2_#t~short3#1|), 445#(= |#race~sort_label_2~0| 0), 135#L77true, Black: 439#true, Black: 443#true, 476#true, 441#(= |#race~sort_label_0~0| 0)]) [2025-02-08 05:37:37,562 INFO L294 olderBase$Statistics]: this new event has 177 ancestors and is cut-off event [2025-02-08 05:37:37,562 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is cut-off event [2025-02-08 05:37:37,563 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is cut-off event [2025-02-08 05:37:37,563 INFO L297 olderBase$Statistics]: existing Event has 182 ancestors and is cut-off event [2025-02-08 05:37:37,567 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1052] L56-9-->L56-7: Formula: (= |v_#race~result_8~0_3| |v_thread3Thread1of1ForFork0_#t~nondet24#1_3|) InVars {thread3Thread1of1ForFork0_#t~nondet24#1=|v_thread3Thread1of1ForFork0_#t~nondet24#1_3|} OutVars{thread3Thread1of1ForFork0_#t~nondet24#1=|v_thread3Thread1of1ForFork0_#t~nondet24#1_3|, #race~result_8~0=|v_#race~result_8~0_3|} AuxVars[] AssignedVars[#race~result_8~0][267], [424#(= |#race~sort_label_is_null_1~0| 0), 33#L56-7true, 428#(= |#race~sort_label_is_null_3~0| 0), Black: 452#(not |thread2Thread1of1ForFork1_#t~short11#1|), Black: 422#true, Black: 426#true, Black: 458#true, 473#true, 460#(= |#race~sort_label_4~0| 0), Black: 430#true, Black: 462#true, 432#(= |#race~sort_label_is_null_5~0| 0), Black: 436#(not |thread1Thread1of1ForFork2_#t~short3#1|), 445#(= |#race~sort_label_2~0| 0), 135#L77true, Black: 439#true, Black: 443#true, 476#true, 441#(= |#race~sort_label_0~0| 0)]) [2025-02-08 05:37:37,567 INFO L294 olderBase$Statistics]: this new event has 174 ancestors and is not cut-off event [2025-02-08 05:37:37,567 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is not cut-off event [2025-02-08 05:37:37,567 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is not cut-off event [2025-02-08 05:37:37,567 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is not cut-off event [2025-02-08 05:37:37,573 INFO L124 PetriNetUnfolderBase]: 256/2844 cut-off events. [2025-02-08 05:37:37,573 INFO L125 PetriNetUnfolderBase]: For 38/52 co-relation queries the response was YES. [2025-02-08 05:37:37,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3507 conditions, 2844 events. 256/2844 cut-off events. For 38/52 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 26390 event pairs, 33 based on Foata normal form. 5/2594 useless extension candidates. Maximal degree in co-relation 3430. Up to 150 conditions per place. [2025-02-08 05:37:37,603 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 0 selfloop transitions, 0 changer transitions 364/364 dead transitions. [2025-02-08 05:37:37,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 364 transitions, 883 flow [2025-02-08 05:37:37,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:37,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:37,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1191 transitions. [2025-02-08 05:37:37,605 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9566265060240964 [2025-02-08 05:37:37,605 INFO L175 Difference]: Start difference. First operand has 358 places, 366 transitions, 867 flow. Second operand 3 states and 1191 transitions. [2025-02-08 05:37:37,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 364 transitions, 883 flow [2025-02-08 05:37:37,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 364 transitions, 882 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:37,608 INFO L231 Difference]: Finished difference. Result has 357 places, 0 transitions, 0 flow [2025-02-08 05:37:37,608 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=862, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=357, PETRI_TRANSITIONS=0} [2025-02-08 05:37:37,609 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -23 predicate places. [2025-02-08 05:37:37,609 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 0 transitions, 0 flow [2025-02-08 05:37:37,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 396.0) internal successors, (1188), 3 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:37,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (79 of 80 remaining) [2025-02-08 05:37:37,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (78 of 80 remaining) [2025-02-08 05:37:37,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (77 of 80 remaining) [2025-02-08 05:37:37,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (76 of 80 remaining) [2025-02-08 05:37:37,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (75 of 80 remaining) [2025-02-08 05:37:37,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (74 of 80 remaining) [2025-02-08 05:37:37,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (73 of 80 remaining) [2025-02-08 05:37:37,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (72 of 80 remaining) [2025-02-08 05:37:37,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (71 of 80 remaining) [2025-02-08 05:37:37,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (70 of 80 remaining) [2025-02-08 05:37:37,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (69 of 80 remaining) [2025-02-08 05:37:37,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (68 of 80 remaining) [2025-02-08 05:37:37,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (67 of 80 remaining) [2025-02-08 05:37:37,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (66 of 80 remaining) [2025-02-08 05:37:37,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (65 of 80 remaining) [2025-02-08 05:37:37,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (64 of 80 remaining) [2025-02-08 05:37:37,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (63 of 80 remaining) [2025-02-08 05:37:37,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (62 of 80 remaining) [2025-02-08 05:37:37,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (61 of 80 remaining) [2025-02-08 05:37:37,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (60 of 80 remaining) [2025-02-08 05:37:37,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (59 of 80 remaining) [2025-02-08 05:37:37,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (58 of 80 remaining) [2025-02-08 05:37:37,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (57 of 80 remaining) [2025-02-08 05:37:37,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (56 of 80 remaining) [2025-02-08 05:37:37,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (55 of 80 remaining) [2025-02-08 05:37:37,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (54 of 80 remaining) [2025-02-08 05:37:37,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (53 of 80 remaining) [2025-02-08 05:37:37,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (52 of 80 remaining) [2025-02-08 05:37:37,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (51 of 80 remaining) [2025-02-08 05:37:37,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (50 of 80 remaining) [2025-02-08 05:37:37,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (49 of 80 remaining) [2025-02-08 05:37:37,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (48 of 80 remaining) [2025-02-08 05:37:37,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (47 of 80 remaining) [2025-02-08 05:37:37,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (46 of 80 remaining) [2025-02-08 05:37:37,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (45 of 80 remaining) [2025-02-08 05:37:37,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (44 of 80 remaining) [2025-02-08 05:37:37,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (43 of 80 remaining) [2025-02-08 05:37:37,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (42 of 80 remaining) [2025-02-08 05:37:37,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (41 of 80 remaining) [2025-02-08 05:37:37,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (40 of 80 remaining) [2025-02-08 05:37:37,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (39 of 80 remaining) [2025-02-08 05:37:37,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (38 of 80 remaining) [2025-02-08 05:37:37,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (37 of 80 remaining) [2025-02-08 05:37:37,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (36 of 80 remaining) [2025-02-08 05:37:37,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 80 remaining) [2025-02-08 05:37:37,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 80 remaining) [2025-02-08 05:37:37,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 80 remaining) [2025-02-08 05:37:37,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (32 of 80 remaining) [2025-02-08 05:37:37,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (31 of 80 remaining) [2025-02-08 05:37:37,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (30 of 80 remaining) [2025-02-08 05:37:37,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (29 of 80 remaining) [2025-02-08 05:37:37,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (28 of 80 remaining) [2025-02-08 05:37:37,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (27 of 80 remaining) [2025-02-08 05:37:37,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (26 of 80 remaining) [2025-02-08 05:37:37,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (25 of 80 remaining) [2025-02-08 05:37:37,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (24 of 80 remaining) [2025-02-08 05:37:37,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (23 of 80 remaining) [2025-02-08 05:37:37,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (22 of 80 remaining) [2025-02-08 05:37:37,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (21 of 80 remaining) [2025-02-08 05:37:37,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (20 of 80 remaining) [2025-02-08 05:37:37,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (19 of 80 remaining) [2025-02-08 05:37:37,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (18 of 80 remaining) [2025-02-08 05:37:37,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (17 of 80 remaining) [2025-02-08 05:37:37,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (16 of 80 remaining) [2025-02-08 05:37:37,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (15 of 80 remaining) [2025-02-08 05:37:37,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (14 of 80 remaining) [2025-02-08 05:37:37,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (13 of 80 remaining) [2025-02-08 05:37:37,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (12 of 80 remaining) [2025-02-08 05:37:37,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (11 of 80 remaining) [2025-02-08 05:37:37,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (10 of 80 remaining) [2025-02-08 05:37:37,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (9 of 80 remaining) [2025-02-08 05:37:37,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (8 of 80 remaining) [2025-02-08 05:37:37,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (7 of 80 remaining) [2025-02-08 05:37:37,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (6 of 80 remaining) [2025-02-08 05:37:37,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (5 of 80 remaining) [2025-02-08 05:37:37,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (4 of 80 remaining) [2025-02-08 05:37:37,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (3 of 80 remaining) [2025-02-08 05:37:37,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 80 remaining) [2025-02-08 05:37:37,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (1 of 80 remaining) [2025-02-08 05:37:37,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (0 of 80 remaining) [2025-02-08 05:37:37,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 05:37:37,617 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:37,622 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:37:37,622 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:37:37,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:37:37 BasicIcfg [2025-02-08 05:37:37,627 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:37:37,628 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:37:37,628 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:37:37,628 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:37:37,630 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:28" (3/4) ... [2025-02-08 05:37:37,631 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:37:37,633 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:37:37,633 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:37:37,633 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 05:37:37,637 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-02-08 05:37:37,637 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:37:37,638 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:37:37,638 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:37:37,708 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:37:37,708 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:37:37,708 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:37:37,709 INFO L158 Benchmark]: Toolchain (without parser) took 9645.86ms. Allocated memory was 201.3MB in the beginning and 788.5MB in the end (delta: 587.2MB). Free memory was 154.5MB in the beginning and 422.3MB in the end (delta: -267.7MB). Peak memory consumption was 318.9MB. Max. memory is 16.1GB. [2025-02-08 05:37:37,709 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:37:37,710 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.63ms. Allocated memory is still 201.3MB. Free memory was 154.5MB in the beginning and 141.9MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:37,710 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.30ms. Allocated memory is still 201.3MB. Free memory was 141.9MB in the beginning and 139.8MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:37,710 INFO L158 Benchmark]: Boogie Preprocessor took 16.08ms. Allocated memory is still 201.3MB. Free memory was 139.8MB in the beginning and 138.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:37:37,711 INFO L158 Benchmark]: IcfgBuilder took 597.91ms. Allocated memory is still 201.3MB. Free memory was 138.3MB in the beginning and 109.9MB in the end (delta: 28.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 05:37:37,711 INFO L158 Benchmark]: TraceAbstraction took 8681.45ms. Allocated memory was 201.3MB in the beginning and 788.5MB in the end (delta: 587.2MB). Free memory was 109.3MB in the beginning and 430.6MB in the end (delta: -321.3MB). Peak memory consumption was 268.6MB. Max. memory is 16.1GB. [2025-02-08 05:37:37,711 INFO L158 Benchmark]: Witness Printer took 80.53ms. Allocated memory is still 788.5MB. Free memory was 430.6MB in the beginning and 422.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:37,713 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.21ms. Allocated memory is still 201.3MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 233.63ms. Allocated memory is still 201.3MB. Free memory was 154.5MB in the beginning and 141.9MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.30ms. Allocated memory is still 201.3MB. Free memory was 141.9MB in the beginning and 139.8MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 16.08ms. Allocated memory is still 201.3MB. Free memory was 139.8MB in the beginning and 138.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 597.91ms. Allocated memory is still 201.3MB. Free memory was 138.3MB in the beginning and 109.9MB in the end (delta: 28.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8681.45ms. Allocated memory was 201.3MB in the beginning and 788.5MB in the end (delta: 587.2MB). Free memory was 109.3MB in the beginning and 430.6MB in the end (delta: -321.3MB). Peak memory consumption was 268.6MB. Max. memory is 16.1GB. * Witness Printer took 80.53ms. Allocated memory is still 788.5MB. Free memory was 430.6MB in the beginning and 422.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 650 locations, 80 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: 8.5s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 612 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 193 mSDsluCounter, 126 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 125 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 631 IncrementalHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 125 mSolverCounterUnsat, 126 mSDtfsCounter, 631 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=878occurred in iteration=17, InterpolantAutomatonStates: 63, 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.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1874 NumberOfCodeBlocks, 1874 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1853 ConstructedInterpolants, 0 QuantifiedInterpolants, 1892 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 44 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:37:37,732 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