./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-nzb-file-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-nzb-file-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 47976145f2a7f206dd7d2e7a0ffeac879f94f33f7a5b87161ebd997173567eb0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:37:44,759 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:37:44,810 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:44,813 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:37:44,814 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:37:44,831 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:37:44,832 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:37:44,832 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:37:44,832 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:37:44,832 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:37:44,832 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:37:44,832 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:37:44,833 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:37:44,833 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:37:44,833 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:37:44,833 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:37:44,833 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:37:44,833 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:37:44,833 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:37:44,833 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:37:44,833 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:37:44,833 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:37:44,833 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:37:44,833 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:37:44,833 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:37:44,833 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:37:44,833 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:37:44,833 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:37:44,833 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:37:44,833 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:37:44,833 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:37:44,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:37:44,834 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:37:44,834 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:37:44,834 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:37:44,834 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:37:44,834 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:37:44,834 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:37:44,834 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:37:44,834 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:37:44,834 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:37:44,834 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:37:44,834 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 -> 47976145f2a7f206dd7d2e7a0ffeac879f94f33f7a5b87161ebd997173567eb0 [2025-02-08 05:37:45,045 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:37:45,053 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:37:45,055 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:37:45,056 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:37:45,056 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:37:45,057 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-nzb-file-subst.wvr.c [2025-02-08 05:37:46,179 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8a7104bb2/3ea09cf8084e4bbcba4ed76c9940f8ee/FLAGdf6eb8887 [2025-02-08 05:37:46,438 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:37:46,440 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-nzb-file-subst.wvr.c [2025-02-08 05:37:46,448 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8a7104bb2/3ea09cf8084e4bbcba4ed76c9940f8ee/FLAGdf6eb8887 [2025-02-08 05:37:46,461 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8a7104bb2/3ea09cf8084e4bbcba4ed76c9940f8ee [2025-02-08 05:37:46,463 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:37:46,464 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:37:46,466 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:46,466 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:37:46,469 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:37:46,469 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:46" (1/1) ... [2025-02-08 05:37:46,470 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5540f65f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:46, skipping insertion in model container [2025-02-08 05:37:46,471 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:46" (1/1) ... [2025-02-08 05:37:46,488 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:37:46,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:46,697 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:37:46,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:46,771 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:37:46,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:46 WrapperNode [2025-02-08 05:37:46,772 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:46,773 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:46,773 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:37:46,773 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:37:46,778 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:46" (1/1) ... [2025-02-08 05:37:46,797 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:46" (1/1) ... [2025-02-08 05:37:46,846 INFO L138 Inliner]: procedures = 25, calls = 62, calls flagged for inlining = 29, calls inlined = 43, statements flattened = 1313 [2025-02-08 05:37:46,846 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:46,850 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:37:46,850 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:37:46,850 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:37:46,858 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:46" (1/1) ... [2025-02-08 05:37:46,858 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:46" (1/1) ... [2025-02-08 05:37:46,867 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:46" (1/1) ... [2025-02-08 05:37:46,867 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:46" (1/1) ... [2025-02-08 05:37:46,907 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:46" (1/1) ... [2025-02-08 05:37:46,909 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:46" (1/1) ... [2025-02-08 05:37:46,916 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:46" (1/1) ... [2025-02-08 05:37:46,923 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:46" (1/1) ... [2025-02-08 05:37:46,930 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:37:46,934 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:37:46,934 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:37:46,934 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:37:46,935 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:46" (1/1) ... [2025-02-08 05:37:46,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:37:46,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:37:46,963 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:46,966 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:46,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:37:46,985 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:37:46,985 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:37:46,985 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:37:46,985 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:37:46,985 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 05:37:46,985 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 05:37:46,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:37:46,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:37:46,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:37:46,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:37:46,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:37:46,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:37:46,987 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:47,117 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:37:47,120 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:37:47,617 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-11: #t~ite43#1 := #t~ret42#1; [2025-02-08 05:37:47,617 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-12: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret42#1 && #t~ret42#1 <= 2147483647; [2025-02-08 05:37:47,618 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-13: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:47,618 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-14: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:47,618 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-15: #t~ret42#1 := minus_#res#1; [2025-02-08 05:37:47,618 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-7: #t~ite37#1 := #t~ret36#1; [2025-02-08 05:37:47,618 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-8: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret36#1 && #t~ret36#1 <= 2147483647; [2025-02-08 05:37:47,618 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-9: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:47,618 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-10: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:47,618 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-11: #t~ret36#1 := minus_#res#1; [2025-02-08 05:37:47,936 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-7: #t~ite82#1 := #t~ret81#1; [2025-02-08 05:37:47,936 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-8: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret81#1 && #t~ret81#1 <= 2147483647; [2025-02-08 05:37:47,936 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-9: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:47,936 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-10: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:47,936 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-11: #t~ret81#1 := minus_#res#1; [2025-02-08 05:37:47,937 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-11: #t~ite88#1 := #t~ret87#1; [2025-02-08 05:37:47,937 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-12: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret87#1 && #t~ret87#1 <= 2147483647; [2025-02-08 05:37:47,937 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-13: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:47,937 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-14: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:47,938 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-15: #t~ret87#1 := minus_#res#1; [2025-02-08 05:37:48,164 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119-7: #t~ite127#1 := #t~ret126#1; [2025-02-08 05:37:48,164 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119-8: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret126#1 && #t~ret126#1 <= 2147483647; [2025-02-08 05:37:48,165 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119-9: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:48,165 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119-10: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:48,165 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119-11: #t~ret126#1 := minus_#res#1; [2025-02-08 05:37:48,165 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L123-11: #t~ite133#1 := #t~ret132#1; [2025-02-08 05:37:48,165 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L123-12: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret132#1 && #t~ret132#1 <= 2147483647; [2025-02-08 05:37:48,165 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L123-13: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:48,165 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L123-14: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:48,165 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L123-15: #t~ret132#1 := minus_#res#1; [2025-02-08 05:37:48,345 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:37:48,345 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:37:48,378 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:37:48,378 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:37:48,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:48 BoogieIcfgContainer [2025-02-08 05:37:48,379 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:37:48,380 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:37:48,380 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:37:48,384 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:37:48,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:37:46" (1/3) ... [2025-02-08 05:37:48,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@364fa7f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:48, skipping insertion in model container [2025-02-08 05:37:48,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:46" (2/3) ... [2025-02-08 05:37:48,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@364fa7f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:48, skipping insertion in model container [2025-02-08 05:37:48,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:48" (3/3) ... [2025-02-08 05:37:48,385 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-nzb-file-subst.wvr.c [2025-02-08 05:37:48,394 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:37:48,396 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-nzb-file-subst.wvr.c that has 4 procedures, 1646 locations, 1 initial locations, 6 loop locations, and 227 error locations. [2025-02-08 05:37:48,396 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:37:48,591 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:37:48,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1655 places, 1747 transitions, 3515 flow [2025-02-08 05:37:49,473 INFO L124 PetriNetUnfolderBase]: 102/1744 cut-off events. [2025-02-08 05:37:49,478 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:37:49,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1757 conditions, 1744 events. 102/1744 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 7504 event pairs, 0 based on Foata normal form. 0/1409 useless extension candidates. Maximal degree in co-relation 1356. Up to 2 conditions per place. [2025-02-08 05:37:49,566 INFO L82 GeneralOperation]: Start removeDead. Operand has 1655 places, 1747 transitions, 3515 flow [2025-02-08 05:37:49,656 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1632 places, 1721 transitions, 3460 flow [2025-02-08 05:37:49,664 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:37:49,674 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;@44d5e7e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:37:49,675 INFO L334 AbstractCegarLoop]: Starting to check reachability of 428 error locations. [2025-02-08 05:37:49,681 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:37:49,681 INFO L124 PetriNetUnfolderBase]: 0/38 cut-off events. [2025-02-08 05:37:49,681 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:37:49,682 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:49,682 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] [2025-02-08 05:37:49,683 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 424 more)] === [2025-02-08 05:37:49,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:49,687 INFO L85 PathProgramCache]: Analyzing trace with hash -811433585, now seen corresponding path program 1 times [2025-02-08 05:37:49,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:49,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924346916] [2025-02-08 05:37:49,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:49,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:49,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 05:37:49,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 05:37:49,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:49,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:49,852 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,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:49,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924346916] [2025-02-08 05:37:49,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924346916] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:49,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:49,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:49,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509978663] [2025-02-08 05:37:49,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:49,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:49,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:49,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:49,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:49,904 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1697 out of 1747 [2025-02-08 05:37:49,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1632 places, 1721 transitions, 3460 flow. Second operand has 3 states, 3 states have (on average 1698.3333333333333) internal successors, (5095), 3 states have internal predecessors, (5095), 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,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:49,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1697 of 1747 [2025-02-08 05:37:49,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:51,396 INFO L124 PetriNetUnfolderBase]: 157/3458 cut-off events. [2025-02-08 05:37:51,397 INFO L125 PetriNetUnfolderBase]: For 17/19 co-relation queries the response was YES. [2025-02-08 05:37:51,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3507 conditions, 3458 events. 157/3458 cut-off events. For 17/19 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 21028 event pairs, 7 based on Foata normal form. 110/2848 useless extension candidates. Maximal degree in co-relation 3121. Up to 25 conditions per place. [2025-02-08 05:37:51,538 INFO L140 encePairwiseOnDemand]: 1711/1747 looper letters, 11 selfloop transitions, 2 changer transitions 6/1687 dead transitions. [2025-02-08 05:37:51,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1633 places, 1687 transitions, 3418 flow [2025-02-08 05:37:51,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:51,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:51,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5138 transitions. [2025-02-08 05:37:51,561 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9803472619729059 [2025-02-08 05:37:51,564 INFO L175 Difference]: Start difference. First operand has 1632 places, 1721 transitions, 3460 flow. Second operand 3 states and 5138 transitions. [2025-02-08 05:37:51,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1633 places, 1687 transitions, 3418 flow [2025-02-08 05:37:51,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1627 places, 1687 transitions, 3406 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 05:37:51,598 INFO L231 Difference]: Finished difference. Result has 1627 places, 1681 transitions, 3372 flow [2025-02-08 05:37:51,602 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1747, PETRI_DIFFERENCE_MINUEND_FLOW=3380, PETRI_DIFFERENCE_MINUEND_PLACES=1625, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1687, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1685, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3372, PETRI_PLACES=1627, PETRI_TRANSITIONS=1681} [2025-02-08 05:37:51,604 INFO L279 CegarLoopForPetriNet]: 1632 programPoint places, -5 predicate places. [2025-02-08 05:37:51,605 INFO L471 AbstractCegarLoop]: Abstraction has has 1627 places, 1681 transitions, 3372 flow [2025-02-08 05:37:51,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1698.3333333333333) internal successors, (5095), 3 states have internal predecessors, (5095), 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,609 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:51,609 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] [2025-02-08 05:37:51,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:37:51,609 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 424 more)] === [2025-02-08 05:37:51,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:51,611 INFO L85 PathProgramCache]: Analyzing trace with hash 161922295, now seen corresponding path program 1 times [2025-02-08 05:37:51,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:51,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92007383] [2025-02-08 05:37:51,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:51,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:51,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 05:37:51,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 05:37:51,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:51,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:51,684 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,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:51,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92007383] [2025-02-08 05:37:51,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92007383] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:51,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:51,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:51,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957175858] [2025-02-08 05:37:51,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:51,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:51,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:51,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:51,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:51,708 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1697 out of 1747 [2025-02-08 05:37:51,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1627 places, 1681 transitions, 3372 flow. Second operand has 3 states, 3 states have (on average 1698.3333333333333) internal successors, (5095), 3 states have internal predecessors, (5095), 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,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:51,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1697 of 1747 [2025-02-08 05:37:51,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:52,967 INFO L124 PetriNetUnfolderBase]: 157/3451 cut-off events. [2025-02-08 05:37:52,968 INFO L125 PetriNetUnfolderBase]: For 2/5 co-relation queries the response was YES. [2025-02-08 05:37:53,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3489 conditions, 3451 events. 157/3451 cut-off events. For 2/5 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 22107 event pairs, 7 based on Foata normal form. 0/2739 useless extension candidates. Maximal degree in co-relation 3443. Up to 25 conditions per place. [2025-02-08 05:37:53,128 INFO L140 encePairwiseOnDemand]: 1744/1747 looper letters, 11 selfloop transitions, 2 changer transitions 0/1680 dead transitions. [2025-02-08 05:37:53,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1622 places, 1680 transitions, 3396 flow [2025-02-08 05:37:53,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:53,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:53,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5105 transitions. [2025-02-08 05:37:53,138 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9740507536729631 [2025-02-08 05:37:53,138 INFO L175 Difference]: Start difference. First operand has 1627 places, 1681 transitions, 3372 flow. Second operand 3 states and 5105 transitions. [2025-02-08 05:37:53,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1622 places, 1680 transitions, 3396 flow [2025-02-08 05:37:53,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1620 places, 1680 transitions, 3392 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:53,168 INFO L231 Difference]: Finished difference. Result has 1620 places, 1680 transitions, 3370 flow [2025-02-08 05:37:53,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1747, PETRI_DIFFERENCE_MINUEND_FLOW=3366, PETRI_DIFFERENCE_MINUEND_PLACES=1618, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1680, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1678, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3370, PETRI_PLACES=1620, PETRI_TRANSITIONS=1680} [2025-02-08 05:37:53,171 INFO L279 CegarLoopForPetriNet]: 1632 programPoint places, -12 predicate places. [2025-02-08 05:37:53,171 INFO L471 AbstractCegarLoop]: Abstraction has has 1620 places, 1680 transitions, 3370 flow [2025-02-08 05:37:53,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1698.3333333333333) internal successors, (5095), 3 states have internal predecessors, (5095), 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,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:53,174 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] [2025-02-08 05:37:53,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:37:53,174 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 424 more)] === [2025-02-08 05:37:53,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:53,175 INFO L85 PathProgramCache]: Analyzing trace with hash 514161246, now seen corresponding path program 1 times [2025-02-08 05:37:53,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:53,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446789604] [2025-02-08 05:37:53,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:53,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:53,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 05:37:53,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 05:37:53,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:53,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:53,226 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,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:53,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446789604] [2025-02-08 05:37:53,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446789604] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:53,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:53,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:53,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130800534] [2025-02-08 05:37:53,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:53,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:53,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:53,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:53,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:53,247 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1697 out of 1747 [2025-02-08 05:37:53,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1620 places, 1680 transitions, 3370 flow. Second operand has 3 states, 3 states have (on average 1698.3333333333333) internal successors, (5095), 3 states have internal predecessors, (5095), 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,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:53,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1697 of 1747 [2025-02-08 05:37:53,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:54,346 INFO L124 PetriNetUnfolderBase]: 113/2569 cut-off events. [2025-02-08 05:37:54,346 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-02-08 05:37:54,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2602 conditions, 2569 events. 113/2569 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 14001 event pairs, 5 based on Foata normal form. 0/2053 useless extension candidates. Maximal degree in co-relation 2548. Up to 22 conditions per place. [2025-02-08 05:37:54,440 INFO L140 encePairwiseOnDemand]: 1744/1747 looper letters, 11 selfloop transitions, 2 changer transitions 0/1679 dead transitions. [2025-02-08 05:37:54,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1621 places, 1679 transitions, 3394 flow [2025-02-08 05:37:54,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:54,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:54,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5105 transitions. [2025-02-08 05:37:54,447 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9740507536729631 [2025-02-08 05:37:54,447 INFO L175 Difference]: Start difference. First operand has 1620 places, 1680 transitions, 3370 flow. Second operand 3 states and 5105 transitions. [2025-02-08 05:37:54,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1621 places, 1679 transitions, 3394 flow [2025-02-08 05:37:54,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1619 places, 1679 transitions, 3390 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:54,466 INFO L231 Difference]: Finished difference. Result has 1619 places, 1679 transitions, 3368 flow [2025-02-08 05:37:54,468 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1747, PETRI_DIFFERENCE_MINUEND_FLOW=3364, PETRI_DIFFERENCE_MINUEND_PLACES=1617, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1679, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1677, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3368, PETRI_PLACES=1619, PETRI_TRANSITIONS=1679} [2025-02-08 05:37:54,468 INFO L279 CegarLoopForPetriNet]: 1632 programPoint places, -13 predicate places. [2025-02-08 05:37:54,468 INFO L471 AbstractCegarLoop]: Abstraction has has 1619 places, 1679 transitions, 3368 flow [2025-02-08 05:37:54,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1698.3333333333333) internal successors, (5095), 3 states have internal predecessors, (5095), 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 L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:54,471 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] [2025-02-08 05:37:54,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:37:54,471 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 424 more)] === [2025-02-08 05:37:54,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:54,472 INFO L85 PathProgramCache]: Analyzing trace with hash -800517625, now seen corresponding path program 1 times [2025-02-08 05:37:54,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:54,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338259796] [2025-02-08 05:37:54,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:54,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:54,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 05:37:54,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 05:37:54,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:54,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:54,521 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,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:54,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338259796] [2025-02-08 05:37:54,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338259796] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:54,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:54,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:54,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097875596] [2025-02-08 05:37:54,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:54,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:54,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:54,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:54,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:54,541 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1697 out of 1747 [2025-02-08 05:37:54,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1619 places, 1679 transitions, 3368 flow. Second operand has 3 states, 3 states have (on average 1698.3333333333333) internal successors, (5095), 3 states have internal predecessors, (5095), 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,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:54,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1697 of 1747 [2025-02-08 05:37:54,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:55,324 INFO L124 PetriNetUnfolderBase]: 113/2568 cut-off events. [2025-02-08 05:37:55,324 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-02-08 05:37:55,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2601 conditions, 2568 events. 113/2568 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 14524 event pairs, 5 based on Foata normal form. 0/2054 useless extension candidates. Maximal degree in co-relation 2539. Up to 22 conditions per place. [2025-02-08 05:37:55,423 INFO L140 encePairwiseOnDemand]: 1744/1747 looper letters, 11 selfloop transitions, 2 changer transitions 0/1678 dead transitions. [2025-02-08 05:37:55,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1620 places, 1678 transitions, 3392 flow [2025-02-08 05:37:55,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:55,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:55,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5105 transitions. [2025-02-08 05:37:55,429 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9740507536729631 [2025-02-08 05:37:55,429 INFO L175 Difference]: Start difference. First operand has 1619 places, 1679 transitions, 3368 flow. Second operand 3 states and 5105 transitions. [2025-02-08 05:37:55,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1620 places, 1678 transitions, 3392 flow [2025-02-08 05:37:55,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1618 places, 1678 transitions, 3388 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:55,446 INFO L231 Difference]: Finished difference. Result has 1618 places, 1678 transitions, 3366 flow [2025-02-08 05:37:55,448 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1747, PETRI_DIFFERENCE_MINUEND_FLOW=3362, PETRI_DIFFERENCE_MINUEND_PLACES=1616, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1678, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1676, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3366, PETRI_PLACES=1618, PETRI_TRANSITIONS=1678} [2025-02-08 05:37:55,449 INFO L279 CegarLoopForPetriNet]: 1632 programPoint places, -14 predicate places. [2025-02-08 05:37:55,449 INFO L471 AbstractCegarLoop]: Abstraction has has 1618 places, 1678 transitions, 3366 flow [2025-02-08 05:37:55,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1698.3333333333333) internal successors, (5095), 3 states have internal predecessors, (5095), 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,452 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:55,452 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] [2025-02-08 05:37:55,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:37:55,452 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 424 more)] === [2025-02-08 05:37:55,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:55,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1334520950, now seen corresponding path program 1 times [2025-02-08 05:37:55,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:55,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908308121] [2025-02-08 05:37:55,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:55,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:55,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-08 05:37:55,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-08 05:37:55,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:55,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:55,500 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,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:55,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908308121] [2025-02-08 05:37:55,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908308121] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:55,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:55,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:55,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20265725] [2025-02-08 05:37:55,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:55,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:55,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:55,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:55,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:55,519 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1697 out of 1747 [2025-02-08 05:37:55,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1618 places, 1678 transitions, 3366 flow. Second operand has 3 states, 3 states have (on average 1698.3333333333333) internal successors, (5095), 3 states have internal predecessors, (5095), 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,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:55,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1697 of 1747 [2025-02-08 05:37:55,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:56,163 INFO L124 PetriNetUnfolderBase]: 94/2128 cut-off events. [2025-02-08 05:37:56,163 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-02-08 05:37:56,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2163 conditions, 2128 events. 94/2128 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 10649 event pairs, 7 based on Foata normal form. 0/1710 useless extension candidates. Maximal degree in co-relation 2093. Up to 25 conditions per place. [2025-02-08 05:37:56,275 INFO L140 encePairwiseOnDemand]: 1744/1747 looper letters, 11 selfloop transitions, 2 changer transitions 0/1677 dead transitions. [2025-02-08 05:37:56,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1619 places, 1677 transitions, 3390 flow [2025-02-08 05:37:56,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:56,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:56,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5105 transitions. [2025-02-08 05:37:56,281 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9740507536729631 [2025-02-08 05:37:56,281 INFO L175 Difference]: Start difference. First operand has 1618 places, 1678 transitions, 3366 flow. Second operand 3 states and 5105 transitions. [2025-02-08 05:37:56,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1619 places, 1677 transitions, 3390 flow [2025-02-08 05:37:56,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1617 places, 1677 transitions, 3386 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:56,299 INFO L231 Difference]: Finished difference. Result has 1617 places, 1677 transitions, 3364 flow [2025-02-08 05:37:56,301 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1747, PETRI_DIFFERENCE_MINUEND_FLOW=3360, PETRI_DIFFERENCE_MINUEND_PLACES=1615, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1677, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1675, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3364, PETRI_PLACES=1617, PETRI_TRANSITIONS=1677} [2025-02-08 05:37:56,301 INFO L279 CegarLoopForPetriNet]: 1632 programPoint places, -15 predicate places. [2025-02-08 05:37:56,302 INFO L471 AbstractCegarLoop]: Abstraction has has 1617 places, 1677 transitions, 3364 flow [2025-02-08 05:37:56,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1698.3333333333333) internal successors, (5095), 3 states have internal predecessors, (5095), 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:56,304 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:56,305 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:56,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:37:56,305 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 424 more)] === [2025-02-08 05:37:56,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:56,305 INFO L85 PathProgramCache]: Analyzing trace with hash -990105314, now seen corresponding path program 1 times [2025-02-08 05:37:56,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:56,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795070542] [2025-02-08 05:37:56,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:56,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:56,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-08 05:37:56,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-08 05:37:56,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:56,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:56,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:56,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:56,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795070542] [2025-02-08 05:37:56,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795070542] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:56,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:56,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:56,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169847310] [2025-02-08 05:37:56,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:56,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:56,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:56,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:56,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:56,381 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1697 out of 1747 [2025-02-08 05:37:56,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1617 places, 1677 transitions, 3364 flow. Second operand has 3 states, 3 states have (on average 1698.3333333333333) internal successors, (5095), 3 states have internal predecessors, (5095), 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:56,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:56,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1697 of 1747 [2025-02-08 05:37:56,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:57,132 INFO L124 PetriNetUnfolderBase]: 94/2127 cut-off events. [2025-02-08 05:37:57,133 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-02-08 05:37:57,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2162 conditions, 2127 events. 94/2127 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 10936 event pairs, 7 based on Foata normal form. 0/1713 useless extension candidates. Maximal degree in co-relation 2084. Up to 25 conditions per place. [2025-02-08 05:37:57,248 INFO L140 encePairwiseOnDemand]: 1744/1747 looper letters, 11 selfloop transitions, 2 changer transitions 0/1676 dead transitions. [2025-02-08 05:37:57,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1618 places, 1676 transitions, 3388 flow [2025-02-08 05:37:57,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:57,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:57,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5105 transitions. [2025-02-08 05:37:57,254 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9740507536729631 [2025-02-08 05:37:57,254 INFO L175 Difference]: Start difference. First operand has 1617 places, 1677 transitions, 3364 flow. Second operand 3 states and 5105 transitions. [2025-02-08 05:37:57,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1618 places, 1676 transitions, 3388 flow [2025-02-08 05:37:57,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1616 places, 1676 transitions, 3384 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:57,275 INFO L231 Difference]: Finished difference. Result has 1616 places, 1676 transitions, 3362 flow [2025-02-08 05:37:57,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1747, PETRI_DIFFERENCE_MINUEND_FLOW=3358, PETRI_DIFFERENCE_MINUEND_PLACES=1614, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1676, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1674, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3362, PETRI_PLACES=1616, PETRI_TRANSITIONS=1676} [2025-02-08 05:37:57,277 INFO L279 CegarLoopForPetriNet]: 1632 programPoint places, -16 predicate places. [2025-02-08 05:37:57,278 INFO L471 AbstractCegarLoop]: Abstraction has has 1616 places, 1676 transitions, 3362 flow [2025-02-08 05:37:57,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1698.3333333333333) internal successors, (5095), 3 states have internal predecessors, (5095), 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,280 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:57,280 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:57,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:37:57,281 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 424 more)] === [2025-02-08 05:37:57,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:57,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1873865556, now seen corresponding path program 1 times [2025-02-08 05:37:57,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:57,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948161305] [2025-02-08 05:37:57,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:57,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:57,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-08 05:37:57,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-08 05:37:57,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:57,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:57,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:57,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:57,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948161305] [2025-02-08 05:37:57,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948161305] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:57,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:57,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:57,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235642320] [2025-02-08 05:37:57,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:57,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:57,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:57,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:57,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:57,387 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1689 out of 1747 [2025-02-08 05:37:57,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1616 places, 1676 transitions, 3362 flow. Second operand has 3 states, 3 states have (on average 1690.3333333333333) internal successors, (5071), 3 states have internal predecessors, (5071), 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,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:57,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1689 of 1747 [2025-02-08 05:37:57,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:01,045 INFO L124 PetriNetUnfolderBase]: 462/9640 cut-off events. [2025-02-08 05:38:01,045 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-02-08 05:38:01,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9723 conditions, 9640 events. 462/9640 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 86601 event pairs, 18 based on Foata normal form. 0/7565 useless extension candidates. Maximal degree in co-relation 9637. Up to 56 conditions per place. [2025-02-08 05:38:01,346 INFO L140 encePairwiseOnDemand]: 1744/1747 looper letters, 19 selfloop transitions, 2 changer transitions 0/1675 dead transitions. [2025-02-08 05:38:01,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1617 places, 1675 transitions, 3402 flow [2025-02-08 05:38:01,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:01,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:01,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5089 transitions. [2025-02-08 05:38:01,352 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9709979011639001 [2025-02-08 05:38:01,352 INFO L175 Difference]: Start difference. First operand has 1616 places, 1676 transitions, 3362 flow. Second operand 3 states and 5089 transitions. [2025-02-08 05:38:01,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1617 places, 1675 transitions, 3402 flow [2025-02-08 05:38:01,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1615 places, 1675 transitions, 3398 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:01,365 INFO L231 Difference]: Finished difference. Result has 1615 places, 1675 transitions, 3360 flow [2025-02-08 05:38:01,367 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1747, PETRI_DIFFERENCE_MINUEND_FLOW=3356, PETRI_DIFFERENCE_MINUEND_PLACES=1613, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1675, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1673, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3360, PETRI_PLACES=1615, PETRI_TRANSITIONS=1675} [2025-02-08 05:38:01,367 INFO L279 CegarLoopForPetriNet]: 1632 programPoint places, -17 predicate places. [2025-02-08 05:38:01,367 INFO L471 AbstractCegarLoop]: Abstraction has has 1615 places, 1675 transitions, 3360 flow [2025-02-08 05:38:01,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1690.3333333333333) internal successors, (5071), 3 states have internal predecessors, (5071), 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:01,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:01,369 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] [2025-02-08 05:38:01,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:38:01,369 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 424 more)] === [2025-02-08 05:38:01,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:01,369 INFO L85 PathProgramCache]: Analyzing trace with hash 2084060303, now seen corresponding path program 1 times [2025-02-08 05:38:01,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:01,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770042496] [2025-02-08 05:38:01,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:01,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:01,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 05:38:01,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 05:38:01,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:01,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:01,403 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:01,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:01,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770042496] [2025-02-08 05:38:01,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770042496] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:01,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:01,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:01,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803732765] [2025-02-08 05:38:01,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:01,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:01,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:01,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:01,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:01,455 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1684 out of 1747 [2025-02-08 05:38:01,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1615 places, 1675 transitions, 3360 flow. Second operand has 3 states, 3 states have (on average 1685.3333333333333) internal successors, (5056), 3 states have internal predecessors, (5056), 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:01,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:01,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1684 of 1747 [2025-02-08 05:38:01,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:06,962 INFO L124 PetriNetUnfolderBase]: 726/14949 cut-off events. [2025-02-08 05:38:06,962 INFO L125 PetriNetUnfolderBase]: For 1/3 co-relation queries the response was YES. [2025-02-08 05:38:07,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15073 conditions, 14949 events. 726/14949 cut-off events. For 1/3 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 150450 event pairs, 30 based on Foata normal form. 0/11701 useless extension candidates. Maximal degree in co-relation 14979. Up to 85 conditions per place. [2025-02-08 05:38:07,477 INFO L140 encePairwiseOnDemand]: 1744/1747 looper letters, 24 selfloop transitions, 2 changer transitions 0/1674 dead transitions. [2025-02-08 05:38:07,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1616 places, 1674 transitions, 3410 flow [2025-02-08 05:38:07,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:07,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:07,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5079 transitions. [2025-02-08 05:38:07,482 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9690898683457355 [2025-02-08 05:38:07,482 INFO L175 Difference]: Start difference. First operand has 1615 places, 1675 transitions, 3360 flow. Second operand 3 states and 5079 transitions. [2025-02-08 05:38:07,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1616 places, 1674 transitions, 3410 flow [2025-02-08 05:38:07,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1614 places, 1674 transitions, 3406 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:07,497 INFO L231 Difference]: Finished difference. Result has 1614 places, 1674 transitions, 3358 flow [2025-02-08 05:38:07,500 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1747, PETRI_DIFFERENCE_MINUEND_FLOW=3354, PETRI_DIFFERENCE_MINUEND_PLACES=1612, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1674, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1672, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3358, PETRI_PLACES=1614, PETRI_TRANSITIONS=1674} [2025-02-08 05:38:07,503 INFO L279 CegarLoopForPetriNet]: 1632 programPoint places, -18 predicate places. [2025-02-08 05:38:07,503 INFO L471 AbstractCegarLoop]: Abstraction has has 1614 places, 1674 transitions, 3358 flow [2025-02-08 05:38:07,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1685.3333333333333) internal successors, (5056), 3 states have internal predecessors, (5056), 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,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:07,504 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:07,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:38:07,504 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 424 more)] === [2025-02-08 05:38:07,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:07,505 INFO L85 PathProgramCache]: Analyzing trace with hash -799413694, now seen corresponding path program 1 times [2025-02-08 05:38:07,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:07,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407366076] [2025-02-08 05:38:07,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:07,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:07,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-08 05:38:07,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-08 05:38:07,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:07,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:07,575 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,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:07,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407366076] [2025-02-08 05:38:07,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407366076] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:07,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:07,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:07,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946650387] [2025-02-08 05:38:07,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:07,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:07,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:07,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:07,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:07,618 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1688 out of 1747 [2025-02-08 05:38:07,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1614 places, 1674 transitions, 3358 flow. Second operand has 3 states, 3 states have (on average 1689.3333333333333) internal successors, (5068), 3 states have internal predecessors, (5068), 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,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:07,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1688 of 1747 [2025-02-08 05:38:07,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:09,879 INFO L124 PetriNetUnfolderBase]: 273/5660 cut-off events. [2025-02-08 05:38:09,880 INFO L125 PetriNetUnfolderBase]: For 10/13 co-relation queries the response was YES. [2025-02-08 05:38:10,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5735 conditions, 5660 events. 273/5660 cut-off events. For 10/13 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 41636 event pairs, 18 based on Foata normal form. 0/4465 useless extension candidates. Maximal degree in co-relation 5633. Up to 57 conditions per place. [2025-02-08 05:38:10,193 INFO L140 encePairwiseOnDemand]: 1744/1747 looper letters, 20 selfloop transitions, 2 changer transitions 0/1673 dead transitions. [2025-02-08 05:38:10,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1615 places, 1673 transitions, 3400 flow [2025-02-08 05:38:10,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:10,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:10,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5087 transitions. [2025-02-08 05:38:10,199 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9706162946002671 [2025-02-08 05:38:10,199 INFO L175 Difference]: Start difference. First operand has 1614 places, 1674 transitions, 3358 flow. Second operand 3 states and 5087 transitions. [2025-02-08 05:38:10,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1615 places, 1673 transitions, 3400 flow [2025-02-08 05:38:10,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1613 places, 1673 transitions, 3396 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:10,358 INFO L231 Difference]: Finished difference. Result has 1613 places, 1673 transitions, 3356 flow [2025-02-08 05:38:10,360 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1747, PETRI_DIFFERENCE_MINUEND_FLOW=3352, PETRI_DIFFERENCE_MINUEND_PLACES=1611, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1673, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1671, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3356, PETRI_PLACES=1613, PETRI_TRANSITIONS=1673} [2025-02-08 05:38:10,360 INFO L279 CegarLoopForPetriNet]: 1632 programPoint places, -19 predicate places. [2025-02-08 05:38:10,361 INFO L471 AbstractCegarLoop]: Abstraction has has 1613 places, 1673 transitions, 3356 flow [2025-02-08 05:38:10,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1689.3333333333333) internal successors, (5068), 3 states have internal predecessors, (5068), 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,361 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:10,362 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] [2025-02-08 05:38:10,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:38:10,362 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 424 more)] === [2025-02-08 05:38:10,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:10,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1610210917, now seen corresponding path program 1 times [2025-02-08 05:38:10,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:10,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158277066] [2025-02-08 05:38:10,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:10,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:10,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-08 05:38:10,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-08 05:38:10,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:10,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:10,394 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,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:10,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158277066] [2025-02-08 05:38:10,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158277066] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:10,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:10,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:10,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584168538] [2025-02-08 05:38:10,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:10,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:10,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:10,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:10,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:10,450 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1684 out of 1747 [2025-02-08 05:38:10,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1613 places, 1673 transitions, 3356 flow. Second operand has 3 states, 3 states have (on average 1685.3333333333333) internal successors, (5056), 3 states have internal predecessors, (5056), 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,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:10,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1684 of 1747 [2025-02-08 05:38:10,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:13,554 INFO L124 PetriNetUnfolderBase]: 411/8317 cut-off events. [2025-02-08 05:38:13,554 INFO L125 PetriNetUnfolderBase]: For 16/24 co-relation queries the response was YES. [2025-02-08 05:38:13,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8426 conditions, 8317 events. 411/8317 cut-off events. For 16/24 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 69915 event pairs, 30 based on Foata normal form. 0/6531 useless extension candidates. Maximal degree in co-relation 8316. Up to 85 conditions per place. [2025-02-08 05:38:13,919 INFO L140 encePairwiseOnDemand]: 1744/1747 looper letters, 24 selfloop transitions, 2 changer transitions 0/1672 dead transitions. [2025-02-08 05:38:13,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1614 places, 1672 transitions, 3406 flow [2025-02-08 05:38:13,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:13,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:13,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5079 transitions. [2025-02-08 05:38:13,926 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9690898683457355 [2025-02-08 05:38:13,926 INFO L175 Difference]: Start difference. First operand has 1613 places, 1673 transitions, 3356 flow. Second operand 3 states and 5079 transitions. [2025-02-08 05:38:13,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1614 places, 1672 transitions, 3406 flow [2025-02-08 05:38:13,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1612 places, 1672 transitions, 3402 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:13,943 INFO L231 Difference]: Finished difference. Result has 1612 places, 1672 transitions, 3354 flow [2025-02-08 05:38:13,944 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1747, PETRI_DIFFERENCE_MINUEND_FLOW=3350, PETRI_DIFFERENCE_MINUEND_PLACES=1610, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1672, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1670, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3354, PETRI_PLACES=1612, PETRI_TRANSITIONS=1672} [2025-02-08 05:38:13,945 INFO L279 CegarLoopForPetriNet]: 1632 programPoint places, -20 predicate places. [2025-02-08 05:38:13,945 INFO L471 AbstractCegarLoop]: Abstraction has has 1612 places, 1672 transitions, 3354 flow [2025-02-08 05:38:13,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1685.3333333333333) internal successors, (5056), 3 states have internal predecessors, (5056), 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:13,946 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:13,946 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] [2025-02-08 05:38:13,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:38:13,946 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 424 more)] === [2025-02-08 05:38:13,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:13,947 INFO L85 PathProgramCache]: Analyzing trace with hash 920829022, now seen corresponding path program 1 times [2025-02-08 05:38:13,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:13,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517430997] [2025-02-08 05:38:13,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:13,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:13,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-08 05:38:13,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-08 05:38:13,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:13,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:13,986 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:13,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:13,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517430997] [2025-02-08 05:38:13,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517430997] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:13,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:13,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:13,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439878155] [2025-02-08 05:38:13,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:13,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:13,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:13,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:13,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:14,034 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1688 out of 1747 [2025-02-08 05:38:14,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1612 places, 1672 transitions, 3354 flow. Second operand has 3 states, 3 states have (on average 1689.3333333333333) internal successors, (5068), 3 states have internal predecessors, (5068), 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:14,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:14,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1688 of 1747 [2025-02-08 05:38:14,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:14,702 INFO L124 PetriNetUnfolderBase]: 84/1707 cut-off events. [2025-02-08 05:38:14,702 INFO L125 PetriNetUnfolderBase]: For 10/12 co-relation queries the response was YES. [2025-02-08 05:38:14,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1773 conditions, 1707 events. 84/1707 cut-off events. For 10/12 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 8457 event pairs, 18 based on Foata normal form. 0/1393 useless extension candidates. Maximal degree in co-relation 1655. Up to 57 conditions per place. [2025-02-08 05:38:14,791 INFO L140 encePairwiseOnDemand]: 1744/1747 looper letters, 20 selfloop transitions, 2 changer transitions 0/1671 dead transitions. [2025-02-08 05:38:14,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1613 places, 1671 transitions, 3396 flow [2025-02-08 05:38:14,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:14,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:14,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5087 transitions. [2025-02-08 05:38:14,797 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9706162946002671 [2025-02-08 05:38:14,797 INFO L175 Difference]: Start difference. First operand has 1612 places, 1672 transitions, 3354 flow. Second operand 3 states and 5087 transitions. [2025-02-08 05:38:14,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1613 places, 1671 transitions, 3396 flow [2025-02-08 05:38:14,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1611 places, 1671 transitions, 3392 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:14,813 INFO L231 Difference]: Finished difference. Result has 1611 places, 1671 transitions, 3352 flow [2025-02-08 05:38:14,814 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1747, PETRI_DIFFERENCE_MINUEND_FLOW=3348, PETRI_DIFFERENCE_MINUEND_PLACES=1609, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1669, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3352, PETRI_PLACES=1611, PETRI_TRANSITIONS=1671} [2025-02-08 05:38:14,814 INFO L279 CegarLoopForPetriNet]: 1632 programPoint places, -21 predicate places. [2025-02-08 05:38:14,814 INFO L471 AbstractCegarLoop]: Abstraction has has 1611 places, 1671 transitions, 3352 flow [2025-02-08 05:38:14,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1689.3333333333333) internal successors, (5068), 3 states have internal predecessors, (5068), 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:14,815 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:14,815 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] [2025-02-08 05:38:14,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:38:14,815 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 424 more)] === [2025-02-08 05:38:14,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:14,816 INFO L85 PathProgramCache]: Analyzing trace with hash -940465215, now seen corresponding path program 1 times [2025-02-08 05:38:14,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:14,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576280687] [2025-02-08 05:38:14,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:14,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:14,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-08 05:38:14,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-08 05:38:14,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:14,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:14,862 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:14,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:14,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576280687] [2025-02-08 05:38:14,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576280687] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:14,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:14,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:14,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471234594] [2025-02-08 05:38:14,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:14,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:14,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:14,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:14,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:14,916 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1684 out of 1747 [2025-02-08 05:38:14,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1611 places, 1671 transitions, 3352 flow. Second operand has 3 states, 3 states have (on average 1685.3333333333333) internal successors, (5056), 3 states have internal predecessors, (5056), 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:14,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:14,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1684 of 1747 [2025-02-08 05:38:14,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:15,604 INFO L124 PetriNetUnfolderBase]: 127/2357 cut-off events. [2025-02-08 05:38:15,604 INFO L125 PetriNetUnfolderBase]: For 32/34 co-relation queries the response was YES. [2025-02-08 05:38:15,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2452 conditions, 2357 events. 127/2357 cut-off events. For 32/34 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 13670 event pairs, 30 based on Foata normal form. 0/1896 useless extension candidates. Maximal degree in co-relation 2326. Up to 86 conditions per place. [2025-02-08 05:38:15,708 INFO L140 encePairwiseOnDemand]: 1744/1747 looper letters, 24 selfloop transitions, 2 changer transitions 0/1670 dead transitions. [2025-02-08 05:38:15,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1612 places, 1670 transitions, 3402 flow [2025-02-08 05:38:15,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:15,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:15,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5079 transitions. [2025-02-08 05:38:15,714 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9690898683457355 [2025-02-08 05:38:15,714 INFO L175 Difference]: Start difference. First operand has 1611 places, 1671 transitions, 3352 flow. Second operand 3 states and 5079 transitions. [2025-02-08 05:38:15,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1612 places, 1670 transitions, 3402 flow [2025-02-08 05:38:15,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1610 places, 1670 transitions, 3398 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:15,731 INFO L231 Difference]: Finished difference. Result has 1610 places, 1670 transitions, 3350 flow [2025-02-08 05:38:15,733 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1747, PETRI_DIFFERENCE_MINUEND_FLOW=3346, PETRI_DIFFERENCE_MINUEND_PLACES=1608, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1670, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1668, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3350, PETRI_PLACES=1610, PETRI_TRANSITIONS=1670} [2025-02-08 05:38:15,733 INFO L279 CegarLoopForPetriNet]: 1632 programPoint places, -22 predicate places. [2025-02-08 05:38:15,733 INFO L471 AbstractCegarLoop]: Abstraction has has 1610 places, 1670 transitions, 3350 flow [2025-02-08 05:38:15,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1685.3333333333333) internal successors, (5056), 3 states have internal predecessors, (5056), 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,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:15,735 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:15,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:38:15,735 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 424 more)] === [2025-02-08 05:38:15,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:15,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1521047074, now seen corresponding path program 1 times [2025-02-08 05:38:15,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:15,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904312823] [2025-02-08 05:38:15,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:15,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:15,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-08 05:38:15,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-08 05:38:15,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:15,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:15,780 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:15,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:15,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904312823] [2025-02-08 05:38:15,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904312823] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:15,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:15,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:15,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926990445] [2025-02-08 05:38:15,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:15,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:15,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:15,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:15,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:15,810 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1691 out of 1747 [2025-02-08 05:38:15,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1610 places, 1670 transitions, 3350 flow. Second operand has 3 states, 3 states have (on average 1692.3333333333333) internal successors, (5077), 3 states have internal predecessors, (5077), 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,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:15,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1691 of 1747 [2025-02-08 05:38:15,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:17,713 INFO L124 PetriNetUnfolderBase]: 382/6893 cut-off events. [2025-02-08 05:38:17,713 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:38:17,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7060 conditions, 6893 events. 382/6893 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 61360 event pairs, 64 based on Foata normal form. 0/5425 useless extension candidates. Maximal degree in co-relation 6926. Up to 130 conditions per place. [2025-02-08 05:38:17,936 INFO L140 encePairwiseOnDemand]: 1744/1747 looper letters, 17 selfloop transitions, 2 changer transitions 0/1669 dead transitions. [2025-02-08 05:38:17,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1611 places, 1669 transitions, 3386 flow [2025-02-08 05:38:17,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:17,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:17,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5093 transitions. [2025-02-08 05:38:17,940 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9717611142911659 [2025-02-08 05:38:17,940 INFO L175 Difference]: Start difference. First operand has 1610 places, 1670 transitions, 3350 flow. Second operand 3 states and 5093 transitions. [2025-02-08 05:38:17,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1611 places, 1669 transitions, 3386 flow [2025-02-08 05:38:17,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1609 places, 1669 transitions, 3382 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:17,952 INFO L231 Difference]: Finished difference. Result has 1609 places, 1669 transitions, 3348 flow [2025-02-08 05:38:17,953 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1747, PETRI_DIFFERENCE_MINUEND_FLOW=3344, PETRI_DIFFERENCE_MINUEND_PLACES=1607, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1669, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1667, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3348, PETRI_PLACES=1609, PETRI_TRANSITIONS=1669} [2025-02-08 05:38:17,953 INFO L279 CegarLoopForPetriNet]: 1632 programPoint places, -23 predicate places. [2025-02-08 05:38:17,953 INFO L471 AbstractCegarLoop]: Abstraction has has 1609 places, 1669 transitions, 3348 flow [2025-02-08 05:38:17,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1692.3333333333333) internal successors, (5077), 3 states have internal predecessors, (5077), 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,957 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:17,957 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] [2025-02-08 05:38:17,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:38:17,957 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 424 more)] === [2025-02-08 05:38:17,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:17,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1511981069, now seen corresponding path program 1 times [2025-02-08 05:38:17,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:17,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308104677] [2025-02-08 05:38:17,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:17,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:17,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-08 05:38:17,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-08 05:38:17,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:17,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:17,995 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,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:17,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308104677] [2025-02-08 05:38:17,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308104677] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:17,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:17,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:17,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176479821] [2025-02-08 05:38:17,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:17,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:17,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:17,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:17,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:18,030 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1691 out of 1747 [2025-02-08 05:38:18,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1609 places, 1669 transitions, 3348 flow. Second operand has 3 states, 3 states have (on average 1692.3333333333333) internal successors, (5077), 3 states have internal predecessors, (5077), 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,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:18,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1691 of 1747 [2025-02-08 05:38:18,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:19,501 INFO L124 PetriNetUnfolderBase]: 308/6092 cut-off events. [2025-02-08 05:38:19,502 INFO L125 PetriNetUnfolderBase]: For 10/12 co-relation queries the response was YES. [2025-02-08 05:38:19,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6191 conditions, 6092 events. 308/6092 cut-off events. For 10/12 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 51206 event pairs, 32 based on Foata normal form. 0/4802 useless extension candidates. Maximal degree in co-relation 6049. Up to 82 conditions per place. [2025-02-08 05:38:19,796 INFO L140 encePairwiseOnDemand]: 1744/1747 looper letters, 17 selfloop transitions, 2 changer transitions 0/1668 dead transitions. [2025-02-08 05:38:19,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1610 places, 1668 transitions, 3384 flow [2025-02-08 05:38:19,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:19,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:19,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5093 transitions. [2025-02-08 05:38:19,799 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9717611142911659 [2025-02-08 05:38:19,799 INFO L175 Difference]: Start difference. First operand has 1609 places, 1669 transitions, 3348 flow. Second operand 3 states and 5093 transitions. [2025-02-08 05:38:19,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1610 places, 1668 transitions, 3384 flow [2025-02-08 05:38:19,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1608 places, 1668 transitions, 3380 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:19,811 INFO L231 Difference]: Finished difference. Result has 1608 places, 1668 transitions, 3346 flow [2025-02-08 05:38:19,812 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1747, PETRI_DIFFERENCE_MINUEND_FLOW=3342, PETRI_DIFFERENCE_MINUEND_PLACES=1606, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1668, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1666, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3346, PETRI_PLACES=1608, PETRI_TRANSITIONS=1668} [2025-02-08 05:38:19,812 INFO L279 CegarLoopForPetriNet]: 1632 programPoint places, -24 predicate places. [2025-02-08 05:38:19,812 INFO L471 AbstractCegarLoop]: Abstraction has has 1608 places, 1668 transitions, 3346 flow [2025-02-08 05:38:19,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1692.3333333333333) internal successors, (5077), 3 states have internal predecessors, (5077), 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,813 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:19,813 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] [2025-02-08 05:38:19,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:38:19,813 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 424 more)] === [2025-02-08 05:38:19,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:19,813 INFO L85 PathProgramCache]: Analyzing trace with hash -410776962, now seen corresponding path program 1 times [2025-02-08 05:38:19,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:19,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246733101] [2025-02-08 05:38:19,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:19,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:19,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-08 05:38:19,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-08 05:38:19,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:19,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:19,838 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:19,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:19,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246733101] [2025-02-08 05:38:19,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246733101] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:19,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:19,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:19,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711058401] [2025-02-08 05:38:19,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:19,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:19,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:19,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:19,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:19,870 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1691 out of 1747 [2025-02-08 05:38:19,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1608 places, 1668 transitions, 3346 flow. Second operand has 3 states, 3 states have (on average 1692.3333333333333) internal successors, (5077), 3 states have internal predecessors, (5077), 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,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:19,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1691 of 1747 [2025-02-08 05:38:19,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:21,300 INFO L124 PetriNetUnfolderBase]: 293/5166 cut-off events. [2025-02-08 05:38:21,301 INFO L125 PetriNetUnfolderBase]: For 29/70 co-relation queries the response was YES. [2025-02-08 05:38:21,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5318 conditions, 5166 events. 293/5166 cut-off events. For 29/70 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 40566 event pairs, 64 based on Foata normal form. 0/4092 useless extension candidates. Maximal degree in co-relation 5168. Up to 139 conditions per place. [2025-02-08 05:38:21,596 INFO L140 encePairwiseOnDemand]: 1744/1747 looper letters, 17 selfloop transitions, 2 changer transitions 0/1667 dead transitions. [2025-02-08 05:38:21,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1609 places, 1667 transitions, 3382 flow [2025-02-08 05:38:21,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:21,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:21,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5093 transitions. [2025-02-08 05:38:21,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9717611142911659 [2025-02-08 05:38:21,598 INFO L175 Difference]: Start difference. First operand has 1608 places, 1668 transitions, 3346 flow. Second operand 3 states and 5093 transitions. [2025-02-08 05:38:21,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1609 places, 1667 transitions, 3382 flow [2025-02-08 05:38:21,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1607 places, 1667 transitions, 3378 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:21,612 INFO L231 Difference]: Finished difference. Result has 1607 places, 1667 transitions, 3344 flow [2025-02-08 05:38:21,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1747, PETRI_DIFFERENCE_MINUEND_FLOW=3340, PETRI_DIFFERENCE_MINUEND_PLACES=1605, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1667, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1665, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3344, PETRI_PLACES=1607, PETRI_TRANSITIONS=1667} [2025-02-08 05:38:21,613 INFO L279 CegarLoopForPetriNet]: 1632 programPoint places, -25 predicate places. [2025-02-08 05:38:21,613 INFO L471 AbstractCegarLoop]: Abstraction has has 1607 places, 1667 transitions, 3344 flow [2025-02-08 05:38:21,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1692.3333333333333) internal successors, (5077), 3 states have internal predecessors, (5077), 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,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:21,614 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] [2025-02-08 05:38:21,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:38:21,614 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 424 more)] === [2025-02-08 05:38:21,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:21,615 INFO L85 PathProgramCache]: Analyzing trace with hash 889767541, now seen corresponding path program 1 times [2025-02-08 05:38:21,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:21,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970676162] [2025-02-08 05:38:21,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:21,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:21,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-08 05:38:21,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-08 05:38:21,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:21,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:21,643 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,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:21,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970676162] [2025-02-08 05:38:21,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970676162] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:21,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:21,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:21,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540519359] [2025-02-08 05:38:21,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:21,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:21,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:21,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:21,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:21,698 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1685 out of 1747 [2025-02-08 05:38:21,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1607 places, 1667 transitions, 3344 flow. Second operand has 3 states, 3 states have (on average 1686.3333333333333) internal successors, (5059), 3 states have internal predecessors, (5059), 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,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:21,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1685 of 1747 [2025-02-08 05:38:21,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:27,135 INFO L124 PetriNetUnfolderBase]: 682/14056 cut-off events. [2025-02-08 05:38:27,135 INFO L125 PetriNetUnfolderBase]: For 1/3 co-relation queries the response was YES. [2025-02-08 05:38:27,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14173 conditions, 14056 events. 682/14056 cut-off events. For 1/3 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 140366 event pairs, 28 based on Foata normal form. 0/11017 useless extension candidates. Maximal degree in co-relation 14015. Up to 80 conditions per place. [2025-02-08 05:38:27,957 INFO L140 encePairwiseOnDemand]: 1744/1747 looper letters, 23 selfloop transitions, 2 changer transitions 0/1666 dead transitions. [2025-02-08 05:38:27,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1608 places, 1666 transitions, 3392 flow [2025-02-08 05:38:27,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:27,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:27,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5081 transitions. [2025-02-08 05:38:27,961 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9694714749093685 [2025-02-08 05:38:27,961 INFO L175 Difference]: Start difference. First operand has 1607 places, 1667 transitions, 3344 flow. Second operand 3 states and 5081 transitions. [2025-02-08 05:38:27,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1608 places, 1666 transitions, 3392 flow [2025-02-08 05:38:27,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1606 places, 1666 transitions, 3388 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:27,979 INFO L231 Difference]: Finished difference. Result has 1606 places, 1666 transitions, 3342 flow [2025-02-08 05:38:27,980 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1747, PETRI_DIFFERENCE_MINUEND_FLOW=3338, PETRI_DIFFERENCE_MINUEND_PLACES=1604, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1666, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1664, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3342, PETRI_PLACES=1606, PETRI_TRANSITIONS=1666} [2025-02-08 05:38:27,980 INFO L279 CegarLoopForPetriNet]: 1632 programPoint places, -26 predicate places. [2025-02-08 05:38:27,980 INFO L471 AbstractCegarLoop]: Abstraction has has 1606 places, 1666 transitions, 3342 flow [2025-02-08 05:38:27,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1686.3333333333333) internal successors, (5059), 3 states have internal predecessors, (5059), 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:27,981 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:27,981 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] [2025-02-08 05:38:27,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:38:27,981 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 424 more)] === [2025-02-08 05:38:27,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:27,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1601394223, now seen corresponding path program 1 times [2025-02-08 05:38:27,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:27,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862516841] [2025-02-08 05:38:27,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:27,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:27,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-08 05:38:27,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-08 05:38:27,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:27,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:28,032 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,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:28,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862516841] [2025-02-08 05:38:28,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862516841] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:28,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:28,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:28,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556664713] [2025-02-08 05:38:28,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:28,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:28,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:28,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:28,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:28,087 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1685 out of 1747 [2025-02-08 05:38:28,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1606 places, 1666 transitions, 3342 flow. Second operand has 3 states, 3 states have (on average 1686.3333333333333) internal successors, (5059), 3 states have internal predecessors, (5059), 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,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:28,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1685 of 1747 [2025-02-08 05:38:28,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:30,828 INFO L124 PetriNetUnfolderBase]: 388/7867 cut-off events. [2025-02-08 05:38:30,828 INFO L125 PetriNetUnfolderBase]: For 15/18 co-relation queries the response was YES. [2025-02-08 05:38:31,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7970 conditions, 7867 events. 388/7867 cut-off events. For 15/18 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 64857 event pairs, 28 based on Foata normal form. 0/6191 useless extension candidates. Maximal degree in co-relation 7804. Up to 80 conditions per place. [2025-02-08 05:38:31,425 INFO L140 encePairwiseOnDemand]: 1744/1747 looper letters, 23 selfloop transitions, 2 changer transitions 0/1665 dead transitions. [2025-02-08 05:38:31,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1607 places, 1665 transitions, 3390 flow [2025-02-08 05:38:31,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:31,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:31,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5081 transitions. [2025-02-08 05:38:31,428 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9694714749093685 [2025-02-08 05:38:31,428 INFO L175 Difference]: Start difference. First operand has 1606 places, 1666 transitions, 3342 flow. Second operand 3 states and 5081 transitions. [2025-02-08 05:38:31,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1607 places, 1665 transitions, 3390 flow [2025-02-08 05:38:31,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1605 places, 1665 transitions, 3386 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:31,443 INFO L231 Difference]: Finished difference. Result has 1605 places, 1665 transitions, 3340 flow [2025-02-08 05:38:31,445 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1747, PETRI_DIFFERENCE_MINUEND_FLOW=3336, PETRI_DIFFERENCE_MINUEND_PLACES=1603, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1665, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1663, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3340, PETRI_PLACES=1605, PETRI_TRANSITIONS=1665} [2025-02-08 05:38:31,445 INFO L279 CegarLoopForPetriNet]: 1632 programPoint places, -27 predicate places. [2025-02-08 05:38:31,445 INFO L471 AbstractCegarLoop]: Abstraction has has 1605 places, 1665 transitions, 3340 flow [2025-02-08 05:38:31,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1686.3333333333333) internal successors, (5059), 3 states have internal predecessors, (5059), 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,446 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:31,446 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] [2025-02-08 05:38:31,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:38:31,446 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 424 more)] === [2025-02-08 05:38:31,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:31,447 INFO L85 PathProgramCache]: Analyzing trace with hash -782547151, now seen corresponding path program 1 times [2025-02-08 05:38:31,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:31,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799333873] [2025-02-08 05:38:31,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:31,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:31,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-08 05:38:31,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-08 05:38:31,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:31,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:31,477 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,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:31,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799333873] [2025-02-08 05:38:31,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799333873] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:31,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:31,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:31,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006201467] [2025-02-08 05:38:31,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:31,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:31,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:31,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:31,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:31,528 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1685 out of 1747 [2025-02-08 05:38:31,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1605 places, 1665 transitions, 3340 flow. Second operand has 3 states, 3 states have (on average 1686.3333333333333) internal successors, (5059), 3 states have internal predecessors, (5059), 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,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:31,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1685 of 1747 [2025-02-08 05:38:31,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:32,034 INFO L124 PetriNetUnfolderBase]: 94/1720 cut-off events. [2025-02-08 05:38:32,034 INFO L125 PetriNetUnfolderBase]: For 15/17 co-relation queries the response was YES. [2025-02-08 05:38:32,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1809 conditions, 1720 events. 94/1720 cut-off events. For 15/17 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 8859 event pairs, 28 based on Foata normal form. 0/1414 useless extension candidates. Maximal degree in co-relation 1635. Up to 80 conditions per place. [2025-02-08 05:38:32,116 INFO L140 encePairwiseOnDemand]: 1744/1747 looper letters, 23 selfloop transitions, 2 changer transitions 0/1664 dead transitions. [2025-02-08 05:38:32,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1606 places, 1664 transitions, 3388 flow [2025-02-08 05:38:32,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:32,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:32,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5081 transitions. [2025-02-08 05:38:32,118 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9694714749093685 [2025-02-08 05:38:32,118 INFO L175 Difference]: Start difference. First operand has 1605 places, 1665 transitions, 3340 flow. Second operand 3 states and 5081 transitions. [2025-02-08 05:38:32,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1606 places, 1664 transitions, 3388 flow [2025-02-08 05:38:32,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1604 places, 1664 transitions, 3384 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:32,134 INFO L231 Difference]: Finished difference. Result has 1604 places, 1664 transitions, 3338 flow [2025-02-08 05:38:32,136 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1747, PETRI_DIFFERENCE_MINUEND_FLOW=3334, PETRI_DIFFERENCE_MINUEND_PLACES=1602, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1664, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1662, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3338, PETRI_PLACES=1604, PETRI_TRANSITIONS=1664} [2025-02-08 05:38:32,136 INFO L279 CegarLoopForPetriNet]: 1632 programPoint places, -28 predicate places. [2025-02-08 05:38:32,136 INFO L471 AbstractCegarLoop]: Abstraction has has 1604 places, 1664 transitions, 3338 flow [2025-02-08 05:38:32,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1686.3333333333333) internal successors, (5059), 3 states have internal predecessors, (5059), 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:32,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:32,137 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] [2025-02-08 05:38:32,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:38:32,137 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 424 more)] === [2025-02-08 05:38:32,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:32,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1742797136, now seen corresponding path program 1 times [2025-02-08 05:38:32,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:32,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891830320] [2025-02-08 05:38:32,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:32,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:32,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-08 05:38:32,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-08 05:38:32,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:32,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:32,288 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:32,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:32,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891830320] [2025-02-08 05:38:32,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891830320] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:32,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:32,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:32,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560182694] [2025-02-08 05:38:32,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:32,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:32,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:32,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:32,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:32,440 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1649 out of 1747 [2025-02-08 05:38:32,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1604 places, 1664 transitions, 3338 flow. Second operand has 3 states, 3 states have (on average 1651.0) internal successors, (4953), 3 states have internal predecessors, (4953), 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:32,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:32,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1649 of 1747 [2025-02-08 05:38:32,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand