./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-name-comparator-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-name-comparator-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 3855d6da0b439f4c6a497e897f140f408df8c7fd65e3042f0fafae1979048a3d --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:37:38,250 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:37:38,315 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:38,320 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:37:38,321 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:37:38,342 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:37:38,345 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:37:38,345 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:37:38,345 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:37:38,345 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:37:38,346 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:37:38,346 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:37:38,346 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:37:38,346 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:37:38,346 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:37:38,346 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:37:38,346 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:37:38,346 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:37:38,346 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:37:38,346 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:37:38,346 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:37:38,346 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:37:38,346 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:37:38,346 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:37:38,346 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:37:38,346 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:37:38,347 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:37:38,347 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:37:38,347 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:37:38,347 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:37:38,347 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:37:38,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:37:38,347 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:37:38,347 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:37:38,347 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:37:38,347 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:37:38,347 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:37:38,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:37:38,347 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:37:38,347 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:37:38,347 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:37:38,347 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:37:38,347 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 -> 3855d6da0b439f4c6a497e897f140f408df8c7fd65e3042f0fafae1979048a3d [2025-02-08 05:37:38,559 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:37:38,564 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:37:38,565 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:37:38,566 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:37:38,567 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:37:38,567 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-name-comparator-subst.wvr.c [2025-02-08 05:37:39,676 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4ff0df14a/ebedde15bfbf4136ae6aab9e89c66255/FLAGb614319ff [2025-02-08 05:37:39,984 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:37:39,986 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-name-comparator-subst.wvr.c [2025-02-08 05:37:39,995 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4ff0df14a/ebedde15bfbf4136ae6aab9e89c66255/FLAGb614319ff [2025-02-08 05:37:40,263 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4ff0df14a/ebedde15bfbf4136ae6aab9e89c66255 [2025-02-08 05:37:40,265 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:37:40,266 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:37:40,267 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:40,267 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:37:40,270 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:37:40,270 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:40" (1/1) ... [2025-02-08 05:37:40,271 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1503bc87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:40, skipping insertion in model container [2025-02-08 05:37:40,271 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:40" (1/1) ... [2025-02-08 05:37:40,284 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:37:40,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:40,459 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:37:40,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:40,527 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:37:40,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:40 WrapperNode [2025-02-08 05:37:40,529 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:40,529 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:40,530 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:37:40,530 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:37:40,534 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:40" (1/1) ... [2025-02-08 05:37:40,547 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:40" (1/1) ... [2025-02-08 05:37:40,586 INFO L138 Inliner]: procedures = 25, calls = 30, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 842 [2025-02-08 05:37:40,586 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:40,587 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:37:40,587 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:37:40,587 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:37:40,592 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:40" (1/1) ... [2025-02-08 05:37:40,592 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:40" (1/1) ... [2025-02-08 05:37:40,599 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:40" (1/1) ... [2025-02-08 05:37:40,599 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:40" (1/1) ... [2025-02-08 05:37:40,609 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:40" (1/1) ... [2025-02-08 05:37:40,612 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:40" (1/1) ... [2025-02-08 05:37:40,617 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:40" (1/1) ... [2025-02-08 05:37:40,619 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:40" (1/1) ... [2025-02-08 05:37:40,621 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:37:40,626 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:37:40,626 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:37:40,626 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:37:40,627 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:40" (1/1) ... [2025-02-08 05:37:40,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:37:40,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:37:40,662 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:40,664 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:40,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:37:40,684 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:37:40,684 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:37:40,684 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:37:40,684 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:37:40,685 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 05:37:40,685 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 05:37:40,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:37:40,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:37:40,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:37:40,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:37:40,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:37:40,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:37:40,687 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:40,803 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:37:40,805 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:37:41,100 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63-7: #t~ite25#1 := #t~ret24#1; [2025-02-08 05:37:41,100 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63-8: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647; [2025-02-08 05:37:41,101 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63-9: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:41,101 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63-10: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:41,101 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63-11: #t~ret24#1 := minus_#res#1; [2025-02-08 05:37:41,274 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L85-7: #t~ite51#1 := #t~ret50#1; [2025-02-08 05:37:41,275 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L85-8: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret50#1 && #t~ret50#1 <= 2147483647; [2025-02-08 05:37:41,275 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L85-9: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:41,275 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L85-10: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:41,275 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L85-11: #t~ret50#1 := minus_#res#1; [2025-02-08 05:37:41,421 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L107-7: #t~ite77#1 := #t~ret76#1; [2025-02-08 05:37:41,421 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L107-8: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret76#1 && #t~ret76#1 <= 2147483647; [2025-02-08 05:37:41,421 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L107-9: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:41,422 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L107-10: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:41,422 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L107-11: #t~ret76#1 := minus_#res#1; [2025-02-08 05:37:41,601 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:37:41,601 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:37:41,642 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:37:41,646 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:37:41,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:41 BoogieIcfgContainer [2025-02-08 05:37:41,646 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:37:41,649 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:37:41,649 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:37:41,653 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:37:41,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:37:40" (1/3) ... [2025-02-08 05:37:41,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2deb91ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:41, skipping insertion in model container [2025-02-08 05:37:41,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:40" (2/3) ... [2025-02-08 05:37:41,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2deb91ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:41, skipping insertion in model container [2025-02-08 05:37:41,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:41" (3/3) ... [2025-02-08 05:37:41,655 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-subst.wvr.c [2025-02-08 05:37:41,666 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:37:41,668 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-name-comparator-subst.wvr.c that has 4 procedures, 1043 locations, 1 initial locations, 4 loop locations, and 151 error locations. [2025-02-08 05:37:41,668 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:37:41,824 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:37:41,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1052 places, 1096 transitions, 2213 flow [2025-02-08 05:37:42,207 INFO L124 PetriNetUnfolderBase]: 54/1093 cut-off events. [2025-02-08 05:37:42,212 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:37:42,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1106 conditions, 1093 events. 54/1093 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3821 event pairs, 0 based on Foata normal form. 0/885 useless extension candidates. Maximal degree in co-relation 834. Up to 2 conditions per place. [2025-02-08 05:37:42,240 INFO L82 GeneralOperation]: Start removeDead. Operand has 1052 places, 1096 transitions, 2213 flow [2025-02-08 05:37:42,262 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1029 places, 1070 transitions, 2158 flow [2025-02-08 05:37:42,268 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:37:42,275 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;@13537df7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:37:42,275 INFO L334 AbstractCegarLoop]: Starting to check reachability of 283 error locations. [2025-02-08 05:37:42,280 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:37:42,280 INFO L124 PetriNetUnfolderBase]: 0/33 cut-off events. [2025-02-08 05:37:42,280 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:37:42,280 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:42,281 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:42,281 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-02-08 05:37:42,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:42,285 INFO L85 PathProgramCache]: Analyzing trace with hash 259740291, now seen corresponding path program 1 times [2025-02-08 05:37:42,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:42,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986813637] [2025-02-08 05:37:42,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:42,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:42,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 05:37:42,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 05:37:42,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:42,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:42,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:42,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:42,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986813637] [2025-02-08 05:37:42,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986813637] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:42,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:42,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:42,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908372152] [2025-02-08 05:37:42,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:42,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:42,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:42,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:42,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:42,565 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1054 out of 1096 [2025-02-08 05:37:42,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1029 places, 1070 transitions, 2158 flow. Second operand has 3 states, 3 states have (on average 1055.3333333333333) internal successors, (3166), 3 states have internal predecessors, (3166), 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:42,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:42,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1054 of 1096 [2025-02-08 05:37:42,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:45,289 INFO L124 PetriNetUnfolderBase]: 569/11967 cut-off events. [2025-02-08 05:37:45,289 INFO L125 PetriNetUnfolderBase]: For 63/81 co-relation queries the response was YES. [2025-02-08 05:37:45,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12252 conditions, 11967 events. 569/11967 cut-off events. For 63/81 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 120716 event pairs, 95 based on Foata normal form. 281/9643 useless extension candidates. Maximal degree in co-relation 11971. Up to 185 conditions per place. [2025-02-08 05:37:45,478 INFO L140 encePairwiseOnDemand]: 1076/1096 looper letters, 19 selfloop transitions, 2 changer transitions 2/1052 dead transitions. [2025-02-08 05:37:45,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1030 places, 1052 transitions, 2164 flow [2025-02-08 05:37:45,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:45,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:45,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3201 transitions. [2025-02-08 05:37:45,498 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9735401459854015 [2025-02-08 05:37:45,499 INFO L175 Difference]: Start difference. First operand has 1029 places, 1070 transitions, 2158 flow. Second operand 3 states and 3201 transitions. [2025-02-08 05:37:45,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1030 places, 1052 transitions, 2164 flow [2025-02-08 05:37:45,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1024 places, 1052 transitions, 2152 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 05:37:45,528 INFO L231 Difference]: Finished difference. Result has 1024 places, 1050 transitions, 2110 flow [2025-02-08 05:37:45,531 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1096, PETRI_DIFFERENCE_MINUEND_FLOW=2110, PETRI_DIFFERENCE_MINUEND_PLACES=1022, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1052, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1050, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2110, PETRI_PLACES=1024, PETRI_TRANSITIONS=1050} [2025-02-08 05:37:45,534 INFO L279 CegarLoopForPetriNet]: 1029 programPoint places, -5 predicate places. [2025-02-08 05:37:45,534 INFO L471 AbstractCegarLoop]: Abstraction has has 1024 places, 1050 transitions, 2110 flow [2025-02-08 05:37:45,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1055.3333333333333) internal successors, (3166), 3 states have internal predecessors, (3166), 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:45,536 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:45,536 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] [2025-02-08 05:37:45,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:37:45,537 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-02-08 05:37:45,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:45,537 INFO L85 PathProgramCache]: Analyzing trace with hash -298566751, now seen corresponding path program 1 times [2025-02-08 05:37:45,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:45,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462601018] [2025-02-08 05:37:45,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:45,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:45,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 05:37:45,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 05:37:45,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:45,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:45,590 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:45,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:45,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462601018] [2025-02-08 05:37:45,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462601018] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:45,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:45,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:45,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204243180] [2025-02-08 05:37:45,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:45,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:45,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:45,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:45,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:45,643 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1054 out of 1096 [2025-02-08 05:37:45,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1024 places, 1050 transitions, 2110 flow. Second operand has 3 states, 3 states have (on average 1055.3333333333333) internal successors, (3166), 3 states have internal predecessors, (3166), 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:45,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:45,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1054 of 1096 [2025-02-08 05:37:45,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:46,760 INFO L124 PetriNetUnfolderBase]: 211/4317 cut-off events. [2025-02-08 05:37:46,760 INFO L125 PetriNetUnfolderBase]: For 13/20 co-relation queries the response was YES. [2025-02-08 05:37:46,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4446 conditions, 4317 events. 211/4317 cut-off events. For 13/20 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 32439 event pairs, 45 based on Foata normal form. 0/3396 useless extension candidates. Maximal degree in co-relation 4405. Up to 110 conditions per place. [2025-02-08 05:37:46,839 INFO L140 encePairwiseOnDemand]: 1093/1096 looper letters, 19 selfloop transitions, 2 changer transitions 0/1049 dead transitions. [2025-02-08 05:37:46,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1023 places, 1049 transitions, 2150 flow [2025-02-08 05:37:46,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:46,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:46,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3184 transitions. [2025-02-08 05:37:46,845 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9683698296836983 [2025-02-08 05:37:46,846 INFO L175 Difference]: Start difference. First operand has 1024 places, 1050 transitions, 2110 flow. Second operand 3 states and 3184 transitions. [2025-02-08 05:37:46,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1023 places, 1049 transitions, 2150 flow [2025-02-08 05:37:46,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1021 places, 1049 transitions, 2146 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:46,859 INFO L231 Difference]: Finished difference. Result has 1021 places, 1049 transitions, 2108 flow [2025-02-08 05:37:46,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1096, PETRI_DIFFERENCE_MINUEND_FLOW=2104, PETRI_DIFFERENCE_MINUEND_PLACES=1019, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1049, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1047, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2108, PETRI_PLACES=1021, PETRI_TRANSITIONS=1049} [2025-02-08 05:37:46,861 INFO L279 CegarLoopForPetriNet]: 1029 programPoint places, -8 predicate places. [2025-02-08 05:37:46,861 INFO L471 AbstractCegarLoop]: Abstraction has has 1021 places, 1049 transitions, 2108 flow [2025-02-08 05:37:46,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1055.3333333333333) internal successors, (3166), 3 states have internal predecessors, (3166), 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:46,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:46,863 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] [2025-02-08 05:37:46,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:37:46,864 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-02-08 05:37:46,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:46,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1890299954, now seen corresponding path program 1 times [2025-02-08 05:37:46,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:46,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913700618] [2025-02-08 05:37:46,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:46,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:46,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 05:37:46,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 05:37:46,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:46,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:46,908 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:46,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:46,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913700618] [2025-02-08 05:37:46,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913700618] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:46,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:46,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:46,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374471613] [2025-02-08 05:37:46,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:46,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:46,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:46,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:46,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:46,962 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1054 out of 1096 [2025-02-08 05:37:46,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1021 places, 1049 transitions, 2108 flow. Second operand has 3 states, 3 states have (on average 1055.3333333333333) internal successors, (3166), 3 states have internal predecessors, (3166), 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:46,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:46,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1054 of 1096 [2025-02-08 05:37:46,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:47,742 INFO L124 PetriNetUnfolderBase]: 228/3517 cut-off events. [2025-02-08 05:37:47,743 INFO L125 PetriNetUnfolderBase]: For 42/75 co-relation queries the response was YES. [2025-02-08 05:37:47,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3716 conditions, 3517 events. 228/3517 cut-off events. For 42/75 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 26739 event pairs, 95 based on Foata normal form. 0/2775 useless extension candidates. Maximal degree in co-relation 3667. Up to 185 conditions per place. [2025-02-08 05:37:47,833 INFO L140 encePairwiseOnDemand]: 1093/1096 looper letters, 19 selfloop transitions, 2 changer transitions 0/1048 dead transitions. [2025-02-08 05:37:47,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1022 places, 1048 transitions, 2148 flow [2025-02-08 05:37:47,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:47,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:47,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3184 transitions. [2025-02-08 05:37:47,838 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9683698296836983 [2025-02-08 05:37:47,839 INFO L175 Difference]: Start difference. First operand has 1021 places, 1049 transitions, 2108 flow. Second operand 3 states and 3184 transitions. [2025-02-08 05:37:47,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1022 places, 1048 transitions, 2148 flow [2025-02-08 05:37:47,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1020 places, 1048 transitions, 2144 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:47,853 INFO L231 Difference]: Finished difference. Result has 1020 places, 1048 transitions, 2106 flow [2025-02-08 05:37:47,854 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1096, PETRI_DIFFERENCE_MINUEND_FLOW=2102, PETRI_DIFFERENCE_MINUEND_PLACES=1018, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1048, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1046, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2106, PETRI_PLACES=1020, PETRI_TRANSITIONS=1048} [2025-02-08 05:37:47,855 INFO L279 CegarLoopForPetriNet]: 1029 programPoint places, -9 predicate places. [2025-02-08 05:37:47,855 INFO L471 AbstractCegarLoop]: Abstraction has has 1020 places, 1048 transitions, 2106 flow [2025-02-08 05:37:47,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1055.3333333333333) internal successors, (3166), 3 states have internal predecessors, (3166), 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:47,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:47,858 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] [2025-02-08 05:37:47,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:37:47,858 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-02-08 05:37:47,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:47,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1678821962, now seen corresponding path program 1 times [2025-02-08 05:37:47,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:47,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520534806] [2025-02-08 05:37:47,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:47,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:47,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 05:37:47,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 05:37:47,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:47,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:47,909 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:47,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:47,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520534806] [2025-02-08 05:37:47,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520534806] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:47,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:47,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:47,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971718131] [2025-02-08 05:37:47,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:47,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:47,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:47,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:47,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:47,959 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1055 out of 1096 [2025-02-08 05:37:47,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1020 places, 1048 transitions, 2106 flow. Second operand has 3 states, 3 states have (on average 1056.3333333333333) internal successors, (3169), 3 states have internal predecessors, (3169), 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:47,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:47,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1055 of 1096 [2025-02-08 05:37:47,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:49,656 INFO L124 PetriNetUnfolderBase]: 226/5407 cut-off events. [2025-02-08 05:37:49,656 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-02-08 05:37:49,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5483 conditions, 5407 events. 226/5407 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 42794 event pairs, 16 based on Foata normal form. 0/4254 useless extension candidates. Maximal degree in co-relation 5426. Up to 51 conditions per place. [2025-02-08 05:37:49,837 INFO L140 encePairwiseOnDemand]: 1093/1096 looper letters, 18 selfloop transitions, 2 changer transitions 0/1047 dead transitions. [2025-02-08 05:37:49,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1021 places, 1047 transitions, 2144 flow [2025-02-08 05:37:49,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:49,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:49,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3186 transitions. [2025-02-08 05:37:49,843 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.968978102189781 [2025-02-08 05:37:49,843 INFO L175 Difference]: Start difference. First operand has 1020 places, 1048 transitions, 2106 flow. Second operand 3 states and 3186 transitions. [2025-02-08 05:37:49,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1021 places, 1047 transitions, 2144 flow [2025-02-08 05:37:49,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1019 places, 1047 transitions, 2140 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:49,859 INFO L231 Difference]: Finished difference. Result has 1019 places, 1047 transitions, 2104 flow [2025-02-08 05:37:49,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1096, PETRI_DIFFERENCE_MINUEND_FLOW=2100, PETRI_DIFFERENCE_MINUEND_PLACES=1017, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1047, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1045, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2104, PETRI_PLACES=1019, PETRI_TRANSITIONS=1047} [2025-02-08 05:37:49,861 INFO L279 CegarLoopForPetriNet]: 1029 programPoint places, -10 predicate places. [2025-02-08 05:37:49,861 INFO L471 AbstractCegarLoop]: Abstraction has has 1019 places, 1047 transitions, 2104 flow [2025-02-08 05:37:49,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1056.3333333333333) internal successors, (3169), 3 states have internal predecessors, (3169), 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:49,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:49,863 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] [2025-02-08 05:37:49,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:37:49,863 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-02-08 05:37:49,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:49,864 INFO L85 PathProgramCache]: Analyzing trace with hash 2083529943, now seen corresponding path program 1 times [2025-02-08 05:37:49,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:49,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360235361] [2025-02-08 05:37:49,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:49,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:49,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-08 05:37:49,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-08 05:37:49,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:49,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:49,924 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:49,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:49,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360235361] [2025-02-08 05:37:49,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360235361] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:49,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:49,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:49,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854158557] [2025-02-08 05:37:49,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:49,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:49,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:49,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:49,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:49,957 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1058 out of 1096 [2025-02-08 05:37:49,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1019 places, 1047 transitions, 2104 flow. Second operand has 3 states, 3 states have (on average 1059.3333333333333) internal successors, (3178), 3 states have internal predecessors, (3178), 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:49,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:49,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1058 of 1096 [2025-02-08 05:37:49,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:50,320 INFO L124 PetriNetUnfolderBase]: 68/1586 cut-off events. [2025-02-08 05:37:50,320 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:37:50,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1647 conditions, 1586 events. 68/1586 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 8040 event pairs, 12 based on Foata normal form. 0/1272 useless extension candidates. Maximal degree in co-relation 1582. Up to 40 conditions per place. [2025-02-08 05:37:50,396 INFO L140 encePairwiseOnDemand]: 1093/1096 looper letters, 15 selfloop transitions, 2 changer transitions 0/1046 dead transitions. [2025-02-08 05:37:50,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1020 places, 1046 transitions, 2136 flow [2025-02-08 05:37:50,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:50,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:50,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3192 transitions. [2025-02-08 05:37:50,401 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9708029197080292 [2025-02-08 05:37:50,401 INFO L175 Difference]: Start difference. First operand has 1019 places, 1047 transitions, 2104 flow. Second operand 3 states and 3192 transitions. [2025-02-08 05:37:50,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1020 places, 1046 transitions, 2136 flow [2025-02-08 05:37:50,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1018 places, 1046 transitions, 2132 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:50,412 INFO L231 Difference]: Finished difference. Result has 1018 places, 1046 transitions, 2102 flow [2025-02-08 05:37:50,414 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1096, PETRI_DIFFERENCE_MINUEND_FLOW=2098, PETRI_DIFFERENCE_MINUEND_PLACES=1016, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1046, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1044, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2102, PETRI_PLACES=1018, PETRI_TRANSITIONS=1046} [2025-02-08 05:37:50,416 INFO L279 CegarLoopForPetriNet]: 1029 programPoint places, -11 predicate places. [2025-02-08 05:37:50,417 INFO L471 AbstractCegarLoop]: Abstraction has has 1018 places, 1046 transitions, 2102 flow [2025-02-08 05:37:50,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1059.3333333333333) internal successors, (3178), 3 states have internal predecessors, (3178), 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:50,418 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:50,419 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] [2025-02-08 05:37:50,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:37:50,419 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-02-08 05:37:50,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:50,419 INFO L85 PathProgramCache]: Analyzing trace with hash -838936516, now seen corresponding path program 1 times [2025-02-08 05:37:50,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:50,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65498074] [2025-02-08 05:37:50,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:50,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:50,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-08 05:37:50,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-08 05:37:50,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:50,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:50,459 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:50,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:50,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65498074] [2025-02-08 05:37:50,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65498074] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:50,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:50,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:50,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559152071] [2025-02-08 05:37:50,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:50,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:50,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:50,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:50,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:50,481 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1059 out of 1096 [2025-02-08 05:37:50,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1018 places, 1046 transitions, 2102 flow. Second operand has 3 states, 3 states have (on average 1060.3333333333333) internal successors, (3181), 3 states have internal predecessors, (3181), 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:50,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:50,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1059 of 1096 [2025-02-08 05:37:50,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:51,274 INFO L124 PetriNetUnfolderBase]: 154/3770 cut-off events. [2025-02-08 05:37:51,274 INFO L125 PetriNetUnfolderBase]: For 1/3 co-relation queries the response was YES. [2025-02-08 05:37:51,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3824 conditions, 3770 events. 154/3770 cut-off events. For 1/3 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 25517 event pairs, 10 based on Foata normal form. 0/2980 useless extension candidates. Maximal degree in co-relation 3751. Up to 35 conditions per place. [2025-02-08 05:37:51,389 INFO L140 encePairwiseOnDemand]: 1093/1096 looper letters, 14 selfloop transitions, 2 changer transitions 0/1045 dead transitions. [2025-02-08 05:37:51,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1019 places, 1045 transitions, 2132 flow [2025-02-08 05:37:51,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:51,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:51,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3194 transitions. [2025-02-08 05:37:51,394 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9714111922141119 [2025-02-08 05:37:51,394 INFO L175 Difference]: Start difference. First operand has 1018 places, 1046 transitions, 2102 flow. Second operand 3 states and 3194 transitions. [2025-02-08 05:37:51,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1019 places, 1045 transitions, 2132 flow [2025-02-08 05:37:51,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1017 places, 1045 transitions, 2128 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:51,408 INFO L231 Difference]: Finished difference. Result has 1017 places, 1045 transitions, 2100 flow [2025-02-08 05:37:51,409 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1096, PETRI_DIFFERENCE_MINUEND_FLOW=2096, PETRI_DIFFERENCE_MINUEND_PLACES=1015, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1045, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1043, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2100, PETRI_PLACES=1017, PETRI_TRANSITIONS=1045} [2025-02-08 05:37:51,410 INFO L279 CegarLoopForPetriNet]: 1029 programPoint places, -12 predicate places. [2025-02-08 05:37:51,410 INFO L471 AbstractCegarLoop]: Abstraction has has 1017 places, 1045 transitions, 2100 flow [2025-02-08 05:37:51,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1060.3333333333333) internal successors, (3181), 3 states have internal predecessors, (3181), 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:51,412 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:51,412 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] [2025-02-08 05:37:51,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:37:51,412 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-02-08 05:37:51,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:51,413 INFO L85 PathProgramCache]: Analyzing trace with hash 347497389, now seen corresponding path program 1 times [2025-02-08 05:37:51,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:51,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253548817] [2025-02-08 05:37:51,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:51,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:51,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-08 05:37:51,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-08 05:37:51,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:51,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:51,454 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:51,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:51,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253548817] [2025-02-08 05:37:51,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253548817] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:51,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:51,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:51,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757321546] [2025-02-08 05:37:51,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:51,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:51,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:51,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:51,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:51,508 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1052 out of 1096 [2025-02-08 05:37:51,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1017 places, 1045 transitions, 2100 flow. Second operand has 3 states, 3 states have (on average 1053.3333333333333) internal successors, (3160), 3 states have internal predecessors, (3160), 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:51,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:51,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1052 of 1096 [2025-02-08 05:37:51,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:53,198 INFO L124 PetriNetUnfolderBase]: 322/7584 cut-off events. [2025-02-08 05:37:53,198 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2025-02-08 05:37:53,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7687 conditions, 7584 events. 322/7584 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 67010 event pairs, 24 based on Foata normal form. 0/5960 useless extension candidates. Maximal degree in co-relation 7606. Up to 70 conditions per place. [2025-02-08 05:37:53,423 INFO L140 encePairwiseOnDemand]: 1093/1096 looper letters, 21 selfloop transitions, 2 changer transitions 0/1044 dead transitions. [2025-02-08 05:37:53,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1018 places, 1044 transitions, 2144 flow [2025-02-08 05:37:53,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:53,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:53,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3180 transitions. [2025-02-08 05:37:53,427 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9671532846715328 [2025-02-08 05:37:53,427 INFO L175 Difference]: Start difference. First operand has 1017 places, 1045 transitions, 2100 flow. Second operand 3 states and 3180 transitions. [2025-02-08 05:37:53,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1018 places, 1044 transitions, 2144 flow [2025-02-08 05:37:53,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1016 places, 1044 transitions, 2140 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:53,438 INFO L231 Difference]: Finished difference. Result has 1016 places, 1044 transitions, 2098 flow [2025-02-08 05:37:53,440 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1096, PETRI_DIFFERENCE_MINUEND_FLOW=2094, PETRI_DIFFERENCE_MINUEND_PLACES=1014, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1044, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1042, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2098, PETRI_PLACES=1016, PETRI_TRANSITIONS=1044} [2025-02-08 05:37:53,440 INFO L279 CegarLoopForPetriNet]: 1029 programPoint places, -13 predicate places. [2025-02-08 05:37:53,441 INFO L471 AbstractCegarLoop]: Abstraction has has 1016 places, 1044 transitions, 2098 flow [2025-02-08 05:37:53,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1053.3333333333333) internal successors, (3160), 3 states have internal predecessors, (3160), 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:53,442 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:53,443 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:53,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:37:53,443 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-02-08 05:37:53,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:53,443 INFO L85 PathProgramCache]: Analyzing trace with hash 2076118065, now seen corresponding path program 1 times [2025-02-08 05:37:53,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:53,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813082882] [2025-02-08 05:37:53,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:53,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:53,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-08 05:37:53,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-08 05:37:53,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:53,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:53,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:53,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:53,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813082882] [2025-02-08 05:37:53,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813082882] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:53,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:53,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:53,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469104037] [2025-02-08 05:37:53,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:53,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:53,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:53,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:53,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:53,551 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1054 out of 1096 [2025-02-08 05:37:53,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1016 places, 1044 transitions, 2098 flow. Second operand has 3 states, 3 states have (on average 1055.3333333333333) internal successors, (3166), 3 states have internal predecessors, (3166), 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:53,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:53,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1054 of 1096 [2025-02-08 05:37:53,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:54,271 INFO L124 PetriNetUnfolderBase]: 138/3227 cut-off events. [2025-02-08 05:37:54,271 INFO L125 PetriNetUnfolderBase]: For 9/30 co-relation queries the response was YES. [2025-02-08 05:37:54,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3296 conditions, 3227 events. 138/3227 cut-off events. For 9/30 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 21190 event pairs, 16 based on Foata normal form. 0/2555 useless extension candidates. Maximal degree in co-relation 3207. Up to 52 conditions per place. [2025-02-08 05:37:54,379 INFO L140 encePairwiseOnDemand]: 1093/1096 looper letters, 19 selfloop transitions, 2 changer transitions 0/1043 dead transitions. [2025-02-08 05:37:54,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1017 places, 1043 transitions, 2138 flow [2025-02-08 05:37:54,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:54,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:54,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3184 transitions. [2025-02-08 05:37:54,383 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9683698296836983 [2025-02-08 05:37:54,383 INFO L175 Difference]: Start difference. First operand has 1016 places, 1044 transitions, 2098 flow. Second operand 3 states and 3184 transitions. [2025-02-08 05:37:54,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1017 places, 1043 transitions, 2138 flow [2025-02-08 05:37:54,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1015 places, 1043 transitions, 2134 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:54,396 INFO L231 Difference]: Finished difference. Result has 1015 places, 1043 transitions, 2096 flow [2025-02-08 05:37:54,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1096, PETRI_DIFFERENCE_MINUEND_FLOW=2092, PETRI_DIFFERENCE_MINUEND_PLACES=1013, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1043, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1041, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2096, PETRI_PLACES=1015, PETRI_TRANSITIONS=1043} [2025-02-08 05:37:54,399 INFO L279 CegarLoopForPetriNet]: 1029 programPoint places, -14 predicate places. [2025-02-08 05:37:54,399 INFO L471 AbstractCegarLoop]: Abstraction has has 1015 places, 1043 transitions, 2096 flow [2025-02-08 05:37:54,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1055.3333333333333) internal successors, (3166), 3 states have internal predecessors, (3166), 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:54,401 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:54,401 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:54,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:37:54,401 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-02-08 05:37:54,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:54,402 INFO L85 PathProgramCache]: Analyzing trace with hash 828678707, now seen corresponding path program 1 times [2025-02-08 05:37:54,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:54,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405153963] [2025-02-08 05:37:54,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:54,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:54,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-08 05:37:54,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-08 05:37:54,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:54,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:54,438 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:54,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:54,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405153963] [2025-02-08 05:37:54,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405153963] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:54,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:54,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:54,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561167153] [2025-02-08 05:37:54,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:54,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:54,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:54,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:54,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:54,468 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1058 out of 1096 [2025-02-08 05:37:54,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1015 places, 1043 transitions, 2096 flow. Second operand has 3 states, 3 states have (on average 1059.3333333333333) internal successors, (3178), 3 states have internal predecessors, (3178), 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:54,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:54,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1058 of 1096 [2025-02-08 05:37:54,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:54,810 INFO L124 PetriNetUnfolderBase]: 68/1582 cut-off events. [2025-02-08 05:37:54,810 INFO L125 PetriNetUnfolderBase]: For 8/14 co-relation queries the response was YES. [2025-02-08 05:37:54,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1637 conditions, 1582 events. 68/1582 cut-off events. For 8/14 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 7618 event pairs, 12 based on Foata normal form. 0/1270 useless extension candidates. Maximal degree in co-relation 1540. Up to 40 conditions per place. [2025-02-08 05:37:54,865 INFO L140 encePairwiseOnDemand]: 1093/1096 looper letters, 15 selfloop transitions, 2 changer transitions 0/1042 dead transitions. [2025-02-08 05:37:54,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1016 places, 1042 transitions, 2128 flow [2025-02-08 05:37:54,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:54,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:54,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3192 transitions. [2025-02-08 05:37:54,868 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9708029197080292 [2025-02-08 05:37:54,868 INFO L175 Difference]: Start difference. First operand has 1015 places, 1043 transitions, 2096 flow. Second operand 3 states and 3192 transitions. [2025-02-08 05:37:54,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1016 places, 1042 transitions, 2128 flow [2025-02-08 05:37:54,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1014 places, 1042 transitions, 2124 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:54,879 INFO L231 Difference]: Finished difference. Result has 1014 places, 1042 transitions, 2094 flow [2025-02-08 05:37:54,881 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1096, PETRI_DIFFERENCE_MINUEND_FLOW=2090, PETRI_DIFFERENCE_MINUEND_PLACES=1012, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1042, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1040, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2094, PETRI_PLACES=1014, PETRI_TRANSITIONS=1042} [2025-02-08 05:37:54,881 INFO L279 CegarLoopForPetriNet]: 1029 programPoint places, -15 predicate places. [2025-02-08 05:37:54,881 INFO L471 AbstractCegarLoop]: Abstraction has has 1014 places, 1042 transitions, 2094 flow [2025-02-08 05:37:54,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1059.3333333333333) internal successors, (3178), 3 states have internal predecessors, (3178), 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:54,883 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:54,883 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] [2025-02-08 05:37:54,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:37:54,884 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-02-08 05:37:54,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:54,884 INFO L85 PathProgramCache]: Analyzing trace with hash -921576355, now seen corresponding path program 1 times [2025-02-08 05:37:54,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:54,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862033851] [2025-02-08 05:37:54,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:54,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:54,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-08 05:37:54,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-08 05:37:54,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:54,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:54,919 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:54,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:54,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862033851] [2025-02-08 05:37:54,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862033851] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:54,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:54,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:54,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311579181] [2025-02-08 05:37:54,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:54,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:54,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:54,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:54,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:54,947 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1059 out of 1096 [2025-02-08 05:37:54,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1014 places, 1042 transitions, 2094 flow. Second operand has 3 states, 3 states have (on average 1060.3333333333333) internal successors, (3181), 3 states have internal predecessors, (3181), 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:54,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:54,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1059 of 1096 [2025-02-08 05:37:54,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:55,505 INFO L124 PetriNetUnfolderBase]: 99/2406 cut-off events. [2025-02-08 05:37:55,505 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2025-02-08 05:37:55,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2455 conditions, 2406 events. 99/2406 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 13354 event pairs, 10 based on Foata normal form. 0/1918 useless extension candidates. Maximal degree in co-relation 2350. Up to 35 conditions per place. [2025-02-08 05:37:55,576 INFO L140 encePairwiseOnDemand]: 1093/1096 looper letters, 14 selfloop transitions, 2 changer transitions 0/1041 dead transitions. [2025-02-08 05:37:55,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1015 places, 1041 transitions, 2124 flow [2025-02-08 05:37:55,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:55,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:55,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3194 transitions. [2025-02-08 05:37:55,580 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9714111922141119 [2025-02-08 05:37:55,580 INFO L175 Difference]: Start difference. First operand has 1014 places, 1042 transitions, 2094 flow. Second operand 3 states and 3194 transitions. [2025-02-08 05:37:55,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1015 places, 1041 transitions, 2124 flow [2025-02-08 05:37:55,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1013 places, 1041 transitions, 2120 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:55,589 INFO L231 Difference]: Finished difference. Result has 1013 places, 1041 transitions, 2092 flow [2025-02-08 05:37:55,590 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1096, PETRI_DIFFERENCE_MINUEND_FLOW=2088, PETRI_DIFFERENCE_MINUEND_PLACES=1011, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1041, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1039, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2092, PETRI_PLACES=1013, PETRI_TRANSITIONS=1041} [2025-02-08 05:37:55,590 INFO L279 CegarLoopForPetriNet]: 1029 programPoint places, -16 predicate places. [2025-02-08 05:37:55,590 INFO L471 AbstractCegarLoop]: Abstraction has has 1013 places, 1041 transitions, 2092 flow [2025-02-08 05:37:55,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1060.3333333333333) internal successors, (3181), 3 states have internal predecessors, (3181), 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:55,592 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:55,592 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] [2025-02-08 05:37:55,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:37:55,592 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-02-08 05:37:55,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:55,592 INFO L85 PathProgramCache]: Analyzing trace with hash 815942567, now seen corresponding path program 1 times [2025-02-08 05:37:55,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:55,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483608507] [2025-02-08 05:37:55,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:55,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:55,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-08 05:37:55,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-08 05:37:55,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:55,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:55,635 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:55,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:55,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483608507] [2025-02-08 05:37:55,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483608507] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:55,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:55,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:55,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212524605] [2025-02-08 05:37:55,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:55,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:55,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:55,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:55,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:55,685 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1052 out of 1096 [2025-02-08 05:37:55,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1013 places, 1041 transitions, 2092 flow. Second operand has 3 states, 3 states have (on average 1053.3333333333333) internal successors, (3160), 3 states have internal predecessors, (3160), 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:55,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:55,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1052 of 1096 [2025-02-08 05:37:55,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:56,899 INFO L124 PetriNetUnfolderBase]: 190/4316 cut-off events. [2025-02-08 05:37:56,899 INFO L125 PetriNetUnfolderBase]: For 13/97 co-relation queries the response was YES. [2025-02-08 05:37:56,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4407 conditions, 4316 events. 190/4316 cut-off events. For 13/97 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 31775 event pairs, 24 based on Foata normal form. 0/3405 useless extension candidates. Maximal degree in co-relation 4294. Up to 70 conditions per place. [2025-02-08 05:37:57,012 INFO L140 encePairwiseOnDemand]: 1093/1096 looper letters, 21 selfloop transitions, 2 changer transitions 0/1040 dead transitions. [2025-02-08 05:37:57,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1014 places, 1040 transitions, 2136 flow [2025-02-08 05:37:57,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:57,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:57,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3180 transitions. [2025-02-08 05:37:57,017 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9671532846715328 [2025-02-08 05:37:57,017 INFO L175 Difference]: Start difference. First operand has 1013 places, 1041 transitions, 2092 flow. Second operand 3 states and 3180 transitions. [2025-02-08 05:37:57,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1014 places, 1040 transitions, 2136 flow [2025-02-08 05:37:57,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1012 places, 1040 transitions, 2132 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:57,029 INFO L231 Difference]: Finished difference. Result has 1012 places, 1040 transitions, 2090 flow [2025-02-08 05:37:57,030 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1096, PETRI_DIFFERENCE_MINUEND_FLOW=2086, PETRI_DIFFERENCE_MINUEND_PLACES=1010, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1040, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1038, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2090, PETRI_PLACES=1012, PETRI_TRANSITIONS=1040} [2025-02-08 05:37:57,030 INFO L279 CegarLoopForPetriNet]: 1029 programPoint places, -17 predicate places. [2025-02-08 05:37:57,030 INFO L471 AbstractCegarLoop]: Abstraction has has 1012 places, 1040 transitions, 2090 flow [2025-02-08 05:37:57,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1053.3333333333333) internal successors, (3160), 3 states have internal predecessors, (3160), 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:57,032 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:57,032 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:57,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:37:57,032 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-02-08 05:37:57,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:57,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1710010956, now seen corresponding path program 1 times [2025-02-08 05:37:57,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:57,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928479472] [2025-02-08 05:37:57,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:57,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:57,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-08 05:37:57,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-08 05:37:57,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:57,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:57,090 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:57,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:57,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928479472] [2025-02-08 05:37:57,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928479472] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:57,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:57,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:57,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352607657] [2025-02-08 05:37:57,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:57,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:57,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:57,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:57,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:57,128 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1054 out of 1096 [2025-02-08 05:37:57,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1012 places, 1040 transitions, 2090 flow. Second operand has 3 states, 3 states have (on average 1055.3333333333333) internal successors, (3166), 3 states have internal predecessors, (3166), 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:57,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:57,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1054 of 1096 [2025-02-08 05:37:57,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:57,497 INFO L124 PetriNetUnfolderBase]: 72/1547 cut-off events. [2025-02-08 05:37:57,497 INFO L125 PetriNetUnfolderBase]: For 18/20 co-relation queries the response was YES. [2025-02-08 05:37:57,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1610 conditions, 1547 events. 72/1547 cut-off events. For 18/20 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 7348 event pairs, 16 based on Foata normal form. 0/1250 useless extension candidates. Maximal degree in co-relation 1489. Up to 54 conditions per place. [2025-02-08 05:37:57,539 INFO L140 encePairwiseOnDemand]: 1093/1096 looper letters, 19 selfloop transitions, 2 changer transitions 0/1039 dead transitions. [2025-02-08 05:37:57,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1013 places, 1039 transitions, 2130 flow [2025-02-08 05:37:57,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:57,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:57,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3184 transitions. [2025-02-08 05:37:57,543 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9683698296836983 [2025-02-08 05:37:57,543 INFO L175 Difference]: Start difference. First operand has 1012 places, 1040 transitions, 2090 flow. Second operand 3 states and 3184 transitions. [2025-02-08 05:37:57,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1013 places, 1039 transitions, 2130 flow [2025-02-08 05:37:57,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1011 places, 1039 transitions, 2126 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:57,554 INFO L231 Difference]: Finished difference. Result has 1011 places, 1039 transitions, 2088 flow [2025-02-08 05:37:57,555 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1096, PETRI_DIFFERENCE_MINUEND_FLOW=2084, PETRI_DIFFERENCE_MINUEND_PLACES=1009, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1039, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1037, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2088, PETRI_PLACES=1011, PETRI_TRANSITIONS=1039} [2025-02-08 05:37:57,556 INFO L279 CegarLoopForPetriNet]: 1029 programPoint places, -18 predicate places. [2025-02-08 05:37:57,556 INFO L471 AbstractCegarLoop]: Abstraction has has 1011 places, 1039 transitions, 2088 flow [2025-02-08 05:37:57,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1055.3333333333333) internal successors, (3166), 3 states have internal predecessors, (3166), 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:57,556 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:57,557 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] [2025-02-08 05:37:57,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:37:57,557 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-02-08 05:37:57,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:57,557 INFO L85 PathProgramCache]: Analyzing trace with hash 136022861, now seen corresponding path program 1 times [2025-02-08 05:37:57,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:57,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888924409] [2025-02-08 05:37:57,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:57,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:57,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-08 05:37:57,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-08 05:37:57,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:57,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:57,588 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:57,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:57,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888924409] [2025-02-08 05:37:57,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888924409] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:57,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:57,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:57,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476738212] [2025-02-08 05:37:57,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:57,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:57,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:57,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:57,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:57,622 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1058 out of 1096 [2025-02-08 05:37:57,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1011 places, 1039 transitions, 2088 flow. Second operand has 3 states, 3 states have (on average 1059.3333333333333) internal successors, (3178), 3 states have internal predecessors, (3178), 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:57,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:57,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1058 of 1096 [2025-02-08 05:37:57,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:57,916 INFO L124 PetriNetUnfolderBase]: 68/1578 cut-off events. [2025-02-08 05:37:57,917 INFO L125 PetriNetUnfolderBase]: For 14/16 co-relation queries the response was YES. [2025-02-08 05:37:57,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1627 conditions, 1578 events. 68/1578 cut-off events. For 14/16 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 7135 event pairs, 12 based on Foata normal form. 0/1271 useless extension candidates. Maximal degree in co-relation 1498. Up to 40 conditions per place. [2025-02-08 05:37:57,965 INFO L140 encePairwiseOnDemand]: 1093/1096 looper letters, 15 selfloop transitions, 2 changer transitions 0/1038 dead transitions. [2025-02-08 05:37:57,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1012 places, 1038 transitions, 2120 flow [2025-02-08 05:37:57,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:57,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:57,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3192 transitions. [2025-02-08 05:37:57,970 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9708029197080292 [2025-02-08 05:37:57,970 INFO L175 Difference]: Start difference. First operand has 1011 places, 1039 transitions, 2088 flow. Second operand 3 states and 3192 transitions. [2025-02-08 05:37:57,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1012 places, 1038 transitions, 2120 flow [2025-02-08 05:37:57,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1010 places, 1038 transitions, 2116 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:57,981 INFO L231 Difference]: Finished difference. Result has 1010 places, 1038 transitions, 2086 flow [2025-02-08 05:37:57,983 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1096, PETRI_DIFFERENCE_MINUEND_FLOW=2082, PETRI_DIFFERENCE_MINUEND_PLACES=1008, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1038, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1036, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2086, PETRI_PLACES=1010, PETRI_TRANSITIONS=1038} [2025-02-08 05:37:57,984 INFO L279 CegarLoopForPetriNet]: 1029 programPoint places, -19 predicate places. [2025-02-08 05:37:57,984 INFO L471 AbstractCegarLoop]: Abstraction has has 1010 places, 1038 transitions, 2086 flow [2025-02-08 05:37:57,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1059.3333333333333) internal successors, (3178), 3 states have internal predecessors, (3178), 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:57,985 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:57,985 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:57,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:37:57,985 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-02-08 05:37:57,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:57,986 INFO L85 PathProgramCache]: Analyzing trace with hash -550345703, now seen corresponding path program 1 times [2025-02-08 05:37:57,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:57,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501978623] [2025-02-08 05:37:57,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:57,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:57,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-08 05:37:57,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-08 05:37:58,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:58,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:58,048 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:58,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:58,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501978623] [2025-02-08 05:37:58,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501978623] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:58,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:58,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:58,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808841310] [2025-02-08 05:37:58,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:58,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:58,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:58,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:58,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:58,071 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1059 out of 1096 [2025-02-08 05:37:58,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1010 places, 1038 transitions, 2086 flow. Second operand has 3 states, 3 states have (on average 1060.3333333333333) internal successors, (3181), 3 states have internal predecessors, (3181), 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:58,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:58,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1059 of 1096 [2025-02-08 05:37:58,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:58,271 INFO L124 PetriNetUnfolderBase]: 44/1057 cut-off events. [2025-02-08 05:37:58,272 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2025-02-08 05:37:58,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1101 conditions, 1057 events. 44/1057 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4294 event pairs, 10 based on Foata normal form. 0/872 useless extension candidates. Maximal degree in co-relation 964. Up to 35 conditions per place. [2025-02-08 05:37:58,302 INFO L140 encePairwiseOnDemand]: 1093/1096 looper letters, 14 selfloop transitions, 2 changer transitions 0/1037 dead transitions. [2025-02-08 05:37:58,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1011 places, 1037 transitions, 2116 flow [2025-02-08 05:37:58,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:58,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:58,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3194 transitions. [2025-02-08 05:37:58,306 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9714111922141119 [2025-02-08 05:37:58,306 INFO L175 Difference]: Start difference. First operand has 1010 places, 1038 transitions, 2086 flow. Second operand 3 states and 3194 transitions. [2025-02-08 05:37:58,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1011 places, 1037 transitions, 2116 flow [2025-02-08 05:37:58,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1009 places, 1037 transitions, 2112 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:58,317 INFO L231 Difference]: Finished difference. Result has 1009 places, 1037 transitions, 2084 flow [2025-02-08 05:37:58,319 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1096, PETRI_DIFFERENCE_MINUEND_FLOW=2080, PETRI_DIFFERENCE_MINUEND_PLACES=1007, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1037, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1035, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2084, PETRI_PLACES=1009, PETRI_TRANSITIONS=1037} [2025-02-08 05:37:58,320 INFO L279 CegarLoopForPetriNet]: 1029 programPoint places, -20 predicate places. [2025-02-08 05:37:58,320 INFO L471 AbstractCegarLoop]: Abstraction has has 1009 places, 1037 transitions, 2084 flow [2025-02-08 05:37:58,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1060.3333333333333) internal successors, (3181), 3 states have internal predecessors, (3181), 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:58,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:58,321 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] [2025-02-08 05:37:58,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:37:58,321 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-02-08 05:37:58,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:58,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1453164293, now seen corresponding path program 1 times [2025-02-08 05:37:58,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:58,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084011197] [2025-02-08 05:37:58,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:58,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:58,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-08 05:37:58,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-08 05:37:58,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:58,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:58,366 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:58,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:58,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084011197] [2025-02-08 05:37:58,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084011197] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:58,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:58,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:58,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220579238] [2025-02-08 05:37:58,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:58,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:58,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:58,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:58,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:58,408 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1052 out of 1096 [2025-02-08 05:37:58,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1009 places, 1037 transitions, 2084 flow. Second operand has 3 states, 3 states have (on average 1053.3333333333333) internal successors, (3160), 3 states have internal predecessors, (3160), 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:58,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:58,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1052 of 1096 [2025-02-08 05:37:58,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:58,711 INFO L124 PetriNetUnfolderBase]: 80/1576 cut-off events. [2025-02-08 05:37:58,711 INFO L125 PetriNetUnfolderBase]: For 26/28 co-relation queries the response was YES. [2025-02-08 05:37:58,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1655 conditions, 1576 events. 80/1576 cut-off events. For 26/28 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 8168 event pairs, 24 based on Foata normal form. 0/1270 useless extension candidates. Maximal degree in co-relation 1510. Up to 70 conditions per place. [2025-02-08 05:37:58,744 INFO L140 encePairwiseOnDemand]: 1093/1096 looper letters, 21 selfloop transitions, 2 changer transitions 0/1036 dead transitions. [2025-02-08 05:37:58,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1010 places, 1036 transitions, 2128 flow [2025-02-08 05:37:58,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:58,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:58,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3180 transitions. [2025-02-08 05:37:58,747 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9671532846715328 [2025-02-08 05:37:58,747 INFO L175 Difference]: Start difference. First operand has 1009 places, 1037 transitions, 2084 flow. Second operand 3 states and 3180 transitions. [2025-02-08 05:37:58,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1010 places, 1036 transitions, 2128 flow [2025-02-08 05:37:58,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1008 places, 1036 transitions, 2124 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:58,757 INFO L231 Difference]: Finished difference. Result has 1008 places, 1036 transitions, 2082 flow [2025-02-08 05:37:58,759 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1096, PETRI_DIFFERENCE_MINUEND_FLOW=2078, PETRI_DIFFERENCE_MINUEND_PLACES=1006, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1036, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1034, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2082, PETRI_PLACES=1008, PETRI_TRANSITIONS=1036} [2025-02-08 05:37:58,759 INFO L279 CegarLoopForPetriNet]: 1029 programPoint places, -21 predicate places. [2025-02-08 05:37:58,759 INFO L471 AbstractCegarLoop]: Abstraction has has 1008 places, 1036 transitions, 2082 flow [2025-02-08 05:37:58,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1053.3333333333333) internal successors, (3160), 3 states have internal predecessors, (3160), 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:58,760 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:58,760 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] [2025-02-08 05:37:58,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:37:58,760 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-02-08 05:37:58,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:58,761 INFO L85 PathProgramCache]: Analyzing trace with hash -262772535, now seen corresponding path program 1 times [2025-02-08 05:37:58,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:58,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814948026] [2025-02-08 05:37:58,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:58,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:58,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-02-08 05:37:58,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-02-08 05:37:58,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:58,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:58,835 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:58,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:58,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814948026] [2025-02-08 05:37:58,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814948026] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:58,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:58,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:58,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408905476] [2025-02-08 05:37:58,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:58,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:58,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:58,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:58,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:58,854 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1061 out of 1096 [2025-02-08 05:37:58,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1008 places, 1036 transitions, 2082 flow. Second operand has 3 states, 3 states have (on average 1062.3333333333333) internal successors, (3187), 3 states have internal predecessors, (3187), 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:58,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:58,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1061 of 1096 [2025-02-08 05:37:58,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:59,332 INFO L124 PetriNetUnfolderBase]: 112/2566 cut-off events. [2025-02-08 05:37:59,333 INFO L125 PetriNetUnfolderBase]: For 6/10 co-relation queries the response was YES. [2025-02-08 05:37:59,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2622 conditions, 2566 events. 112/2566 cut-off events. For 6/10 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 14093 event pairs, 15 based on Foata normal form. 0/2048 useless extension candidates. Maximal degree in co-relation 2469. Up to 43 conditions per place. [2025-02-08 05:37:59,406 INFO L140 encePairwiseOnDemand]: 1093/1096 looper letters, 12 selfloop transitions, 2 changer transitions 0/1035 dead transitions. [2025-02-08 05:37:59,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1009 places, 1035 transitions, 2108 flow [2025-02-08 05:37:59,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:59,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:59,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3198 transitions. [2025-02-08 05:37:59,409 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9726277372262774 [2025-02-08 05:37:59,409 INFO L175 Difference]: Start difference. First operand has 1008 places, 1036 transitions, 2082 flow. Second operand 3 states and 3198 transitions. [2025-02-08 05:37:59,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1009 places, 1035 transitions, 2108 flow [2025-02-08 05:37:59,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1007 places, 1035 transitions, 2104 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:59,419 INFO L231 Difference]: Finished difference. Result has 1007 places, 1035 transitions, 2080 flow [2025-02-08 05:37:59,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1096, PETRI_DIFFERENCE_MINUEND_FLOW=2076, PETRI_DIFFERENCE_MINUEND_PLACES=1005, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1035, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1033, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2080, PETRI_PLACES=1007, PETRI_TRANSITIONS=1035} [2025-02-08 05:37:59,420 INFO L279 CegarLoopForPetriNet]: 1029 programPoint places, -22 predicate places. [2025-02-08 05:37:59,420 INFO L471 AbstractCegarLoop]: Abstraction has has 1007 places, 1035 transitions, 2080 flow [2025-02-08 05:37:59,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1062.3333333333333) internal successors, (3187), 3 states have internal predecessors, (3187), 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:59,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:59,421 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] [2025-02-08 05:37:59,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:37:59,421 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-02-08 05:37:59,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:59,422 INFO L85 PathProgramCache]: Analyzing trace with hash -926957111, now seen corresponding path program 1 times [2025-02-08 05:37:59,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:59,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128215631] [2025-02-08 05:37:59,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:59,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:59,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-02-08 05:37:59,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-02-08 05:37:59,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:59,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:59,943 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:59,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:59,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128215631] [2025-02-08 05:37:59,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128215631] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:59,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:59,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:59,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65988528] [2025-02-08 05:37:59,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:59,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:59,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:59,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:59,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:38:00,044 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1045 out of 1096 [2025-02-08 05:38:00,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1007 places, 1035 transitions, 2080 flow. Second operand has 6 states, 6 states have (on average 1046.5) internal successors, (6279), 6 states have internal predecessors, (6279), 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:38:00,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:00,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1045 of 1096 [2025-02-08 05:38:00,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:02,554 INFO L124 PetriNetUnfolderBase]: 839/12520 cut-off events. [2025-02-08 05:38:02,555 INFO L125 PetriNetUnfolderBase]: For 59/68 co-relation queries the response was YES. [2025-02-08 05:38:02,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13140 conditions, 12520 events. 839/12520 cut-off events. For 59/68 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 129866 event pairs, 264 based on Foata normal form. 0/9791 useless extension candidates. Maximal degree in co-relation 12928. Up to 580 conditions per place. [2025-02-08 05:38:02,846 INFO L140 encePairwiseOnDemand]: 1090/1096 looper letters, 26 selfloop transitions, 5 changer transitions 0/1034 dead transitions. [2025-02-08 05:38:02,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1011 places, 1034 transitions, 2140 flow [2025-02-08 05:38:02,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:38:02,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:38:02,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6302 transitions. [2025-02-08 05:38:02,852 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9583333333333334 [2025-02-08 05:38:02,852 INFO L175 Difference]: Start difference. First operand has 1007 places, 1035 transitions, 2080 flow. Second operand 6 states and 6302 transitions. [2025-02-08 05:38:02,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1011 places, 1034 transitions, 2140 flow [2025-02-08 05:38:02,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1009 places, 1034 transitions, 2136 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:02,861 INFO L231 Difference]: Finished difference. Result has 1009 places, 1034 transitions, 2084 flow [2025-02-08 05:38:02,861 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1096, PETRI_DIFFERENCE_MINUEND_FLOW=2074, PETRI_DIFFERENCE_MINUEND_PLACES=1004, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1034, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1029, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2084, PETRI_PLACES=1009, PETRI_TRANSITIONS=1034} [2025-02-08 05:38:02,862 INFO L279 CegarLoopForPetriNet]: 1029 programPoint places, -20 predicate places. [2025-02-08 05:38:02,862 INFO L471 AbstractCegarLoop]: Abstraction has has 1009 places, 1034 transitions, 2084 flow [2025-02-08 05:38:02,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1046.5) internal successors, (6279), 6 states have internal predecessors, (6279), 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:38:02,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:02,863 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:02,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:38:02,863 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err42ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-02-08 05:38:02,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:02,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1700040765, now seen corresponding path program 1 times [2025-02-08 05:38:02,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:02,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905606897] [2025-02-08 05:38:02,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:02,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:02,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-02-08 05:38:02,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-02-08 05:38:02,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:02,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:02,910 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:38:02,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:02,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905606897] [2025-02-08 05:38:02,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905606897] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:02,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:02,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:02,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310538044] [2025-02-08 05:38:02,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:02,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:02,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:02,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:02,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:02,934 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1060 out of 1096 [2025-02-08 05:38:02,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1009 places, 1034 transitions, 2084 flow. Second operand has 3 states, 3 states have (on average 1061.6666666666667) internal successors, (3185), 3 states have internal predecessors, (3185), 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:38:02,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:02,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1060 of 1096 [2025-02-08 05:38:02,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:03,636 INFO L124 PetriNetUnfolderBase]: 151/3479 cut-off events. [2025-02-08 05:38:03,636 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2025-02-08 05:38:03,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3560 conditions, 3479 events. 151/3479 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 22444 event pairs, 9 based on Foata normal form. 0/2760 useless extension candidates. Maximal degree in co-relation 3542. Up to 43 conditions per place. [2025-02-08 05:38:03,771 INFO L140 encePairwiseOnDemand]: 1093/1096 looper letters, 16 selfloop transitions, 2 changer transitions 0/1035 dead transitions. [2025-02-08 05:38:03,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1010 places, 1035 transitions, 2124 flow [2025-02-08 05:38:03,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:03,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:03,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3199 transitions. [2025-02-08 05:38:03,775 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9729318734793188 [2025-02-08 05:38:03,775 INFO L175 Difference]: Start difference. First operand has 1009 places, 1034 transitions, 2084 flow. Second operand 3 states and 3199 transitions. [2025-02-08 05:38:03,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1010 places, 1035 transitions, 2124 flow [2025-02-08 05:38:03,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1005 places, 1035 transitions, 2114 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:38:03,785 INFO L231 Difference]: Finished difference. Result has 1005 places, 1033 transitions, 2076 flow [2025-02-08 05:38:03,786 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1096, PETRI_DIFFERENCE_MINUEND_FLOW=2072, PETRI_DIFFERENCE_MINUEND_PLACES=1003, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1033, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1031, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2076, PETRI_PLACES=1005, PETRI_TRANSITIONS=1033} [2025-02-08 05:38:03,786 INFO L279 CegarLoopForPetriNet]: 1029 programPoint places, -24 predicate places. [2025-02-08 05:38:03,786 INFO L471 AbstractCegarLoop]: Abstraction has has 1005 places, 1033 transitions, 2076 flow [2025-02-08 05:38:03,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1061.6666666666667) internal successors, (3185), 3 states have internal predecessors, (3185), 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:38:03,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:03,787 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:03,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:38:03,787 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err41ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-02-08 05:38:03,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:03,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1830662569, now seen corresponding path program 1 times [2025-02-08 05:38:03,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:03,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348577460] [2025-02-08 05:38:03,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:03,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:03,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-08 05:38:03,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-08 05:38:03,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:03,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:03,825 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:38:03,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:03,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348577460] [2025-02-08 05:38:03,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348577460] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:03,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:03,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:03,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119772974] [2025-02-08 05:38:03,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:03,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:03,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:03,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:03,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:03,871 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1054 out of 1096 [2025-02-08 05:38:03,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1005 places, 1033 transitions, 2076 flow. Second operand has 3 states, 3 states have (on average 1055.6666666666667) internal successors, (3167), 3 states have internal predecessors, (3167), 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:38:03,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:03,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1054 of 1096 [2025-02-08 05:38:03,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:04,302 INFO L124 PetriNetUnfolderBase]: 108/2119 cut-off events. [2025-02-08 05:38:04,302 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:38:04,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2239 conditions, 2119 events. 108/2119 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 12962 event pairs, 26 based on Foata normal form. 0/1704 useless extension candidates. Maximal degree in co-relation 2027. Up to 73 conditions per place. [2025-02-08 05:38:04,364 INFO L140 encePairwiseOnDemand]: 1093/1096 looper letters, 22 selfloop transitions, 2 changer transitions 0/1034 dead transitions. [2025-02-08 05:38:04,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1006 places, 1034 transitions, 2128 flow [2025-02-08 05:38:04,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:04,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:04,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3187 transitions. [2025-02-08 05:38:04,367 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9692822384428224 [2025-02-08 05:38:04,367 INFO L175 Difference]: Start difference. First operand has 1005 places, 1033 transitions, 2076 flow. Second operand 3 states and 3187 transitions. [2025-02-08 05:38:04,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1006 places, 1034 transitions, 2128 flow [2025-02-08 05:38:04,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1004 places, 1034 transitions, 2124 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:04,377 INFO L231 Difference]: Finished difference. Result has 1004 places, 1032 transitions, 2074 flow [2025-02-08 05:38:04,378 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1096, PETRI_DIFFERENCE_MINUEND_FLOW=2070, PETRI_DIFFERENCE_MINUEND_PLACES=1002, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1032, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1030, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2074, PETRI_PLACES=1004, PETRI_TRANSITIONS=1032} [2025-02-08 05:38:04,378 INFO L279 CegarLoopForPetriNet]: 1029 programPoint places, -25 predicate places. [2025-02-08 05:38:04,379 INFO L471 AbstractCegarLoop]: Abstraction has has 1004 places, 1032 transitions, 2074 flow [2025-02-08 05:38:04,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1055.6666666666667) internal successors, (3167), 3 states have internal predecessors, (3167), 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:38:04,380 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:04,380 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:04,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:38:04,380 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err42ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-02-08 05:38:04,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:04,381 INFO L85 PathProgramCache]: Analyzing trace with hash -2022366215, now seen corresponding path program 1 times [2025-02-08 05:38:04,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:04,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538744139] [2025-02-08 05:38:04,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:04,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:04,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-08 05:38:04,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-08 05:38:04,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:04,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:04,410 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:38:04,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:04,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538744139] [2025-02-08 05:38:04,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538744139] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:04,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:04,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:04,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487564615] [2025-02-08 05:38:04,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:04,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:04,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:04,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:04,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:04,439 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1060 out of 1096 [2025-02-08 05:38:04,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1004 places, 1032 transitions, 2074 flow. Second operand has 3 states, 3 states have (on average 1062.0) internal successors, (3186), 3 states have internal predecessors, (3186), 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:38:04,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:04,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1060 of 1096 [2025-02-08 05:38:04,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:04,801 INFO L124 PetriNetUnfolderBase]: 74/1577 cut-off events. [2025-02-08 05:38:04,801 INFO L125 PetriNetUnfolderBase]: For 11/20 co-relation queries the response was YES. [2025-02-08 05:38:04,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1646 conditions, 1577 events. 74/1577 cut-off events. For 11/20 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 7765 event pairs, 14 based on Foata normal form. 0/1276 useless extension candidates. Maximal degree in co-relation 1429. Up to 43 conditions per place. [2025-02-08 05:38:04,840 INFO L140 encePairwiseOnDemand]: 1093/1096 looper letters, 16 selfloop transitions, 2 changer transitions 0/1033 dead transitions. [2025-02-08 05:38:04,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1005 places, 1033 transitions, 2114 flow [2025-02-08 05:38:04,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:04,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:04,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3199 transitions. [2025-02-08 05:38:04,842 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9729318734793188 [2025-02-08 05:38:04,842 INFO L175 Difference]: Start difference. First operand has 1004 places, 1032 transitions, 2074 flow. Second operand 3 states and 3199 transitions. [2025-02-08 05:38:04,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1005 places, 1033 transitions, 2114 flow [2025-02-08 05:38:04,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1003 places, 1033 transitions, 2110 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:04,851 INFO L231 Difference]: Finished difference. Result has 1003 places, 1031 transitions, 2072 flow [2025-02-08 05:38:04,852 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1096, PETRI_DIFFERENCE_MINUEND_FLOW=2068, PETRI_DIFFERENCE_MINUEND_PLACES=1001, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1031, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1029, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2072, PETRI_PLACES=1003, PETRI_TRANSITIONS=1031} [2025-02-08 05:38:04,852 INFO L279 CegarLoopForPetriNet]: 1029 programPoint places, -26 predicate places. [2025-02-08 05:38:04,852 INFO L471 AbstractCegarLoop]: Abstraction has has 1003 places, 1031 transitions, 2072 flow [2025-02-08 05:38:04,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1062.0) internal successors, (3186), 3 states have internal predecessors, (3186), 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:38:04,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:04,853 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:04,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 05:38:04,853 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err40ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-02-08 05:38:04,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:04,854 INFO L85 PathProgramCache]: Analyzing trace with hash -223960798, now seen corresponding path program 1 times [2025-02-08 05:38:04,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:04,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128489173] [2025-02-08 05:38:04,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:04,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:04,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-08 05:38:04,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-08 05:38:04,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:04,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:04,889 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:38:04,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:04,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128489173] [2025-02-08 05:38:04,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128489173] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:04,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:04,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:04,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031251280] [2025-02-08 05:38:04,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:04,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:04,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:04,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:04,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:04,919 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1040 out of 1096 [2025-02-08 05:38:04,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1003 places, 1031 transitions, 2072 flow. Second operand has 3 states, 3 states have (on average 1041.3333333333333) internal successors, (3124), 3 states have internal predecessors, (3124), 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:38:04,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:04,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1040 of 1096 [2025-02-08 05:38:04,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:06,962 INFO L124 PetriNetUnfolderBase]: 810/10445 cut-off events. [2025-02-08 05:38:06,963 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-08 05:38:07,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11241 conditions, 10445 events. 810/10445 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 101630 event pairs, 190 based on Foata normal form. 0/8314 useless extension candidates. Maximal degree in co-relation 10732. Up to 654 conditions per place. [2025-02-08 05:38:07,161 INFO L140 encePairwiseOnDemand]: 1084/1096 looper letters, 29 selfloop transitions, 2 changer transitions 0/1025 dead transitions. [2025-02-08 05:38:07,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 995 places, 1025 transitions, 2124 flow [2025-02-08 05:38:07,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:07,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:07,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3161 transitions. [2025-02-08 05:38:07,164 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9613746958637469 [2025-02-08 05:38:07,164 INFO L175 Difference]: Start difference. First operand has 1003 places, 1031 transitions, 2072 flow. Second operand 3 states and 3161 transitions. [2025-02-08 05:38:07,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 995 places, 1025 transitions, 2124 flow [2025-02-08 05:38:07,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 993 places, 1025 transitions, 2120 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:07,174 INFO L231 Difference]: Finished difference. Result has 994 places, 1023 transitions, 2062 flow [2025-02-08 05:38:07,175 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1096, PETRI_DIFFERENCE_MINUEND_FLOW=2048, PETRI_DIFFERENCE_MINUEND_PLACES=991, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1021, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1019, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2062, PETRI_PLACES=994, PETRI_TRANSITIONS=1023} [2025-02-08 05:38:07,176 INFO L279 CegarLoopForPetriNet]: 1029 programPoint places, -35 predicate places. [2025-02-08 05:38:07,176 INFO L471 AbstractCegarLoop]: Abstraction has has 994 places, 1023 transitions, 2062 flow [2025-02-08 05:38:07,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1041.3333333333333) internal successors, (3124), 3 states have internal predecessors, (3124), 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:38:07,176 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:07,177 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:07,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 05:38:07,177 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err39ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-02-08 05:38:07,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:07,177 INFO L85 PathProgramCache]: Analyzing trace with hash -477891997, now seen corresponding path program 1 times [2025-02-08 05:38:07,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:07,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537055043] [2025-02-08 05:38:07,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:07,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:07,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-02-08 05:38:07,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-02-08 05:38:07,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:07,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:07,214 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:38:07,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:07,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537055043] [2025-02-08 05:38:07,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537055043] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:07,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:07,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:07,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003045031] [2025-02-08 05:38:07,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:07,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:07,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:07,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:07,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:07,243 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1040 out of 1096 [2025-02-08 05:38:07,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 994 places, 1023 transitions, 2062 flow. Second operand has 3 states, 3 states have (on average 1041.3333333333333) internal successors, (3124), 3 states have internal predecessors, (3124), 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:38:07,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:07,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1040 of 1096 [2025-02-08 05:38:07,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:08,778 INFO L124 PetriNetUnfolderBase]: 426/6233 cut-off events. [2025-02-08 05:38:08,779 INFO L125 PetriNetUnfolderBase]: For 27/73 co-relation queries the response was YES. [2025-02-08 05:38:08,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6605 conditions, 6233 events. 426/6233 cut-off events. For 27/73 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 50574 event pairs, 110 based on Foata normal form. 1/5008 useless extension candidates. Maximal degree in co-relation 6134. Up to 336 conditions per place. [2025-02-08 05:38:08,966 INFO L140 encePairwiseOnDemand]: 1084/1096 looper letters, 29 selfloop transitions, 2 changer transitions 0/1017 dead transitions. [2025-02-08 05:38:08,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 986 places, 1017 transitions, 2114 flow [2025-02-08 05:38:08,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:08,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:08,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3161 transitions. [2025-02-08 05:38:08,967 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9613746958637469 [2025-02-08 05:38:08,967 INFO L175 Difference]: Start difference. First operand has 994 places, 1023 transitions, 2062 flow. Second operand 3 states and 3161 transitions. [2025-02-08 05:38:08,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 986 places, 1017 transitions, 2114 flow [2025-02-08 05:38:08,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 986 places, 1017 transitions, 2114 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:08,976 INFO L231 Difference]: Finished difference. Result has 987 places, 1015 transitions, 2056 flow [2025-02-08 05:38:08,977 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1096, PETRI_DIFFERENCE_MINUEND_FLOW=2042, PETRI_DIFFERENCE_MINUEND_PLACES=984, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1013, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1011, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2056, PETRI_PLACES=987, PETRI_TRANSITIONS=1015} [2025-02-08 05:38:08,977 INFO L279 CegarLoopForPetriNet]: 1029 programPoint places, -42 predicate places. [2025-02-08 05:38:08,977 INFO L471 AbstractCegarLoop]: Abstraction has has 987 places, 1015 transitions, 2056 flow [2025-02-08 05:38:08,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1041.3333333333333) internal successors, (3124), 3 states have internal predecessors, (3124), 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:38:08,978 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:08,978 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:08,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 05:38:08,978 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err41ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-02-08 05:38:08,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:08,978 INFO L85 PathProgramCache]: Analyzing trace with hash -945237891, now seen corresponding path program 1 times [2025-02-08 05:38:08,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:08,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29157245] [2025-02-08 05:38:08,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:08,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:08,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-08 05:38:08,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-08 05:38:08,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:08,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:09,007 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:38:09,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:09,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29157245] [2025-02-08 05:38:09,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29157245] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:09,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:09,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:09,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977922493] [2025-02-08 05:38:09,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:09,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:09,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:09,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:09,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:09,047 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1054 out of 1096 [2025-02-08 05:38:09,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 987 places, 1015 transitions, 2056 flow. Second operand has 3 states, 3 states have (on average 1056.0) internal successors, (3168), 3 states have internal predecessors, (3168), 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:38:09,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:09,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1054 of 1096 [2025-02-08 05:38:09,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:09,600 INFO L124 PetriNetUnfolderBase]: 156/2821 cut-off events. [2025-02-08 05:38:09,600 INFO L125 PetriNetUnfolderBase]: For 17/44 co-relation queries the response was YES. [2025-02-08 05:38:09,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2990 conditions, 2821 events. 156/2821 cut-off events. For 17/44 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 19983 event pairs, 26 based on Foata normal form. 0/2291 useless extension candidates. Maximal degree in co-relation 2210. Up to 106 conditions per place. [2025-02-08 05:38:09,688 INFO L140 encePairwiseOnDemand]: 1093/1096 looper letters, 22 selfloop transitions, 2 changer transitions 0/1016 dead transitions. [2025-02-08 05:38:09,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 988 places, 1016 transitions, 2108 flow [2025-02-08 05:38:09,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:09,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:09,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3187 transitions. [2025-02-08 05:38:09,690 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9692822384428224 [2025-02-08 05:38:09,690 INFO L175 Difference]: Start difference. First operand has 987 places, 1015 transitions, 2056 flow. Second operand 3 states and 3187 transitions. [2025-02-08 05:38:09,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 988 places, 1016 transitions, 2108 flow [2025-02-08 05:38:09,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 988 places, 1016 transitions, 2108 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:09,698 INFO L231 Difference]: Finished difference. Result has 988 places, 1014 transitions, 2058 flow [2025-02-08 05:38:09,699 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1096, PETRI_DIFFERENCE_MINUEND_FLOW=2054, PETRI_DIFFERENCE_MINUEND_PLACES=986, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1014, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1012, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2058, PETRI_PLACES=988, PETRI_TRANSITIONS=1014} [2025-02-08 05:38:09,699 INFO L279 CegarLoopForPetriNet]: 1029 programPoint places, -41 predicate places. [2025-02-08 05:38:09,700 INFO L471 AbstractCegarLoop]: Abstraction has has 988 places, 1014 transitions, 2058 flow [2025-02-08 05:38:09,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1056.0) internal successors, (3168), 3 states have internal predecessors, (3168), 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:38:09,700 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:09,700 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:09,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 05:38:09,700 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err42ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-02-08 05:38:09,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:09,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1654925093, now seen corresponding path program 1 times [2025-02-08 05:38:09,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:09,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300391171] [2025-02-08 05:38:09,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:09,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:09,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-02-08 05:38:09,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-02-08 05:38:09,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:09,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:09,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:09,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:09,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300391171] [2025-02-08 05:38:09,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300391171] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:09,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:09,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:09,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306647743] [2025-02-08 05:38:09,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:09,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:09,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:09,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:09,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:09,752 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1060 out of 1096 [2025-02-08 05:38:09,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 988 places, 1014 transitions, 2058 flow. Second operand has 3 states, 3 states have (on average 1062.3333333333333) internal successors, (3187), 3 states have internal predecessors, (3187), 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:38:09,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:09,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1060 of 1096 [2025-02-08 05:38:09,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:10,244 INFO L124 PetriNetUnfolderBase]: 87/1795 cut-off events. [2025-02-08 05:38:10,244 INFO L125 PetriNetUnfolderBase]: For 19/33 co-relation queries the response was YES. [2025-02-08 05:38:10,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1875 conditions, 1795 events. 87/1795 cut-off events. For 19/33 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 10415 event pairs, 9 based on Foata normal form. 1/1478 useless extension candidates. Maximal degree in co-relation 1648. Up to 48 conditions per place. [2025-02-08 05:38:10,304 INFO L140 encePairwiseOnDemand]: 1093/1096 looper letters, 16 selfloop transitions, 2 changer transitions 0/1015 dead transitions. [2025-02-08 05:38:10,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 989 places, 1015 transitions, 2098 flow [2025-02-08 05:38:10,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:10,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:10,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3199 transitions. [2025-02-08 05:38:10,306 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9729318734793188 [2025-02-08 05:38:10,306 INFO L175 Difference]: Start difference. First operand has 988 places, 1014 transitions, 2058 flow. Second operand 3 states and 3199 transitions. [2025-02-08 05:38:10,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 989 places, 1015 transitions, 2098 flow [2025-02-08 05:38:10,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 987 places, 1015 transitions, 2094 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:10,316 INFO L231 Difference]: Finished difference. Result has 987 places, 1013 transitions, 2056 flow [2025-02-08 05:38:10,317 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1096, PETRI_DIFFERENCE_MINUEND_FLOW=2052, PETRI_DIFFERENCE_MINUEND_PLACES=985, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1013, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1011, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2056, PETRI_PLACES=987, PETRI_TRANSITIONS=1013} [2025-02-08 05:38:10,317 INFO L279 CegarLoopForPetriNet]: 1029 programPoint places, -42 predicate places. [2025-02-08 05:38:10,317 INFO L471 AbstractCegarLoop]: Abstraction has has 987 places, 1013 transitions, 2056 flow [2025-02-08 05:38:10,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1062.3333333333333) internal successors, (3187), 3 states have internal predecessors, (3187), 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:38:10,318 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:10,318 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:10,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 05:38:10,318 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err38ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-02-08 05:38:10,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:10,319 INFO L85 PathProgramCache]: Analyzing trace with hash 938282321, now seen corresponding path program 1 times [2025-02-08 05:38:10,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:10,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613093653] [2025-02-08 05:38:10,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:10,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:10,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-08 05:38:10,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-08 05:38:10,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:10,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:10,357 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:38:10,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:10,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613093653] [2025-02-08 05:38:10,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613093653] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:10,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:10,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:10,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847734028] [2025-02-08 05:38:10,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:10,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:10,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:10,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:10,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:10,388 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1051 out of 1096 [2025-02-08 05:38:10,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 987 places, 1013 transitions, 2056 flow. Second operand has 3 states, 3 states have (on average 1052.3333333333333) internal successors, (3157), 3 states have internal predecessors, (3157), 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:38:10,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:10,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1051 of 1096 [2025-02-08 05:38:10,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:11,387 INFO L124 PetriNetUnfolderBase]: 176/3703 cut-off events. [2025-02-08 05:38:11,387 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-02-08 05:38:11,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3843 conditions, 3703 events. 176/3703 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 25185 event pairs, 8 based on Foata normal form. 0/3013 useless extension candidates. Maximal degree in co-relation 3370. Up to 42 conditions per place. [2025-02-08 05:38:11,504 INFO L140 encePairwiseOnDemand]: 1082/1096 looper letters, 17 selfloop transitions, 9 changer transitions 0/1013 dead transitions. [2025-02-08 05:38:11,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 984 places, 1013 transitions, 2110 flow [2025-02-08 05:38:11,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:11,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:11,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3184 transitions. [2025-02-08 05:38:11,506 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9683698296836983 [2025-02-08 05:38:11,506 INFO L175 Difference]: Start difference. First operand has 987 places, 1013 transitions, 2056 flow. Second operand 3 states and 3184 transitions. [2025-02-08 05:38:11,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 984 places, 1013 transitions, 2110 flow [2025-02-08 05:38:11,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 982 places, 1013 transitions, 2106 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:11,515 INFO L231 Difference]: Finished difference. Result has 983 places, 1011 transitions, 2081 flow [2025-02-08 05:38:11,516 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1096, PETRI_DIFFERENCE_MINUEND_FLOW=2042, PETRI_DIFFERENCE_MINUEND_PLACES=980, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1008, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=999, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2081, PETRI_PLACES=983, PETRI_TRANSITIONS=1011} [2025-02-08 05:38:11,516 INFO L279 CegarLoopForPetriNet]: 1029 programPoint places, -46 predicate places. [2025-02-08 05:38:11,516 INFO L471 AbstractCegarLoop]: Abstraction has has 983 places, 1011 transitions, 2081 flow [2025-02-08 05:38:11,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1052.3333333333333) internal successors, (3157), 3 states have internal predecessors, (3157), 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:38:11,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:11,517 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:11,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 05:38:11,517 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err37ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-02-08 05:38:11,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:11,518 INFO L85 PathProgramCache]: Analyzing trace with hash 694064745, now seen corresponding path program 1 times [2025-02-08 05:38:11,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:11,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136214001] [2025-02-08 05:38:11,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:11,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:11,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-08 05:38:11,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-08 05:38:11,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:11,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:11,543 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:38:11,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:11,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136214001] [2025-02-08 05:38:11,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136214001] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:11,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:11,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:11,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444531895] [2025-02-08 05:38:11,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:11,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:11,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:11,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:11,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:11,572 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1057 out of 1096 [2025-02-08 05:38:11,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 983 places, 1011 transitions, 2081 flow. Second operand has 3 states, 3 states have (on average 1058.6666666666667) internal successors, (3176), 3 states have internal predecessors, (3176), 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:38:11,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:11,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1057 of 1096 [2025-02-08 05:38:11,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:12,241 INFO L124 PetriNetUnfolderBase]: 170/3594 cut-off events. [2025-02-08 05:38:12,241 INFO L125 PetriNetUnfolderBase]: For 58/74 co-relation queries the response was YES. [2025-02-08 05:38:12,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3768 conditions, 3594 events. 170/3594 cut-off events. For 58/74 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 27619 event pairs, 20 based on Foata normal form. 1/2937 useless extension candidates. Maximal degree in co-relation 3294. Up to 65 conditions per place. [2025-02-08 05:38:12,357 INFO L140 encePairwiseOnDemand]: 1093/1096 looper letters, 21 selfloop transitions, 3 changer transitions 0/1012 dead transitions. [2025-02-08 05:38:12,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 984 places, 1012 transitions, 2133 flow [2025-02-08 05:38:12,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:12,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:12,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3193 transitions. [2025-02-08 05:38:12,359 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9711070559610706 [2025-02-08 05:38:12,359 INFO L175 Difference]: Start difference. First operand has 983 places, 1011 transitions, 2081 flow. Second operand 3 states and 3193 transitions. [2025-02-08 05:38:12,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 984 places, 1012 transitions, 2133 flow [2025-02-08 05:38:12,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 983 places, 1012 transitions, 2124 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:38:12,368 INFO L231 Difference]: Finished difference. Result has 983 places, 1010 transitions, 2076 flow [2025-02-08 05:38:12,369 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1096, PETRI_DIFFERENCE_MINUEND_FLOW=2070, PETRI_DIFFERENCE_MINUEND_PLACES=981, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1010, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1007, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2076, PETRI_PLACES=983, PETRI_TRANSITIONS=1010} [2025-02-08 05:38:12,369 INFO L279 CegarLoopForPetriNet]: 1029 programPoint places, -46 predicate places. [2025-02-08 05:38:12,369 INFO L471 AbstractCegarLoop]: Abstraction has has 983 places, 1010 transitions, 2076 flow [2025-02-08 05:38:12,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1058.6666666666667) internal successors, (3176), 3 states have internal predecessors, (3176), 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:38:12,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:12,370 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:12,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-08 05:38:12,370 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err39ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-02-08 05:38:12,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:12,371 INFO L85 PathProgramCache]: Analyzing trace with hash 309835039, now seen corresponding path program 1 times [2025-02-08 05:38:12,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:12,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869684879] [2025-02-08 05:38:12,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:12,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:12,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-08 05:38:12,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-08 05:38:12,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:12,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:12,398 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:38:12,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:12,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869684879] [2025-02-08 05:38:12,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869684879] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:12,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:12,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:12,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511370046] [2025-02-08 05:38:12,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:12,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:12,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:12,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:12,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:12,423 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1040 out of 1096 [2025-02-08 05:38:12,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 983 places, 1010 transitions, 2076 flow. Second operand has 3 states, 3 states have (on average 1041.6666666666667) internal successors, (3125), 3 states have internal predecessors, (3125), 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:38:12,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:12,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1040 of 1096 [2025-02-08 05:38:12,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:15,740 INFO L124 PetriNetUnfolderBase]: 1497/19600 cut-off events. [2025-02-08 05:38:15,741 INFO L125 PetriNetUnfolderBase]: For 143/149 co-relation queries the response was YES. [2025-02-08 05:38:15,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20843 conditions, 19600 events. 1497/19600 cut-off events. For 143/149 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 218708 event pairs, 370 based on Foata normal form. 0/15745 useless extension candidates. Maximal degree in co-relation 15656. Up to 1182 conditions per place. [2025-02-08 05:38:15,986 INFO L140 encePairwiseOnDemand]: 1084/1096 looper letters, 29 selfloop transitions, 2 changer transitions 0/1004 dead transitions. [2025-02-08 05:38:15,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 975 places, 1004 transitions, 2128 flow [2025-02-08 05:38:15,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:15,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:15,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3161 transitions. [2025-02-08 05:38:15,988 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9613746958637469 [2025-02-08 05:38:15,988 INFO L175 Difference]: Start difference. First operand has 983 places, 1010 transitions, 2076 flow. Second operand 3 states and 3161 transitions. [2025-02-08 05:38:15,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 975 places, 1004 transitions, 2128 flow [2025-02-08 05:38:15,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 973 places, 1004 transitions, 2122 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:15,997 INFO L231 Difference]: Finished difference. Result has 974 places, 1002 transitions, 2064 flow [2025-02-08 05:38:15,998 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1096, PETRI_DIFFERENCE_MINUEND_FLOW=2050, PETRI_DIFFERENCE_MINUEND_PLACES=971, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1000, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=998, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2064, PETRI_PLACES=974, PETRI_TRANSITIONS=1002} [2025-02-08 05:38:15,999 INFO L279 CegarLoopForPetriNet]: 1029 programPoint places, -55 predicate places. [2025-02-08 05:38:15,999 INFO L471 AbstractCegarLoop]: Abstraction has has 974 places, 1002 transitions, 2064 flow [2025-02-08 05:38:15,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1041.6666666666667) internal successors, (3125), 3 states have internal predecessors, (3125), 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:38:15,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:15,999 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:15,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-08 05:38:15,999 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread3Err41ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-02-08 05:38:16,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:16,000 INFO L85 PathProgramCache]: Analyzing trace with hash 720541163, now seen corresponding path program 1 times [2025-02-08 05:38:16,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:16,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49015892] [2025-02-08 05:38:16,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:16,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:16,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-02-08 05:38:16,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-02-08 05:38:16,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:16,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:16,027 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:38:16,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:16,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49015892] [2025-02-08 05:38:16,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49015892] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:16,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:16,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:16,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023025074] [2025-02-08 05:38:16,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:16,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:16,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:16,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:16,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:16,064 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1054 out of 1096 [2025-02-08 05:38:16,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 974 places, 1002 transitions, 2064 flow. Second operand has 3 states, 3 states have (on average 1056.3333333333333) internal successors, (3169), 3 states have internal predecessors, (3169), 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:38:16,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:16,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1054 of 1096 [2025-02-08 05:38:16,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:16,551 INFO L124 PetriNetUnfolderBase]: 158/2767 cut-off events. [2025-02-08 05:38:16,551 INFO L125 PetriNetUnfolderBase]: For 42/56 co-relation queries the response was YES. [2025-02-08 05:38:16,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2967 conditions, 2767 events. 158/2767 cut-off events. For 42/56 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 20500 event pairs, 15 based on Foata normal form. 1/2293 useless extension candidates. Maximal degree in co-relation 2240. Up to 139 conditions per place. [2025-02-08 05:38:16,623 INFO L140 encePairwiseOnDemand]: 1093/1096 looper letters, 22 selfloop transitions, 2 changer transitions 0/1003 dead transitions. [2025-02-08 05:38:16,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 975 places, 1003 transitions, 2116 flow [2025-02-08 05:38:16,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:16,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:16,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3187 transitions. [2025-02-08 05:38:16,625 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9692822384428224 [2025-02-08 05:38:16,625 INFO L175 Difference]: Start difference. First operand has 974 places, 1002 transitions, 2064 flow. Second operand 3 states and 3187 transitions. [2025-02-08 05:38:16,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 975 places, 1003 transitions, 2116 flow [2025-02-08 05:38:16,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 975 places, 1003 transitions, 2116 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:16,633 INFO L231 Difference]: Finished difference. Result has 975 places, 1001 transitions, 2066 flow [2025-02-08 05:38:16,633 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1096, PETRI_DIFFERENCE_MINUEND_FLOW=2062, PETRI_DIFFERENCE_MINUEND_PLACES=973, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1001, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=999, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2066, PETRI_PLACES=975, PETRI_TRANSITIONS=1001} [2025-02-08 05:38:16,634 INFO L279 CegarLoopForPetriNet]: 1029 programPoint places, -54 predicate places. [2025-02-08 05:38:16,634 INFO L471 AbstractCegarLoop]: Abstraction has has 975 places, 1001 transitions, 2066 flow [2025-02-08 05:38:16,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1056.3333333333333) internal successors, (3169), 3 states have internal predecessors, (3169), 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:38:16,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:16,634 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:16,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-08 05:38:16,635 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err38ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-02-08 05:38:16,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:16,635 INFO L85 PathProgramCache]: Analyzing trace with hash 413376549, now seen corresponding path program 1 times [2025-02-08 05:38:16,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:16,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847727906] [2025-02-08 05:38:16,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:16,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:16,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-02-08 05:38:16,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-02-08 05:38:16,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:16,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:16,667 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:38:16,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:16,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847727906] [2025-02-08 05:38:16,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847727906] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:16,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:16,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:16,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421714104] [2025-02-08 05:38:16,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:16,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:16,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:16,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:16,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:16,695 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1048 out of 1096 [2025-02-08 05:38:16,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 975 places, 1001 transitions, 2066 flow. Second operand has 3 states, 3 states have (on average 1049.6666666666667) internal successors, (3149), 3 states have internal predecessors, (3149), 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:38:16,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:16,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1048 of 1096 [2025-02-08 05:38:16,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:17,634 INFO L124 PetriNetUnfolderBase]: 275/5381 cut-off events. [2025-02-08 05:38:17,635 INFO L125 PetriNetUnfolderBase]: For 14/30 co-relation queries the response was YES. [2025-02-08 05:38:17,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5629 conditions, 5381 events. 275/5381 cut-off events. For 14/30 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 43682 event pairs, 12 based on Foata normal form. 0/4436 useless extension candidates. Maximal degree in co-relation 5280. Up to 68 conditions per place. [2025-02-08 05:38:17,755 INFO L140 encePairwiseOnDemand]: 1081/1096 looper letters, 19 selfloop transitions, 9 changer transitions 0/1000 dead transitions. [2025-02-08 05:38:17,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 971 places, 1000 transitions, 2122 flow [2025-02-08 05:38:17,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:17,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:17,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3178 transitions. [2025-02-08 05:38:17,757 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9665450121654501 [2025-02-08 05:38:17,757 INFO L175 Difference]: Start difference. First operand has 975 places, 1001 transitions, 2066 flow. Second operand 3 states and 3178 transitions. [2025-02-08 05:38:17,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 971 places, 1000 transitions, 2122 flow [2025-02-08 05:38:17,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 969 places, 1000 transitions, 2118 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:17,765 INFO L231 Difference]: Finished difference. Result has 970 places, 998 transitions, 2089 flow [2025-02-08 05:38:17,766 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1096, PETRI_DIFFERENCE_MINUEND_FLOW=2050, PETRI_DIFFERENCE_MINUEND_PLACES=967, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=995, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=986, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2089, PETRI_PLACES=970, PETRI_TRANSITIONS=998} [2025-02-08 05:38:17,767 INFO L279 CegarLoopForPetriNet]: 1029 programPoint places, -59 predicate places. [2025-02-08 05:38:17,767 INFO L471 AbstractCegarLoop]: Abstraction has has 970 places, 998 transitions, 2089 flow [2025-02-08 05:38:17,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1049.6666666666667) internal successors, (3149), 3 states have internal predecessors, (3149), 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:38:17,767 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:17,767 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:17,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-08 05:38:17,767 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err37ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-02-08 05:38:17,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:17,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1202405925, now seen corresponding path program 1 times [2025-02-08 05:38:17,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:17,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840473194] [2025-02-08 05:38:17,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:17,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:17,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-02-08 05:38:17,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-02-08 05:38:17,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:17,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:17,795 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:38:17,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:17,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840473194] [2025-02-08 05:38:17,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840473194] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:17,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:17,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:17,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458186875] [2025-02-08 05:38:17,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:17,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:17,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:17,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:17,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:17,827 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1056 out of 1096 [2025-02-08 05:38:17,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 970 places, 998 transitions, 2089 flow. Second operand has 3 states, 3 states have (on average 1058.0) internal successors, (3174), 3 states have internal predecessors, (3174), 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:38:17,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:17,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1056 of 1096 [2025-02-08 05:38:17,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:18,802 INFO L124 PetriNetUnfolderBase]: 265/5250 cut-off events. [2025-02-08 05:38:18,802 INFO L125 PetriNetUnfolderBase]: For 108/161 co-relation queries the response was YES. [2025-02-08 05:38:18,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5546 conditions, 5250 events. 265/5250 cut-off events. For 108/161 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 46401 event pairs, 24 based on Foata normal form. 0/4332 useless extension candidates. Maximal degree in co-relation 4972. Up to 100 conditions per place. [2025-02-08 05:38:18,931 INFO L140 encePairwiseOnDemand]: 1093/1096 looper letters, 22 selfloop transitions, 3 changer transitions 0/999 dead transitions. [2025-02-08 05:38:18,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 971 places, 999 transitions, 2143 flow [2025-02-08 05:38:18,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:18,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:18,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3191 transitions. [2025-02-08 05:38:18,933 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704987834549879 [2025-02-08 05:38:18,933 INFO L175 Difference]: Start difference. First operand has 970 places, 998 transitions, 2089 flow. Second operand 3 states and 3191 transitions. [2025-02-08 05:38:18,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 971 places, 999 transitions, 2143 flow [2025-02-08 05:38:18,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 970 places, 999 transitions, 2134 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:38:18,942 INFO L231 Difference]: Finished difference. Result has 970 places, 997 transitions, 2084 flow [2025-02-08 05:38:18,947 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1096, PETRI_DIFFERENCE_MINUEND_FLOW=2078, PETRI_DIFFERENCE_MINUEND_PLACES=968, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=997, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=994, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2084, PETRI_PLACES=970, PETRI_TRANSITIONS=997} [2025-02-08 05:38:18,948 INFO L279 CegarLoopForPetriNet]: 1029 programPoint places, -59 predicate places. [2025-02-08 05:38:18,951 INFO L471 AbstractCegarLoop]: Abstraction has has 970 places, 997 transitions, 2084 flow [2025-02-08 05:38:18,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1058.0) internal successors, (3174), 3 states have internal predecessors, (3174), 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:38:18,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:18,952 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:18,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-08 05:38:18,953 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-02-08 05:38:18,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:18,953 INFO L85 PathProgramCache]: Analyzing trace with hash 888474108, now seen corresponding path program 1 times [2025-02-08 05:38:18,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:18,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793912830] [2025-02-08 05:38:18,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:18,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:18,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-02-08 05:38:18,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-02-08 05:38:18,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:18,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:18,981 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:38:18,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:18,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793912830] [2025-02-08 05:38:18,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793912830] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:18,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:18,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:38:18,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209268991] [2025-02-08 05:38:18,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:18,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:18,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:18,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:18,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:19,016 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1063 out of 1096 [2025-02-08 05:38:19,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 970 places, 997 transitions, 2084 flow. Second operand has 3 states, 3 states have (on average 1065.3333333333333) internal successors, (3196), 3 states have internal predecessors, (3196), 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:38:19,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:19,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1063 of 1096 [2025-02-08 05:38:19,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:19,916 INFO L124 PetriNetUnfolderBase]: 198/4476 cut-off events. [2025-02-08 05:38:19,916 INFO L125 PetriNetUnfolderBase]: For 12/22 co-relation queries the response was YES. [2025-02-08 05:38:19,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4670 conditions, 4476 events. 198/4476 cut-off events. For 12/22 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 37247 event pairs, 4 based on Foata normal form. 1/3716 useless extension candidates. Maximal degree in co-relation 3931. Up to 29 conditions per place. [2025-02-08 05:38:20,025 INFO L140 encePairwiseOnDemand]: 1093/1096 looper letters, 18 selfloop transitions, 2 changer transitions 0/1003 dead transitions. [2025-02-08 05:38:20,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 972 places, 1003 transitions, 2141 flow [2025-02-08 05:38:20,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:20,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:20,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3210 transitions. [2025-02-08 05:38:20,027 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9762773722627737 [2025-02-08 05:38:20,027 INFO L175 Difference]: Start difference. First operand has 970 places, 997 transitions, 2084 flow. Second operand 3 states and 3210 transitions. [2025-02-08 05:38:20,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 972 places, 1003 transitions, 2141 flow [2025-02-08 05:38:20,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 970 places, 1003 transitions, 2135 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:20,036 INFO L231 Difference]: Finished difference. Result has 972 places, 998 transitions, 2092 flow [2025-02-08 05:38:20,037 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1096, PETRI_DIFFERENCE_MINUEND_FLOW=2078, PETRI_DIFFERENCE_MINUEND_PLACES=968, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=997, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=995, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2092, PETRI_PLACES=972, PETRI_TRANSITIONS=998} [2025-02-08 05:38:20,038 INFO L279 CegarLoopForPetriNet]: 1029 programPoint places, -57 predicate places. [2025-02-08 05:38:20,038 INFO L471 AbstractCegarLoop]: Abstraction has has 972 places, 998 transitions, 2092 flow [2025-02-08 05:38:20,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1065.3333333333333) internal successors, (3196), 3 states have internal predecessors, (3196), 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:38:20,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:20,038 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:20,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-08 05:38:20,039 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread3Err38ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-02-08 05:38:20,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:20,039 INFO L85 PathProgramCache]: Analyzing trace with hash -180510829, now seen corresponding path program 1 times [2025-02-08 05:38:20,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:20,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926338974] [2025-02-08 05:38:20,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:20,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:20,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-02-08 05:38:20,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-02-08 05:38:20,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:20,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:20,073 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:38:20,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:20,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926338974] [2025-02-08 05:38:20,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926338974] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:20,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:20,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:20,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675645692] [2025-02-08 05:38:20,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:20,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:20,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:20,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:20,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:20,104 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1048 out of 1096 [2025-02-08 05:38:20,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 972 places, 998 transitions, 2092 flow. Second operand has 3 states, 3 states have (on average 1050.0) internal successors, (3150), 3 states have internal predecessors, (3150), 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:38:20,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:20,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1048 of 1096 [2025-02-08 05:38:20,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:20,895 INFO L124 PetriNetUnfolderBase]: 240/3977 cut-off events. [2025-02-08 05:38:20,896 INFO L125 PetriNetUnfolderBase]: For 69/81 co-relation queries the response was YES. [2025-02-08 05:38:20,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4319 conditions, 3977 events. 240/3977 cut-off events. For 69/81 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 31744 event pairs, 42 based on Foata normal form. 3/3319 useless extension candidates. Maximal degree in co-relation 3565. Up to 142 conditions per place. [2025-02-08 05:38:21,009 INFO L140 encePairwiseOnDemand]: 1081/1096 looper letters, 15 selfloop transitions, 8 changer transitions 14/997 dead transitions. [2025-02-08 05:38:21,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 968 places, 997 transitions, 2146 flow [2025-02-08 05:38:21,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:21,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:21,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3177 transitions. [2025-02-08 05:38:21,011 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9662408759124088 [2025-02-08 05:38:21,011 INFO L175 Difference]: Start difference. First operand has 972 places, 998 transitions, 2092 flow. Second operand 3 states and 3177 transitions. [2025-02-08 05:38:21,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 968 places, 997 transitions, 2146 flow [2025-02-08 05:38:21,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 967 places, 997 transitions, 2144 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:38:21,019 INFO L231 Difference]: Finished difference. Result has 968 places, 981 transitions, 2081 flow [2025-02-08 05:38:21,020 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1096, PETRI_DIFFERENCE_MINUEND_FLOW=2078, PETRI_DIFFERENCE_MINUEND_PLACES=965, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=992, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=984, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2081, PETRI_PLACES=968, PETRI_TRANSITIONS=981} [2025-02-08 05:38:21,021 INFO L279 CegarLoopForPetriNet]: 1029 programPoint places, -61 predicate places. [2025-02-08 05:38:21,021 INFO L471 AbstractCegarLoop]: Abstraction has has 968 places, 981 transitions, 2081 flow [2025-02-08 05:38:21,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1050.0) internal successors, (3150), 3 states have internal predecessors, (3150), 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:38:21,021 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:21,022 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:21,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-08 05:38:21,022 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-02-08 05:38:21,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:21,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1112202553, now seen corresponding path program 1 times [2025-02-08 05:38:21,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:21,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903810550] [2025-02-08 05:38:21,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:21,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:21,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-02-08 05:38:21,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-02-08 05:38:21,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:21,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:21,047 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:38:21,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:21,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903810550] [2025-02-08 05:38:21,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903810550] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:21,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:21,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:21,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028741355] [2025-02-08 05:38:21,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:21,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:21,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:21,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:21,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:21,085 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1042 out of 1096 [2025-02-08 05:38:21,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 968 places, 981 transitions, 2081 flow. Second operand has 3 states, 3 states have (on average 1043.6666666666667) internal successors, (3131), 3 states have internal predecessors, (3131), 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:38:21,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:21,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1042 of 1096 [2025-02-08 05:38:21,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:22,886 INFO L124 PetriNetUnfolderBase]: 454/8772 cut-off events. [2025-02-08 05:38:22,887 INFO L125 PetriNetUnfolderBase]: For 80/116 co-relation queries the response was YES. [2025-02-08 05:38:23,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9601 conditions, 8772 events. 454/8772 cut-off events. For 80/116 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 80192 event pairs, 14 based on Foata normal form. 2/7380 useless extension candidates. Maximal degree in co-relation 8774. Up to 166 conditions per place. [2025-02-08 05:38:23,072 INFO L140 encePairwiseOnDemand]: 1079/1096 looper letters, 23 selfloop transitions, 9 changer transitions 0/979 dead transitions. [2025-02-08 05:38:23,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 948 places, 979 transitions, 2143 flow [2025-02-08 05:38:23,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:23,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:23,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3166 transitions. [2025-02-08 05:38:23,074 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9628953771289538 [2025-02-08 05:38:23,075 INFO L175 Difference]: Start difference. First operand has 968 places, 981 transitions, 2081 flow. Second operand 3 states and 3166 transitions. [2025-02-08 05:38:23,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 948 places, 979 transitions, 2143 flow [2025-02-08 05:38:23,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 947 places, 979 transitions, 2135 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:38:23,084 INFO L231 Difference]: Finished difference. Result has 949 places, 977 transitions, 2109 flow [2025-02-08 05:38:23,085 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1096, PETRI_DIFFERENCE_MINUEND_FLOW=2057, PETRI_DIFFERENCE_MINUEND_PLACES=945, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=973, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=964, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2109, PETRI_PLACES=949, PETRI_TRANSITIONS=977} [2025-02-08 05:38:23,086 INFO L279 CegarLoopForPetriNet]: 1029 programPoint places, -80 predicate places. [2025-02-08 05:38:23,086 INFO L471 AbstractCegarLoop]: Abstraction has has 949 places, 977 transitions, 2109 flow [2025-02-08 05:38:23,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1043.6666666666667) internal successors, (3131), 3 states have internal predecessors, (3131), 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:38:23,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:23,086 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:23,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-08 05:38:23,087 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread1Err33ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-02-08 05:38:23,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:23,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1378671758, now seen corresponding path program 1 times [2025-02-08 05:38:23,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:23,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582066719] [2025-02-08 05:38:23,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:23,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:23,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-08 05:38:23,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-08 05:38:23,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:23,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:23,112 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:38:23,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:23,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582066719] [2025-02-08 05:38:23,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582066719] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:23,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:23,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:23,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842830758] [2025-02-08 05:38:23,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:23,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:23,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:23,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:23,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:23,154 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1054 out of 1096 [2025-02-08 05:38:23,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 949 places, 977 transitions, 2109 flow. Second operand has 3 states, 3 states have (on average 1056.0) internal successors, (3168), 3 states have internal predecessors, (3168), 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:38:23,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:23,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1054 of 1096 [2025-02-08 05:38:23,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:24,674 INFO L124 PetriNetUnfolderBase]: 342/6858 cut-off events. [2025-02-08 05:38:24,674 INFO L125 PetriNetUnfolderBase]: For 166/204 co-relation queries the response was YES. [2025-02-08 05:38:24,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7555 conditions, 6858 events. 342/6858 cut-off events. For 166/204 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 65757 event pairs, 48 based on Foata normal form. 2/5784 useless extension candidates. Maximal degree in co-relation 6040. Up to 147 conditions per place. [2025-02-08 05:38:24,940 INFO L140 encePairwiseOnDemand]: 1093/1096 looper letters, 24 selfloop transitions, 3 changer transitions 0/978 dead transitions. [2025-02-08 05:38:24,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 950 places, 978 transitions, 2167 flow [2025-02-08 05:38:24,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:24,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:24,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3186 transitions. [2025-02-08 05:38:24,943 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.968978102189781 [2025-02-08 05:38:24,943 INFO L175 Difference]: Start difference. First operand has 949 places, 977 transitions, 2109 flow. Second operand 3 states and 3186 transitions. [2025-02-08 05:38:24,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 950 places, 978 transitions, 2167 flow [2025-02-08 05:38:24,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 948 places, 978 transitions, 2149 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:24,951 INFO L231 Difference]: Finished difference. Result has 948 places, 976 transitions, 2095 flow [2025-02-08 05:38:24,952 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1096, PETRI_DIFFERENCE_MINUEND_FLOW=2089, PETRI_DIFFERENCE_MINUEND_PLACES=946, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=976, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=973, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2095, PETRI_PLACES=948, PETRI_TRANSITIONS=976} [2025-02-08 05:38:24,952 INFO L279 CegarLoopForPetriNet]: 1029 programPoint places, -81 predicate places. [2025-02-08 05:38:24,953 INFO L471 AbstractCegarLoop]: Abstraction has has 948 places, 976 transitions, 2095 flow [2025-02-08 05:38:24,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1056.0) internal successors, (3168), 3 states have internal predecessors, (3168), 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:38:24,953 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:24,953 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:24,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-08 05:38:24,953 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread3Err37ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-02-08 05:38:24,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:24,954 INFO L85 PathProgramCache]: Analyzing trace with hash -325909753, now seen corresponding path program 1 times [2025-02-08 05:38:24,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:24,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265108214] [2025-02-08 05:38:24,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:24,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:24,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-08 05:38:24,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-08 05:38:24,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:24,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:24,983 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:38:24,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:24,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265108214] [2025-02-08 05:38:24,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265108214] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:24,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:24,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:24,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519195839] [2025-02-08 05:38:24,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:24,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:24,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:24,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:24,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:25,014 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1056 out of 1096 [2025-02-08 05:38:25,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 948 places, 976 transitions, 2095 flow. Second operand has 3 states, 3 states have (on average 1058.3333333333333) internal successors, (3175), 3 states have internal predecessors, (3175), 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:38:25,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:25,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1056 of 1096 [2025-02-08 05:38:25,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:25,836 INFO L124 PetriNetUnfolderBase]: 228/3651 cut-off events. [2025-02-08 05:38:25,837 INFO L125 PetriNetUnfolderBase]: For 174/192 co-relation queries the response was YES. [2025-02-08 05:38:25,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4137 conditions, 3651 events. 228/3651 cut-off events. For 174/192 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 29951 event pairs, 36 based on Foata normal form. 1/3070 useless extension candidates. Maximal degree in co-relation 3484. Up to 201 conditions per place. [2025-02-08 05:38:25,965 INFO L140 encePairwiseOnDemand]: 1093/1096 looper letters, 19 selfloop transitions, 3 changer transitions 0/977 dead transitions. [2025-02-08 05:38:25,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 949 places, 977 transitions, 2143 flow [2025-02-08 05:38:25,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:25,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:25,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3188 transitions. [2025-02-08 05:38:25,967 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9695863746958637 [2025-02-08 05:38:25,967 INFO L175 Difference]: Start difference. First operand has 948 places, 976 transitions, 2095 flow. Second operand 3 states and 3188 transitions. [2025-02-08 05:38:25,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 949 places, 977 transitions, 2143 flow [2025-02-08 05:38:25,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 947 places, 977 transitions, 2137 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:25,976 INFO L231 Difference]: Finished difference. Result has 947 places, 975 transitions, 2093 flow [2025-02-08 05:38:25,977 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1096, PETRI_DIFFERENCE_MINUEND_FLOW=2087, PETRI_DIFFERENCE_MINUEND_PLACES=945, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=975, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=972, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2093, PETRI_PLACES=947, PETRI_TRANSITIONS=975} [2025-02-08 05:38:25,977 INFO L279 CegarLoopForPetriNet]: 1029 programPoint places, -82 predicate places. [2025-02-08 05:38:25,977 INFO L471 AbstractCegarLoop]: Abstraction has has 947 places, 975 transitions, 2093 flow [2025-02-08 05:38:25,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1058.3333333333333) internal successors, (3175), 3 states have internal predecessors, (3175), 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:38:25,978 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:25,978 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:25,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-08 05:38:25,978 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-02-08 05:38:25,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:25,979 INFO L85 PathProgramCache]: Analyzing trace with hash -589608240, now seen corresponding path program 1 times [2025-02-08 05:38:25,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:25,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108713294] [2025-02-08 05:38:25,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:25,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:25,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-02-08 05:38:25,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-02-08 05:38:25,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:25,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:26,005 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:38:26,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:26,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108713294] [2025-02-08 05:38:26,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108713294] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:26,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:26,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:38:26,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301833274] [2025-02-08 05:38:26,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:26,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:26,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:26,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:26,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:26,037 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1063 out of 1096 [2025-02-08 05:38:26,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 947 places, 975 transitions, 2093 flow. Second operand has 3 states, 3 states have (on average 1065.6666666666667) internal successors, (3197), 3 states have internal predecessors, (3197), 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:38:26,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:26,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1063 of 1096 [2025-02-08 05:38:26,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:27,805 INFO L124 PetriNetUnfolderBase]: 246/5533 cut-off events. [2025-02-08 05:38:27,806 INFO L125 PetriNetUnfolderBase]: For 34/90 co-relation queries the response was YES. [2025-02-08 05:38:27,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5940 conditions, 5533 events. 246/5533 cut-off events. For 34/90 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 48917 event pairs, 8 based on Foata normal form. 0/4649 useless extension candidates. Maximal degree in co-relation 4797. Up to 78 conditions per place. [2025-02-08 05:38:28,026 INFO L140 encePairwiseOnDemand]: 1093/1096 looper letters, 15 selfloop transitions, 2 changer transitions 0/979 dead transitions. [2025-02-08 05:38:28,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 949 places, 979 transitions, 2138 flow [2025-02-08 05:38:28,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:28,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:28,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3207 transitions. [2025-02-08 05:38:28,029 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9753649635036497 [2025-02-08 05:38:28,029 INFO L175 Difference]: Start difference. First operand has 947 places, 975 transitions, 2093 flow. Second operand 3 states and 3207 transitions. [2025-02-08 05:38:28,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 949 places, 979 transitions, 2138 flow [2025-02-08 05:38:28,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 947 places, 979 transitions, 2132 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:28,041 INFO L231 Difference]: Finished difference. Result has 949 places, 976 transitions, 2101 flow [2025-02-08 05:38:28,042 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1096, PETRI_DIFFERENCE_MINUEND_FLOW=2087, PETRI_DIFFERENCE_MINUEND_PLACES=945, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=975, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=973, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2101, PETRI_PLACES=949, PETRI_TRANSITIONS=976} [2025-02-08 05:38:28,042 INFO L279 CegarLoopForPetriNet]: 1029 programPoint places, -80 predicate places. [2025-02-08 05:38:28,042 INFO L471 AbstractCegarLoop]: Abstraction has has 949 places, 976 transitions, 2101 flow [2025-02-08 05:38:28,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1065.6666666666667) internal successors, (3197), 3 states have internal predecessors, (3197), 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:38:28,043 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:28,043 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:28,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-08 05:38:28,043 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread2Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-02-08 05:38:28,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:28,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1985717491, now seen corresponding path program 1 times [2025-02-08 05:38:28,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:28,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068181323] [2025-02-08 05:38:28,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:28,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:28,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-02-08 05:38:28,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-02-08 05:38:28,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:28,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:28,080 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:38:28,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:28,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068181323] [2025-02-08 05:38:28,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068181323] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:28,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:28,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:28,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531512418] [2025-02-08 05:38:28,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:28,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:28,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:28,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:28,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:28,117 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1042 out of 1096 [2025-02-08 05:38:28,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 949 places, 976 transitions, 2101 flow. Second operand has 3 states, 3 states have (on average 1044.0) internal successors, (3132), 3 states have internal predecessors, (3132), 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:38:28,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:28,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1042 of 1096 [2025-02-08 05:38:28,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:31,363 INFO L124 PetriNetUnfolderBase]: 576/9951 cut-off events. [2025-02-08 05:38:31,364 INFO L125 PetriNetUnfolderBase]: For 84/240 co-relation queries the response was YES. [2025-02-08 05:38:31,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10995 conditions, 9951 events. 576/9951 cut-off events. For 84/240 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 101734 event pairs, 27 based on Foata normal form. 0/8400 useless extension candidates. Maximal degree in co-relation 9407. Up to 328 conditions per place. [2025-02-08 05:38:31,647 INFO L140 encePairwiseOnDemand]: 1079/1096 looper letters, 23 selfloop transitions, 9 changer transitions 0/974 dead transitions. [2025-02-08 05:38:31,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 943 places, 974 transitions, 2163 flow [2025-02-08 05:38:31,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:31,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:31,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3166 transitions. [2025-02-08 05:38:31,649 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9628953771289538 [2025-02-08 05:38:31,649 INFO L175 Difference]: Start difference. First operand has 949 places, 976 transitions, 2101 flow. Second operand 3 states and 3166 transitions. [2025-02-08 05:38:31,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 943 places, 974 transitions, 2163 flow [2025-02-08 05:38:31,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 942 places, 974 transitions, 2161 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:38:31,657 INFO L231 Difference]: Finished difference. Result has 944 places, 972 transitions, 2135 flow [2025-02-08 05:38:31,658 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1096, PETRI_DIFFERENCE_MINUEND_FLOW=2083, PETRI_DIFFERENCE_MINUEND_PLACES=940, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=968, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=959, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2135, PETRI_PLACES=944, PETRI_TRANSITIONS=972} [2025-02-08 05:38:31,658 INFO L279 CegarLoopForPetriNet]: 1029 programPoint places, -85 predicate places. [2025-02-08 05:38:31,658 INFO L471 AbstractCegarLoop]: Abstraction has has 944 places, 972 transitions, 2135 flow [2025-02-08 05:38:31,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1044.0) internal successors, (3132), 3 states have internal predecessors, (3132), 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:38:31,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:31,659 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:31,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-08 05:38:31,659 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread2Err33ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-02-08 05:38:31,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:31,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1370054958, now seen corresponding path program 1 times [2025-02-08 05:38:31,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:31,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161009624] [2025-02-08 05:38:31,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:31,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:31,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-02-08 05:38:31,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-02-08 05:38:31,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:31,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:31,689 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:38:31,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:31,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161009624] [2025-02-08 05:38:31,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161009624] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:31,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:31,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:31,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395809488] [2025-02-08 05:38:31,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:31,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:31,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:31,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:31,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:31,735 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1054 out of 1096 [2025-02-08 05:38:31,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 944 places, 972 transitions, 2135 flow. Second operand has 3 states, 3 states have (on average 1056.3333333333333) internal successors, (3169), 3 states have internal predecessors, (3169), 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:38:31,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:31,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1054 of 1096 [2025-02-08 05:38:31,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:34,179 INFO L124 PetriNetUnfolderBase]: 454/8454 cut-off events. [2025-02-08 05:38:34,179 INFO L125 PetriNetUnfolderBase]: For 386/637 co-relation queries the response was YES. [2025-02-08 05:38:34,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9523 conditions, 8454 events. 454/8454 cut-off events. For 386/637 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 89467 event pairs, 95 based on Foata normal form. 0/7147 useless extension candidates. Maximal degree in co-relation 7470. Up to 284 conditions per place. [2025-02-08 05:38:34,558 INFO L140 encePairwiseOnDemand]: 1093/1096 looper letters, 24 selfloop transitions, 3 changer transitions 0/973 dead transitions. [2025-02-08 05:38:34,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 945 places, 973 transitions, 2193 flow [2025-02-08 05:38:34,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:34,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:34,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3186 transitions. [2025-02-08 05:38:34,559 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.968978102189781 [2025-02-08 05:38:34,559 INFO L175 Difference]: Start difference. First operand has 944 places, 972 transitions, 2135 flow. Second operand 3 states and 3186 transitions. [2025-02-08 05:38:34,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 945 places, 973 transitions, 2193 flow [2025-02-08 05:38:34,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 943 places, 973 transitions, 2175 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:34,568 INFO L231 Difference]: Finished difference. Result has 943 places, 971 transitions, 2121 flow [2025-02-08 05:38:34,569 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1096, PETRI_DIFFERENCE_MINUEND_FLOW=2115, PETRI_DIFFERENCE_MINUEND_PLACES=941, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=971, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=968, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2121, PETRI_PLACES=943, PETRI_TRANSITIONS=971} [2025-02-08 05:38:34,569 INFO L279 CegarLoopForPetriNet]: 1029 programPoint places, -86 predicate places. [2025-02-08 05:38:34,569 INFO L471 AbstractCegarLoop]: Abstraction has has 943 places, 971 transitions, 2121 flow [2025-02-08 05:38:34,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1056.3333333333333) internal successors, (3169), 3 states have internal predecessors, (3169), 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:38:34,569 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:34,570 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:34,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-08 05:38:34,570 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread1Err32ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-02-08 05:38:34,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:34,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1182603812, now seen corresponding path program 1 times [2025-02-08 05:38:34,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:34,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962357674] [2025-02-08 05:38:34,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:34,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:34,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-02-08 05:38:34,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-02-08 05:38:34,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:34,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:34,599 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:38:34,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:34,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962357674] [2025-02-08 05:38:34,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962357674] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:34,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:34,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:34,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426137299] [2025-02-08 05:38:34,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:34,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:34,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:34,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:34,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:34,620 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1056 out of 1096 [2025-02-08 05:38:34,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 943 places, 971 transitions, 2121 flow. Second operand has 3 states, 3 states have (on average 1057.6666666666667) internal successors, (3173), 3 states have internal predecessors, (3173), 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:38:34,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:34,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1056 of 1096 [2025-02-08 05:38:34,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:36,076 INFO L124 PetriNetUnfolderBase]: 246/5105 cut-off events. [2025-02-08 05:38:36,076 INFO L125 PetriNetUnfolderBase]: For 12/84 co-relation queries the response was YES. [2025-02-08 05:38:36,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5721 conditions, 5105 events. 246/5105 cut-off events. For 12/84 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 46838 event pairs, 6 based on Foata normal form. 2/4412 useless extension candidates. Maximal degree in co-relation 4458. Up to 106 conditions per place. [2025-02-08 05:38:36,300 INFO L140 encePairwiseOnDemand]: 1089/1096 looper letters, 15 selfloop transitions, 3 changer transitions 0/969 dead transitions. [2025-02-08 05:38:36,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 941 places, 969 transitions, 2155 flow [2025-02-08 05:38:36,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:36,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:36,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3190 transitions. [2025-02-08 05:38:36,302 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9701946472019465 [2025-02-08 05:38:36,302 INFO L175 Difference]: Start difference. First operand has 943 places, 971 transitions, 2121 flow. Second operand 3 states and 3190 transitions. [2025-02-08 05:38:36,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 941 places, 969 transitions, 2155 flow [2025-02-08 05:38:36,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 939 places, 969 transitions, 2149 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:36,311 INFO L231 Difference]: Finished difference. Result has 939 places, 967 transitions, 2113 flow [2025-02-08 05:38:36,312 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1096, PETRI_DIFFERENCE_MINUEND_FLOW=2107, PETRI_DIFFERENCE_MINUEND_PLACES=937, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=967, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=964, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2113, PETRI_PLACES=939, PETRI_TRANSITIONS=967} [2025-02-08 05:38:36,313 INFO L279 CegarLoopForPetriNet]: 1029 programPoint places, -90 predicate places. [2025-02-08 05:38:36,313 INFO L471 AbstractCegarLoop]: Abstraction has has 939 places, 967 transitions, 2113 flow [2025-02-08 05:38:36,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1057.6666666666667) internal successors, (3173), 3 states have internal predecessors, (3173), 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:38:36,313 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:36,313 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:36,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-08 05:38:36,314 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting thread3Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-02-08 05:38:36,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:36,315 INFO L85 PathProgramCache]: Analyzing trace with hash -2051743426, now seen corresponding path program 1 times [2025-02-08 05:38:36,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:36,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433471182] [2025-02-08 05:38:36,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:36,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:36,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-02-08 05:38:36,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-02-08 05:38:36,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:36,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:36,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:36,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:36,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433471182] [2025-02-08 05:38:36,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433471182] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:36,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:36,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:38:36,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329423882] [2025-02-08 05:38:36,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:36,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:36,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:36,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:36,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:36,388 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1063 out of 1096 [2025-02-08 05:38:36,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 939 places, 967 transitions, 2113 flow. Second operand has 3 states, 3 states have (on average 1066.0) internal successors, (3198), 3 states have internal predecessors, (3198), 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:38:36,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:36,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1063 of 1096 [2025-02-08 05:38:36,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:38,655 INFO L124 PetriNetUnfolderBase]: 354/8193 cut-off events. [2025-02-08 05:38:38,655 INFO L125 PetriNetUnfolderBase]: For 37/73 co-relation queries the response was YES. [2025-02-08 05:38:38,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8760 conditions, 8193 events. 354/8193 cut-off events. For 37/73 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 74668 event pairs, 16 based on Foata normal form. 2/6873 useless extension candidates. Maximal degree in co-relation 7373. Up to 157 conditions per place. [2025-02-08 05:38:39,042 INFO L140 encePairwiseOnDemand]: 1093/1096 looper letters, 14 selfloop transitions, 2 changer transitions 0/970 dead transitions. [2025-02-08 05:38:39,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 941 places, 970 transitions, 2153 flow [2025-02-08 05:38:39,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:39,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:39,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3206 transitions. [2025-02-08 05:38:39,044 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9750608272506083 [2025-02-08 05:38:39,044 INFO L175 Difference]: Start difference. First operand has 939 places, 967 transitions, 2113 flow. Second operand 3 states and 3206 transitions. [2025-02-08 05:38:39,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 941 places, 970 transitions, 2153 flow [2025-02-08 05:38:39,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 939 places, 970 transitions, 2147 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:39,052 INFO L231 Difference]: Finished difference. Result has 941 places, 968 transitions, 2121 flow [2025-02-08 05:38:39,052 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1096, PETRI_DIFFERENCE_MINUEND_FLOW=2107, PETRI_DIFFERENCE_MINUEND_PLACES=937, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=967, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=965, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2121, PETRI_PLACES=941, PETRI_TRANSITIONS=968} [2025-02-08 05:38:39,053 INFO L279 CegarLoopForPetriNet]: 1029 programPoint places, -88 predicate places. [2025-02-08 05:38:39,053 INFO L471 AbstractCegarLoop]: Abstraction has has 941 places, 968 transitions, 2121 flow [2025-02-08 05:38:39,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1066.0) internal successors, (3198), 3 states have internal predecessors, (3198), 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:38:39,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:39,053 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:39,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-08 05:38:39,054 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting thread3Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-02-08 05:38:39,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:39,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1651650555, now seen corresponding path program 1 times [2025-02-08 05:38:39,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:39,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849747206] [2025-02-08 05:38:39,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:39,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:39,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-02-08 05:38:39,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-02-08 05:38:39,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:39,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:39,079 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:38:39,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:39,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849747206] [2025-02-08 05:38:39,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849747206] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:39,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:39,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:39,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970422951] [2025-02-08 05:38:39,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:39,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:39,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:39,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:39,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:39,112 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1042 out of 1096 [2025-02-08 05:38:39,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 941 places, 968 transitions, 2121 flow. Second operand has 3 states, 3 states have (on average 1044.3333333333333) internal successors, (3133), 3 states have internal predecessors, (3133), 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:38:39,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:39,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1042 of 1096 [2025-02-08 05:38:39,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:41,733 INFO L124 PetriNetUnfolderBase]: 670/10128 cut-off events. [2025-02-08 05:38:41,734 INFO L125 PetriNetUnfolderBase]: For 325/392 co-relation queries the response was YES. [2025-02-08 05:38:42,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11611 conditions, 10128 events. 670/10128 cut-off events. For 325/392 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 112675 event pairs, 54 based on Foata normal form. 2/8615 useless extension candidates. Maximal degree in co-relation 10052. Up to 682 conditions per place. [2025-02-08 05:38:42,133 INFO L140 encePairwiseOnDemand]: 1079/1096 looper letters, 23 selfloop transitions, 9 changer transitions 0/966 dead transitions. [2025-02-08 05:38:42,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 935 places, 966 transitions, 2183 flow [2025-02-08 05:38:42,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:42,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:42,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3166 transitions. [2025-02-08 05:38:42,135 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9628953771289538 [2025-02-08 05:38:42,135 INFO L175 Difference]: Start difference. First operand has 941 places, 968 transitions, 2121 flow. Second operand 3 states and 3166 transitions. [2025-02-08 05:38:42,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 935 places, 966 transitions, 2183 flow [2025-02-08 05:38:42,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 934 places, 966 transitions, 2181 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:38:42,144 INFO L231 Difference]: Finished difference. Result has 936 places, 964 transitions, 2155 flow [2025-02-08 05:38:42,144 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1096, PETRI_DIFFERENCE_MINUEND_FLOW=2103, PETRI_DIFFERENCE_MINUEND_PLACES=932, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=960, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=951, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2155, PETRI_PLACES=936, PETRI_TRANSITIONS=964} [2025-02-08 05:38:42,145 INFO L279 CegarLoopForPetriNet]: 1029 programPoint places, -93 predicate places. [2025-02-08 05:38:42,145 INFO L471 AbstractCegarLoop]: Abstraction has has 936 places, 964 transitions, 2155 flow [2025-02-08 05:38:42,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1044.3333333333333) internal successors, (3133), 3 states have internal predecessors, (3133), 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:38:42,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:42,145 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:42,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-02-08 05:38:42,146 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting thread3Err33ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-02-08 05:38:42,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:42,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1835652336, now seen corresponding path program 1 times [2025-02-08 05:38:42,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:42,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524598954] [2025-02-08 05:38:42,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:42,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:42,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-02-08 05:38:42,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-02-08 05:38:42,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:42,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:42,173 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:38:42,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:42,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524598954] [2025-02-08 05:38:42,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524598954] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:42,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:42,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:42,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730068749] [2025-02-08 05:38:42,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:42,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:42,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:42,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:42,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:42,214 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1054 out of 1096 [2025-02-08 05:38:42,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 936 places, 964 transitions, 2155 flow. Second operand has 3 states, 3 states have (on average 1056.6666666666667) internal successors, (3170), 3 states have internal predecessors, (3170), 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:38:42,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:42,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1054 of 1096 [2025-02-08 05:38:42,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:44,833 INFO L124 PetriNetUnfolderBase]: 534/7934 cut-off events. [2025-02-08 05:38:44,833 INFO L125 PetriNetUnfolderBase]: For 895/978 co-relation queries the response was YES. [2025-02-08 05:38:45,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9648 conditions, 7934 events. 534/7934 cut-off events. For 895/978 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 86309 event pairs, 118 based on Foata normal form. 2/6801 useless extension candidates. Maximal degree in co-relation 8060. Up to 585 conditions per place. [2025-02-08 05:38:45,202 INFO L140 encePairwiseOnDemand]: 1093/1096 looper letters, 24 selfloop transitions, 3 changer transitions 0/965 dead transitions. [2025-02-08 05:38:45,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 937 places, 965 transitions, 2213 flow [2025-02-08 05:38:45,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:45,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:45,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3186 transitions. [2025-02-08 05:38:45,203 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.968978102189781 [2025-02-08 05:38:45,204 INFO L175 Difference]: Start difference. First operand has 936 places, 964 transitions, 2155 flow. Second operand 3 states and 3186 transitions. [2025-02-08 05:38:45,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 937 places, 965 transitions, 2213 flow [2025-02-08 05:38:45,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 935 places, 965 transitions, 2195 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:45,214 INFO L231 Difference]: Finished difference. Result has 935 places, 963 transitions, 2141 flow [2025-02-08 05:38:45,214 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1096, PETRI_DIFFERENCE_MINUEND_FLOW=2135, PETRI_DIFFERENCE_MINUEND_PLACES=933, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=963, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=960, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2141, PETRI_PLACES=935, PETRI_TRANSITIONS=963} [2025-02-08 05:38:45,214 INFO L279 CegarLoopForPetriNet]: 1029 programPoint places, -94 predicate places. [2025-02-08 05:38:45,215 INFO L471 AbstractCegarLoop]: Abstraction has has 935 places, 963 transitions, 2141 flow [2025-02-08 05:38:45,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1056.6666666666667) internal successors, (3170), 3 states have internal predecessors, (3170), 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:38:45,215 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:45,215 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:45,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-02-08 05:38:45,215 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting thread2Err32ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-02-08 05:38:45,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:45,216 INFO L85 PathProgramCache]: Analyzing trace with hash -880070760, now seen corresponding path program 1 times [2025-02-08 05:38:45,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:45,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478488732] [2025-02-08 05:38:45,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:45,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:45,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-02-08 05:38:45,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-02-08 05:38:45,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:45,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:45,245 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:38:45,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:45,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478488732] [2025-02-08 05:38:45,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478488732] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:45,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:45,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:45,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44600394] [2025-02-08 05:38:45,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:45,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:45,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:45,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:45,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:45,263 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1056 out of 1096 [2025-02-08 05:38:45,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 935 places, 963 transitions, 2141 flow. Second operand has 3 states, 3 states have (on average 1058.0) internal successors, (3174), 3 states have internal predecessors, (3174), 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:38:45,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:45,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1056 of 1096 [2025-02-08 05:38:45,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:48,386 INFO L124 PetriNetUnfolderBase]: 422/8652 cut-off events. [2025-02-08 05:38:48,387 INFO L125 PetriNetUnfolderBase]: For 66/88 co-relation queries the response was YES. [2025-02-08 05:38:48,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9780 conditions, 8652 events. 422/8652 cut-off events. For 66/88 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 89481 event pairs, 39 based on Foata normal form. 0/7504 useless extension candidates. Maximal degree in co-relation 7490. Up to 204 conditions per place. [2025-02-08 05:38:48,819 INFO L140 encePairwiseOnDemand]: 1089/1096 looper letters, 15 selfloop transitions, 3 changer transitions 0/961 dead transitions. [2025-02-08 05:38:48,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 933 places, 961 transitions, 2175 flow [2025-02-08 05:38:48,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:48,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:48,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3190 transitions. [2025-02-08 05:38:48,821 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9701946472019465 [2025-02-08 05:38:48,821 INFO L175 Difference]: Start difference. First operand has 935 places, 963 transitions, 2141 flow. Second operand 3 states and 3190 transitions. [2025-02-08 05:38:48,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 933 places, 961 transitions, 2175 flow [2025-02-08 05:38:48,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 931 places, 961 transitions, 2169 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:48,830 INFO L231 Difference]: Finished difference. Result has 931 places, 959 transitions, 2133 flow [2025-02-08 05:38:48,831 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1096, PETRI_DIFFERENCE_MINUEND_FLOW=2127, PETRI_DIFFERENCE_MINUEND_PLACES=929, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=959, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=956, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2133, PETRI_PLACES=931, PETRI_TRANSITIONS=959} [2025-02-08 05:38:48,831 INFO L279 CegarLoopForPetriNet]: 1029 programPoint places, -98 predicate places. [2025-02-08 05:38:48,831 INFO L471 AbstractCegarLoop]: Abstraction has has 931 places, 959 transitions, 2133 flow [2025-02-08 05:38:48,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1058.0) internal successors, (3174), 3 states have internal predecessors, (3174), 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:38:48,832 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:48,832 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:48,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-02-08 05:38:48,832 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting thread1Err30ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-02-08 05:38:48,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:48,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1132106074, now seen corresponding path program 1 times [2025-02-08 05:38:48,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:48,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059095190] [2025-02-08 05:38:48,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:48,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:48,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-02-08 05:38:48,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-02-08 05:38:48,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:48,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:48,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:48,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:48,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059095190] [2025-02-08 05:38:48,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059095190] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:48,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:48,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:48,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180397918] [2025-02-08 05:38:48,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:48,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:48,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:48,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:48,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:48,876 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1061 out of 1096 [2025-02-08 05:38:48,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 931 places, 959 transitions, 2133 flow. Second operand has 3 states, 3 states have (on average 1062.3333333333333) internal successors, (3187), 3 states have internal predecessors, (3187), 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:38:48,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:48,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1061 of 1096 [2025-02-08 05:38:48,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand