./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/parallel-parallel-sum-2.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/parallel-parallel-sum-2.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 aee5edffc06a346ddce4a9cfa75b4213bee8ccd3009aa5307dc09037d26d7f28 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:39:26,710 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:39:26,753 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:39:26,757 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:39:26,757 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:39:26,770 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:39:26,771 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:39:26,771 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:39:26,771 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:39:26,771 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:39:26,771 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:39:26,771 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:39:26,771 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:39:26,772 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:39:26,772 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:39:26,772 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:39:26,772 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:39:26,772 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:39:26,772 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:39:26,772 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:39:26,772 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:39:26,772 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:39:26,772 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:39:26,772 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:39:26,772 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:39:26,773 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:39:26,773 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:39:26,773 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:39:26,773 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:39:26,773 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:39:26,773 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:39:26,773 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:39:26,773 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:39:26,773 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:39:26,773 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:39:26,773 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:39:26,773 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:39:26,773 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:39:26,774 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:39:26,774 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:39:26,774 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:39:26,774 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:39:26,774 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 -> aee5edffc06a346ddce4a9cfa75b4213bee8ccd3009aa5307dc09037d26d7f28 [2025-02-08 05:39:26,962 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:39:26,969 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:39:26,972 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:39:26,973 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:39:26,973 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:39:26,974 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-parallel-sum-2.wvr.c [2025-02-08 05:39:28,174 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2c48aac06/8a56bd7223ed486aa335e6af86a2619e/FLAG6573874e4 [2025-02-08 05:39:28,456 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:39:28,459 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-parallel-sum-2.wvr.c [2025-02-08 05:39:28,468 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2c48aac06/8a56bd7223ed486aa335e6af86a2619e/FLAG6573874e4 [2025-02-08 05:39:28,748 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2c48aac06/8a56bd7223ed486aa335e6af86a2619e [2025-02-08 05:39:28,750 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:39:28,751 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:39:28,752 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:39:28,753 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:39:28,755 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:39:28,756 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:39:28" (1/1) ... [2025-02-08 05:39:28,756 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70260108 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:28, skipping insertion in model container [2025-02-08 05:39:28,757 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:39:28" (1/1) ... [2025-02-08 05:39:28,773 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:39:28,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:39:28,940 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:39:28,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:39:28,996 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:39:28,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:28 WrapperNode [2025-02-08 05:39:28,998 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:39:28,999 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:39:28,999 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:39:28,999 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:39:29,004 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:28" (1/1) ... [2025-02-08 05:39:29,016 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:28" (1/1) ... [2025-02-08 05:39:29,042 INFO L138 Inliner]: procedures = 28, calls = 59, calls flagged for inlining = 23, calls inlined = 33, statements flattened = 629 [2025-02-08 05:39:29,043 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:39:29,043 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:39:29,044 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:39:29,044 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:39:29,048 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:28" (1/1) ... [2025-02-08 05:39:29,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:28" (1/1) ... [2025-02-08 05:39:29,053 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:28" (1/1) ... [2025-02-08 05:39:29,053 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:28" (1/1) ... [2025-02-08 05:39:29,062 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:28" (1/1) ... [2025-02-08 05:39:29,070 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:28" (1/1) ... [2025-02-08 05:39:29,071 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:28" (1/1) ... [2025-02-08 05:39:29,072 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:28" (1/1) ... [2025-02-08 05:39:29,078 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:39:29,079 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:39:29,079 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:39:29,079 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:39:29,080 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:28" (1/1) ... [2025-02-08 05:39:29,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:39:29,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:39:29,113 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:39:29,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:39:29,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:39:29,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:39:29,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:39:29,132 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:39:29,132 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:39:29,132 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:39:29,132 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:39:29,132 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 05:39:29,132 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 05:39:29,132 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-08 05:39:29,133 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-08 05:39:29,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:39:29,133 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-02-08 05:39:29,133 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-02-08 05:39:29,133 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-02-08 05:39:29,133 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-02-08 05:39:29,133 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 05:39:29,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 05:39:29,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:39:29,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:39:29,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:39:29,135 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:39:29,260 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:39:29,262 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:39:29,425 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56: [2025-02-08 05:39:29,426 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55: havoc #t~nondet7#1; [2025-02-08 05:39:29,426 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-1: assume #race~s11~0 == #t~nondet7#1; [2025-02-08 05:39:29,426 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-1: assume !(#race~s11~0 == #t~nondet7#1); [2025-02-08 05:39:29,426 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-2: havoc #t~ret6#1; [2025-02-08 05:39:29,426 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-3: #race~s11~0 := #t~nondet7#1; [2025-02-08 05:39:29,426 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-4: havoc #t~nondet7#1; [2025-02-08 05:39:29,426 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-5: ~s11~0 := #t~ret6#1; [2025-02-08 05:39:29,426 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-6: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647; [2025-02-08 05:39:29,426 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-7: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:39:29,427 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-8: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:39:29,427 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-9: #t~ret6#1 := plus_#res#1; [2025-02-08 05:39:29,525 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70: havoc #t~nondet14#1; [2025-02-08 05:39:29,526 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-1: assume #race~s21~0 == #t~nondet14#1; [2025-02-08 05:39:29,526 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-1: assume !(#race~s21~0 == #t~nondet14#1); [2025-02-08 05:39:29,526 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-2: havoc #t~ret13#1; [2025-02-08 05:39:29,526 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-3: #race~s21~0 := #t~nondet14#1; [2025-02-08 05:39:29,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-4: havoc #t~nondet14#1; [2025-02-08 05:39:29,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-5: ~s21~0 := #t~ret13#1; [2025-02-08 05:39:29,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-6: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret13#1 && #t~ret13#1 <= 2147483647; [2025-02-08 05:39:29,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-7: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:39:29,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-8: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:39:29,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-9: #t~ret13#1 := plus_#res#1; [2025-02-08 05:39:29,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L71: [2025-02-08 05:39:29,669 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101-4: havoc #t~nondet27#1; [2025-02-08 05:39:29,669 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101-5: ~s12~0 := #t~ret26#1; [2025-02-08 05:39:29,669 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101-6: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647; [2025-02-08 05:39:29,669 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101-7: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:39:29,669 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101-8: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:39:29,669 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101-9: #t~ret26#1 := plus_#res#1; [2025-02-08 05:39:29,670 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L102: [2025-02-08 05:39:29,670 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101: havoc #t~nondet27#1; [2025-02-08 05:39:29,670 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101-1: assume #race~s12~0 == #t~nondet27#1; [2025-02-08 05:39:29,670 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101-1: assume !(#race~s12~0 == #t~nondet27#1); [2025-02-08 05:39:29,670 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101-2: havoc #t~ret26#1; [2025-02-08 05:39:29,670 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101-3: #race~s12~0 := #t~nondet27#1; [2025-02-08 05:39:29,736 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L116: havoc #t~nondet34#1; [2025-02-08 05:39:29,736 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L116-1: assume #race~s22~0 == #t~nondet34#1; [2025-02-08 05:39:29,736 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L116-1: assume !(#race~s22~0 == #t~nondet34#1); [2025-02-08 05:39:29,736 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L116-2: havoc #t~ret33#1; [2025-02-08 05:39:29,736 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L116-3: #race~s22~0 := #t~nondet34#1; [2025-02-08 05:39:29,736 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L116-4: havoc #t~nondet34#1; [2025-02-08 05:39:29,736 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L116-5: ~s22~0 := #t~ret33#1; [2025-02-08 05:39:29,736 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L116-6: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647; [2025-02-08 05:39:29,736 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L116-7: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:39:29,736 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L116-8: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:39:29,736 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L116-9: #t~ret33#1 := plus_#res#1; [2025-02-08 05:39:29,736 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L117: [2025-02-08 05:39:29,889 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:39:29,890 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:39:30,263 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L185 is not an error location. [2025-02-08 05:39:30,264 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L185 is not an error location. [2025-02-08 05:39:30,264 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L185 is not an error location. [2025-02-08 05:39:30,264 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L185 is not an error location. [2025-02-08 05:39:30,265 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:39:30,265 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:39:30,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:39:30 BoogieIcfgContainer [2025-02-08 05:39:30,266 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:39:30,267 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:39:30,267 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:39:30,270 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:39:30,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:39:28" (1/3) ... [2025-02-08 05:39:30,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c82e450 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:39:30, skipping insertion in model container [2025-02-08 05:39:30,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:28" (2/3) ... [2025-02-08 05:39:30,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c82e450 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:39:30, skipping insertion in model container [2025-02-08 05:39:30,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:39:30" (3/3) ... [2025-02-08 05:39:30,272 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-2.wvr.c [2025-02-08 05:39:30,282 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:39:30,283 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-parallel-sum-2.wvr.c that has 7 procedures, 453 locations, 1 initial locations, 5 loop locations, and 83 error locations. [2025-02-08 05:39:30,283 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:39:30,390 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2025-02-08 05:39:30,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 513 places, 517 transitions, 1100 flow [2025-02-08 05:39:30,552 INFO L124 PetriNetUnfolderBase]: 21/467 cut-off events. [2025-02-08 05:39:30,553 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:39:30,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 496 conditions, 467 events. 21/467 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 835 event pairs, 0 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 410. Up to 3 conditions per place. [2025-02-08 05:39:30,559 INFO L82 GeneralOperation]: Start removeDead. Operand has 513 places, 517 transitions, 1100 flow [2025-02-08 05:39:30,564 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 449 places, 450 transitions, 948 flow [2025-02-08 05:39:30,568 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:39:30,575 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;@7abbf0f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:39:30,575 INFO L334 AbstractCegarLoop]: Starting to check reachability of 139 error locations. [2025-02-08 05:39:30,580 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:39:30,580 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2025-02-08 05:39:30,580 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:39:30,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:30,581 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] [2025-02-08 05:39:30,581 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 135 more)] === [2025-02-08 05:39:30,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:30,585 INFO L85 PathProgramCache]: Analyzing trace with hash 439742442, now seen corresponding path program 1 times [2025-02-08 05:39:30,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:30,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228590134] [2025-02-08 05:39:30,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:30,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:30,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 05:39:30,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 05:39:30,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:30,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:30,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:30,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:30,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228590134] [2025-02-08 05:39:30,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228590134] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:30,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:30,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:30,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948568760] [2025-02-08 05:39:30,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:30,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:30,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:30,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:30,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:30,820 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 521 [2025-02-08 05:39:30,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 450 transitions, 948 flow. Second operand has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:30,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:30,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 521 [2025-02-08 05:39:30,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:31,442 INFO L124 PetriNetUnfolderBase]: 815/2194 cut-off events. [2025-02-08 05:39:31,442 INFO L125 PetriNetUnfolderBase]: For 683/683 co-relation queries the response was YES. [2025-02-08 05:39:31,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4080 conditions, 2194 events. 815/2194 cut-off events. For 683/683 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 13192 event pairs, 653 based on Foata normal form. 340/2203 useless extension candidates. Maximal degree in co-relation 3663. Up to 1194 conditions per place. [2025-02-08 05:39:31,470 INFO L140 encePairwiseOnDemand]: 462/521 looper letters, 31 selfloop transitions, 2 changer transitions 4/393 dead transitions. [2025-02-08 05:39:31,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 393 transitions, 900 flow [2025-02-08 05:39:31,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:31,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:31,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1317 transitions. [2025-02-08 05:39:31,497 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8426103646833013 [2025-02-08 05:39:31,498 INFO L175 Difference]: Start difference. First operand has 449 places, 450 transitions, 948 flow. Second operand 3 states and 1317 transitions. [2025-02-08 05:39:31,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 393 transitions, 900 flow [2025-02-08 05:39:31,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 392 places, 393 transitions, 868 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-02-08 05:39:31,521 INFO L231 Difference]: Finished difference. Result has 392 places, 389 transitions, 798 flow [2025-02-08 05:39:31,523 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=521, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=390, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=798, PETRI_PLACES=392, PETRI_TRANSITIONS=389} [2025-02-08 05:39:31,526 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -57 predicate places. [2025-02-08 05:39:31,526 INFO L471 AbstractCegarLoop]: Abstraction has has 392 places, 389 transitions, 798 flow [2025-02-08 05:39:31,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:31,527 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:31,527 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:39:31,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:39:31,528 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 135 more)] === [2025-02-08 05:39:31,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:31,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1457513279, now seen corresponding path program 1 times [2025-02-08 05:39:31,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:31,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748060747] [2025-02-08 05:39:31,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:31,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:31,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 05:39:31,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 05:39:31,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:31,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:31,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:31,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:31,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748060747] [2025-02-08 05:39:31,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748060747] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:31,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:31,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:31,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879829990] [2025-02-08 05:39:31,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:31,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:31,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:31,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:31,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:31,618 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 521 [2025-02-08 05:39:31,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 389 transitions, 798 flow. Second operand has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:31,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:31,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 521 [2025-02-08 05:39:31,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:32,024 INFO L124 PetriNetUnfolderBase]: 815/2107 cut-off events. [2025-02-08 05:39:32,024 INFO L125 PetriNetUnfolderBase]: For 166/166 co-relation queries the response was YES. [2025-02-08 05:39:32,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3482 conditions, 2107 events. 815/2107 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 12330 event pairs, 653 based on Foata normal form. 0/1805 useless extension candidates. Maximal degree in co-relation 3444. Up to 1194 conditions per place. [2025-02-08 05:39:32,032 INFO L140 encePairwiseOnDemand]: 518/521 looper letters, 31 selfloop transitions, 2 changer transitions 0/388 dead transitions. [2025-02-08 05:39:32,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 388 transitions, 862 flow [2025-02-08 05:39:32,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:32,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:32,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1261 transitions. [2025-02-08 05:39:32,035 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8067818298144593 [2025-02-08 05:39:32,035 INFO L175 Difference]: Start difference. First operand has 392 places, 389 transitions, 798 flow. Second operand 3 states and 1261 transitions. [2025-02-08 05:39:32,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 388 transitions, 862 flow [2025-02-08 05:39:32,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 388 transitions, 858 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:32,039 INFO L231 Difference]: Finished difference. Result has 387 places, 388 transitions, 796 flow [2025-02-08 05:39:32,040 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=521, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=796, PETRI_PLACES=387, PETRI_TRANSITIONS=388} [2025-02-08 05:39:32,040 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -62 predicate places. [2025-02-08 05:39:32,040 INFO L471 AbstractCegarLoop]: Abstraction has has 387 places, 388 transitions, 796 flow [2025-02-08 05:39:32,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:32,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:32,041 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:39:32,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:39:32,042 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 135 more)] === [2025-02-08 05:39:32,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:32,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1939554946, now seen corresponding path program 1 times [2025-02-08 05:39:32,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:32,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766301679] [2025-02-08 05:39:32,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:32,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:32,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 05:39:32,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 05:39:32,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:32,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:32,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:32,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:32,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766301679] [2025-02-08 05:39:32,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766301679] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:32,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:32,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:32,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869639059] [2025-02-08 05:39:32,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:32,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:32,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:32,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:32,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:32,103 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 521 [2025-02-08 05:39:32,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 388 transitions, 796 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:32,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:32,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 521 [2025-02-08 05:39:32,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:32,404 INFO L124 PetriNetUnfolderBase]: 785/1936 cut-off events. [2025-02-08 05:39:32,404 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-02-08 05:39:32,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3257 conditions, 1936 events. 785/1936 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 10852 event pairs, 627 based on Foata normal form. 0/1664 useless extension candidates. Maximal degree in co-relation 3211. Up to 1144 conditions per place. [2025-02-08 05:39:32,411 INFO L140 encePairwiseOnDemand]: 518/521 looper letters, 29 selfloop transitions, 2 changer transitions 0/387 dead transitions. [2025-02-08 05:39:32,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 387 transitions, 856 flow [2025-02-08 05:39:32,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:32,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:32,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1268 transitions. [2025-02-08 05:39:32,414 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8112603966730646 [2025-02-08 05:39:32,414 INFO L175 Difference]: Start difference. First operand has 387 places, 388 transitions, 796 flow. Second operand 3 states and 1268 transitions. [2025-02-08 05:39:32,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 387 transitions, 856 flow [2025-02-08 05:39:32,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 387 transitions, 852 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:32,418 INFO L231 Difference]: Finished difference. Result has 386 places, 387 transitions, 794 flow [2025-02-08 05:39:32,419 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=521, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=384, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=794, PETRI_PLACES=386, PETRI_TRANSITIONS=387} [2025-02-08 05:39:32,419 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -63 predicate places. [2025-02-08 05:39:32,419 INFO L471 AbstractCegarLoop]: Abstraction has has 386 places, 387 transitions, 794 flow [2025-02-08 05:39:32,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:32,420 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:32,420 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:39:32,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:39:32,420 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 135 more)] === [2025-02-08 05:39:32,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:32,421 INFO L85 PathProgramCache]: Analyzing trace with hash 537675448, now seen corresponding path program 1 times [2025-02-08 05:39:32,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:32,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948701921] [2025-02-08 05:39:32,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:32,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:32,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 05:39:32,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 05:39:32,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:32,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:32,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:32,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:32,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948701921] [2025-02-08 05:39:32,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948701921] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:32,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:32,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:32,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806644872] [2025-02-08 05:39:32,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:32,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:32,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:32,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:32,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:32,462 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 521 [2025-02-08 05:39:32,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 387 transitions, 794 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:32,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:32,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 521 [2025-02-08 05:39:32,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:32,725 INFO L124 PetriNetUnfolderBase]: 785/1935 cut-off events. [2025-02-08 05:39:32,725 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-02-08 05:39:32,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3256 conditions, 1935 events. 785/1935 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 10808 event pairs, 627 based on Foata normal form. 0/1664 useless extension candidates. Maximal degree in co-relation 3202. Up to 1144 conditions per place. [2025-02-08 05:39:32,733 INFO L140 encePairwiseOnDemand]: 518/521 looper letters, 29 selfloop transitions, 2 changer transitions 0/386 dead transitions. [2025-02-08 05:39:32,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 386 transitions, 854 flow [2025-02-08 05:39:32,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:32,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:32,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1268 transitions. [2025-02-08 05:39:32,735 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8112603966730646 [2025-02-08 05:39:32,736 INFO L175 Difference]: Start difference. First operand has 386 places, 387 transitions, 794 flow. Second operand 3 states and 1268 transitions. [2025-02-08 05:39:32,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 386 transitions, 854 flow [2025-02-08 05:39:32,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 386 transitions, 850 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:32,739 INFO L231 Difference]: Finished difference. Result has 385 places, 386 transitions, 792 flow [2025-02-08 05:39:32,740 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=521, PETRI_DIFFERENCE_MINUEND_FLOW=788, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=792, PETRI_PLACES=385, PETRI_TRANSITIONS=386} [2025-02-08 05:39:32,740 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -64 predicate places. [2025-02-08 05:39:32,741 INFO L471 AbstractCegarLoop]: Abstraction has has 385 places, 386 transitions, 792 flow [2025-02-08 05:39:32,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:32,741 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:32,741 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:39:32,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:39:32,742 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 135 more)] === [2025-02-08 05:39:32,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:32,742 INFO L85 PathProgramCache]: Analyzing trace with hash -712498061, now seen corresponding path program 1 times [2025-02-08 05:39:32,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:32,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524511111] [2025-02-08 05:39:32,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:32,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:32,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 05:39:32,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 05:39:32,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:32,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:32,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:32,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:32,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524511111] [2025-02-08 05:39:32,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524511111] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:32,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:32,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:32,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40841023] [2025-02-08 05:39:32,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:32,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:32,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:32,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:32,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:32,785 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 521 [2025-02-08 05:39:32,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 386 transitions, 792 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:32,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:32,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 521 [2025-02-08 05:39:32,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:33,087 INFO L124 PetriNetUnfolderBase]: 785/1934 cut-off events. [2025-02-08 05:39:33,088 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-02-08 05:39:33,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3255 conditions, 1934 events. 785/1934 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 10824 event pairs, 627 based on Foata normal form. 0/1664 useless extension candidates. Maximal degree in co-relation 3193. Up to 1144 conditions per place. [2025-02-08 05:39:33,097 INFO L140 encePairwiseOnDemand]: 518/521 looper letters, 29 selfloop transitions, 2 changer transitions 0/385 dead transitions. [2025-02-08 05:39:33,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 385 transitions, 852 flow [2025-02-08 05:39:33,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:33,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:33,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1268 transitions. [2025-02-08 05:39:33,100 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8112603966730646 [2025-02-08 05:39:33,100 INFO L175 Difference]: Start difference. First operand has 385 places, 386 transitions, 792 flow. Second operand 3 states and 1268 transitions. [2025-02-08 05:39:33,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 385 transitions, 852 flow [2025-02-08 05:39:33,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 385 transitions, 848 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:33,105 INFO L231 Difference]: Finished difference. Result has 384 places, 385 transitions, 790 flow [2025-02-08 05:39:33,105 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=521, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=790, PETRI_PLACES=384, PETRI_TRANSITIONS=385} [2025-02-08 05:39:33,106 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -65 predicate places. [2025-02-08 05:39:33,106 INFO L471 AbstractCegarLoop]: Abstraction has has 384 places, 385 transitions, 790 flow [2025-02-08 05:39:33,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:33,108 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:33,108 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:39:33,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:39:33,108 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 135 more)] === [2025-02-08 05:39:33,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:33,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1159052795, now seen corresponding path program 1 times [2025-02-08 05:39:33,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:33,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193787869] [2025-02-08 05:39:33,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:33,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:33,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-08 05:39:33,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-08 05:39:33,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:33,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:33,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:33,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:33,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193787869] [2025-02-08 05:39:33,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193787869] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:33,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:33,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:33,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609944686] [2025-02-08 05:39:33,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:33,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:33,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:33,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:33,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:33,194 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 521 [2025-02-08 05:39:33,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 385 transitions, 790 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:33,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:33,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 521 [2025-02-08 05:39:33,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:33,820 INFO L124 PetriNetUnfolderBase]: 785/1933 cut-off events. [2025-02-08 05:39:33,820 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-02-08 05:39:33,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3254 conditions, 1933 events. 785/1933 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 10840 event pairs, 627 based on Foata normal form. 0/1664 useless extension candidates. Maximal degree in co-relation 3184. Up to 1144 conditions per place. [2025-02-08 05:39:33,842 INFO L140 encePairwiseOnDemand]: 518/521 looper letters, 29 selfloop transitions, 2 changer transitions 0/384 dead transitions. [2025-02-08 05:39:33,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 384 transitions, 850 flow [2025-02-08 05:39:33,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:33,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:33,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1268 transitions. [2025-02-08 05:39:33,849 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8112603966730646 [2025-02-08 05:39:33,849 INFO L175 Difference]: Start difference. First operand has 384 places, 385 transitions, 790 flow. Second operand 3 states and 1268 transitions. [2025-02-08 05:39:33,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 384 transitions, 850 flow [2025-02-08 05:39:33,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 384 transitions, 846 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:33,863 INFO L231 Difference]: Finished difference. Result has 383 places, 384 transitions, 788 flow [2025-02-08 05:39:33,863 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=521, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=788, PETRI_PLACES=383, PETRI_TRANSITIONS=384} [2025-02-08 05:39:33,864 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -66 predicate places. [2025-02-08 05:39:33,864 INFO L471 AbstractCegarLoop]: Abstraction has has 383 places, 384 transitions, 788 flow [2025-02-08 05:39:33,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:33,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:33,869 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:33,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:39:33,869 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 135 more)] === [2025-02-08 05:39:33,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:33,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1156099784, now seen corresponding path program 1 times [2025-02-08 05:39:33,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:33,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721376303] [2025-02-08 05:39:33,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:33,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:33,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-08 05:39:33,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-08 05:39:33,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:33,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:33,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:33,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:33,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721376303] [2025-02-08 05:39:33,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721376303] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:33,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:33,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:33,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076832557] [2025-02-08 05:39:33,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:33,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:33,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:33,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:33,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:33,981 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 406 out of 521 [2025-02-08 05:39:33,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 384 transitions, 788 flow. Second operand has 3 states, 3 states have (on average 407.3333333333333) internal successors, (1222), 3 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:33,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:33,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 406 of 521 [2025-02-08 05:39:33,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:34,227 INFO L124 PetriNetUnfolderBase]: 785/1932 cut-off events. [2025-02-08 05:39:34,227 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-02-08 05:39:34,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3259 conditions, 1932 events. 785/1932 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 10808 event pairs, 627 based on Foata normal form. 0/1664 useless extension candidates. Maximal degree in co-relation 3181. Up to 1150 conditions per place. [2025-02-08 05:39:34,237 INFO L140 encePairwiseOnDemand]: 518/521 looper letters, 35 selfloop transitions, 2 changer transitions 0/383 dead transitions. [2025-02-08 05:39:34,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 383 transitions, 860 flow [2025-02-08 05:39:34,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:34,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:34,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1256 transitions. [2025-02-08 05:39:34,240 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8035828534868842 [2025-02-08 05:39:34,240 INFO L175 Difference]: Start difference. First operand has 383 places, 384 transitions, 788 flow. Second operand 3 states and 1256 transitions. [2025-02-08 05:39:34,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 383 transitions, 860 flow [2025-02-08 05:39:34,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 383 transitions, 856 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:34,244 INFO L231 Difference]: Finished difference. Result has 382 places, 383 transitions, 786 flow [2025-02-08 05:39:34,245 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=521, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=786, PETRI_PLACES=382, PETRI_TRANSITIONS=383} [2025-02-08 05:39:34,246 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -67 predicate places. [2025-02-08 05:39:34,246 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 383 transitions, 786 flow [2025-02-08 05:39:34,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 407.3333333333333) internal successors, (1222), 3 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:34,247 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:34,248 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:39:34,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:39:34,248 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 135 more)] === [2025-02-08 05:39:34,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:34,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1557932626, now seen corresponding path program 1 times [2025-02-08 05:39:34,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:34,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136692831] [2025-02-08 05:39:34,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:34,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:34,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-08 05:39:34,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-08 05:39:34,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:34,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:34,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:34,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:34,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136692831] [2025-02-08 05:39:34,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136692831] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:34,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:34,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:34,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013802166] [2025-02-08 05:39:34,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:34,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:34,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:34,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:34,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:34,315 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 521 [2025-02-08 05:39:34,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 383 transitions, 786 flow. Second operand has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:34,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:34,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 521 [2025-02-08 05:39:34,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:34,512 INFO L124 PetriNetUnfolderBase]: 785/1931 cut-off events. [2025-02-08 05:39:34,512 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-02-08 05:39:34,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3253 conditions, 1931 events. 785/1931 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 10818 event pairs, 627 based on Foata normal form. 0/1664 useless extension candidates. Maximal degree in co-relation 3167. Up to 1145 conditions per place. [2025-02-08 05:39:34,522 INFO L140 encePairwiseOnDemand]: 518/521 looper letters, 30 selfloop transitions, 2 changer transitions 0/382 dead transitions. [2025-02-08 05:39:34,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 382 transitions, 848 flow [2025-02-08 05:39:34,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:34,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:34,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1266 transitions. [2025-02-08 05:39:34,525 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8099808061420346 [2025-02-08 05:39:34,525 INFO L175 Difference]: Start difference. First operand has 382 places, 383 transitions, 786 flow. Second operand 3 states and 1266 transitions. [2025-02-08 05:39:34,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 382 transitions, 848 flow [2025-02-08 05:39:34,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 382 transitions, 844 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:34,529 INFO L231 Difference]: Finished difference. Result has 381 places, 382 transitions, 784 flow [2025-02-08 05:39:34,530 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=521, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=784, PETRI_PLACES=381, PETRI_TRANSITIONS=382} [2025-02-08 05:39:34,531 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -68 predicate places. [2025-02-08 05:39:34,531 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 382 transitions, 784 flow [2025-02-08 05:39:34,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:34,532 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:34,532 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:39:34,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:39:34,533 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 135 more)] === [2025-02-08 05:39:34,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:34,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1972420008, now seen corresponding path program 1 times [2025-02-08 05:39:34,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:34,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736752545] [2025-02-08 05:39:34,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:34,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:34,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 05:39:34,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 05:39:34,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:34,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:34,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:34,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:34,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736752545] [2025-02-08 05:39:34,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736752545] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:34,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:34,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:34,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544715760] [2025-02-08 05:39:34,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:34,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:34,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:34,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:34,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:34,589 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 521 [2025-02-08 05:39:34,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 382 transitions, 784 flow. Second operand has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:34,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:34,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 521 [2025-02-08 05:39:34,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:34,866 INFO L124 PetriNetUnfolderBase]: 785/1930 cut-off events. [2025-02-08 05:39:34,866 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-02-08 05:39:34,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3252 conditions, 1930 events. 785/1930 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 10758 event pairs, 627 based on Foata normal form. 0/1664 useless extension candidates. Maximal degree in co-relation 3158. Up to 1145 conditions per place. [2025-02-08 05:39:34,873 INFO L140 encePairwiseOnDemand]: 518/521 looper letters, 30 selfloop transitions, 2 changer transitions 0/381 dead transitions. [2025-02-08 05:39:34,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 381 transitions, 846 flow [2025-02-08 05:39:34,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:34,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:34,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1266 transitions. [2025-02-08 05:39:34,875 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8099808061420346 [2025-02-08 05:39:34,875 INFO L175 Difference]: Start difference. First operand has 381 places, 382 transitions, 784 flow. Second operand 3 states and 1266 transitions. [2025-02-08 05:39:34,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 381 transitions, 846 flow [2025-02-08 05:39:34,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 381 transitions, 842 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:34,879 INFO L231 Difference]: Finished difference. Result has 380 places, 381 transitions, 782 flow [2025-02-08 05:39:34,880 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=521, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=782, PETRI_PLACES=380, PETRI_TRANSITIONS=381} [2025-02-08 05:39:34,880 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -69 predicate places. [2025-02-08 05:39:34,881 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 381 transitions, 782 flow [2025-02-08 05:39:34,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:34,882 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:34,882 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:39:34,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:39:34,882 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 135 more)] === [2025-02-08 05:39:34,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:34,882 INFO L85 PathProgramCache]: Analyzing trace with hash -60038901, now seen corresponding path program 1 times [2025-02-08 05:39:34,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:34,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297088580] [2025-02-08 05:39:34,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:34,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:34,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-08 05:39:34,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-08 05:39:34,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:34,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:34,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:34,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:34,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297088580] [2025-02-08 05:39:34,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297088580] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:34,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:34,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:34,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577863901] [2025-02-08 05:39:34,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:34,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:34,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:34,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:34,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:34,925 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 521 [2025-02-08 05:39:34,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 381 transitions, 782 flow. Second operand has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:34,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:34,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 521 [2025-02-08 05:39:34,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:35,121 INFO L124 PetriNetUnfolderBase]: 785/1929 cut-off events. [2025-02-08 05:39:35,122 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-02-08 05:39:35,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3251 conditions, 1929 events. 785/1929 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 10830 event pairs, 627 based on Foata normal form. 0/1664 useless extension candidates. Maximal degree in co-relation 3149. Up to 1145 conditions per place. [2025-02-08 05:39:35,130 INFO L140 encePairwiseOnDemand]: 518/521 looper letters, 30 selfloop transitions, 2 changer transitions 0/380 dead transitions. [2025-02-08 05:39:35,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 380 transitions, 844 flow [2025-02-08 05:39:35,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:35,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:35,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1266 transitions. [2025-02-08 05:39:35,133 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8099808061420346 [2025-02-08 05:39:35,133 INFO L175 Difference]: Start difference. First operand has 380 places, 381 transitions, 782 flow. Second operand 3 states and 1266 transitions. [2025-02-08 05:39:35,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 380 transitions, 844 flow [2025-02-08 05:39:35,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 380 transitions, 840 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:35,137 INFO L231 Difference]: Finished difference. Result has 379 places, 380 transitions, 780 flow [2025-02-08 05:39:35,138 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=521, PETRI_DIFFERENCE_MINUEND_FLOW=776, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=780, PETRI_PLACES=379, PETRI_TRANSITIONS=380} [2025-02-08 05:39:35,138 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -70 predicate places. [2025-02-08 05:39:35,138 INFO L471 AbstractCegarLoop]: Abstraction has has 379 places, 380 transitions, 780 flow [2025-02-08 05:39:35,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:35,139 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:35,139 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:39:35,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:39:35,139 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 135 more)] === [2025-02-08 05:39:35,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:35,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1975503157, now seen corresponding path program 1 times [2025-02-08 05:39:35,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:35,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974581313] [2025-02-08 05:39:35,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:35,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:35,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-08 05:39:35,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-08 05:39:35,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:35,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:35,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:35,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:35,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974581313] [2025-02-08 05:39:35,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974581313] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:35,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:35,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:35,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035124827] [2025-02-08 05:39:35,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:35,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:35,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:35,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:35,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:35,179 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 521 [2025-02-08 05:39:35,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 380 transitions, 780 flow. Second operand has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:35,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:35,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 521 [2025-02-08 05:39:35,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:35,378 INFO L124 PetriNetUnfolderBase]: 785/1928 cut-off events. [2025-02-08 05:39:35,378 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-02-08 05:39:35,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3250 conditions, 1928 events. 785/1928 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 10812 event pairs, 627 based on Foata normal form. 0/1664 useless extension candidates. Maximal degree in co-relation 3140. Up to 1145 conditions per place. [2025-02-08 05:39:35,386 INFO L140 encePairwiseOnDemand]: 518/521 looper letters, 30 selfloop transitions, 2 changer transitions 0/379 dead transitions. [2025-02-08 05:39:35,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 379 transitions, 842 flow [2025-02-08 05:39:35,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:35,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:35,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1266 transitions. [2025-02-08 05:39:35,389 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8099808061420346 [2025-02-08 05:39:35,389 INFO L175 Difference]: Start difference. First operand has 379 places, 380 transitions, 780 flow. Second operand 3 states and 1266 transitions. [2025-02-08 05:39:35,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 379 transitions, 842 flow [2025-02-08 05:39:35,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 379 transitions, 838 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:35,393 INFO L231 Difference]: Finished difference. Result has 378 places, 379 transitions, 778 flow [2025-02-08 05:39:35,393 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=521, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=778, PETRI_PLACES=378, PETRI_TRANSITIONS=379} [2025-02-08 05:39:35,394 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -71 predicate places. [2025-02-08 05:39:35,394 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 379 transitions, 778 flow [2025-02-08 05:39:35,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:35,395 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:35,395 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:39:35,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:39:35,395 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 135 more)] === [2025-02-08 05:39:35,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:35,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1062192545, now seen corresponding path program 1 times [2025-02-08 05:39:35,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:35,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583732191] [2025-02-08 05:39:35,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:35,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:35,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-08 05:39:35,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-08 05:39:35,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:35,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:35,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:35,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:35,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583732191] [2025-02-08 05:39:35,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583732191] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:35,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:35,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:35,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114132104] [2025-02-08 05:39:35,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:35,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:35,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:35,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:35,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:35,447 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 406 out of 521 [2025-02-08 05:39:35,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 379 transitions, 778 flow. Second operand has 3 states, 3 states have (on average 407.3333333333333) internal successors, (1222), 3 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:35,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:35,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 406 of 521 [2025-02-08 05:39:35,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:35,655 INFO L124 PetriNetUnfolderBase]: 846/2076 cut-off events. [2025-02-08 05:39:35,655 INFO L125 PetriNetUnfolderBase]: For 169/169 co-relation queries the response was YES. [2025-02-08 05:39:35,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3508 conditions, 2076 events. 846/2076 cut-off events. For 169/169 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 11974 event pairs, 680 based on Foata normal form. 0/1797 useless extension candidates. Maximal degree in co-relation 3390. Up to 1246 conditions per place. [2025-02-08 05:39:35,664 INFO L140 encePairwiseOnDemand]: 518/521 looper letters, 33 selfloop transitions, 2 changer transitions 0/378 dead transitions. [2025-02-08 05:39:35,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 378 transitions, 846 flow [2025-02-08 05:39:35,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:35,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:35,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1254 transitions. [2025-02-08 05:39:35,666 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8023032629558541 [2025-02-08 05:39:35,666 INFO L175 Difference]: Start difference. First operand has 378 places, 379 transitions, 778 flow. Second operand 3 states and 1254 transitions. [2025-02-08 05:39:35,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 378 transitions, 846 flow [2025-02-08 05:39:35,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 378 transitions, 842 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:35,670 INFO L231 Difference]: Finished difference. Result has 377 places, 378 transitions, 776 flow [2025-02-08 05:39:35,671 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=521, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=776, PETRI_PLACES=377, PETRI_TRANSITIONS=378} [2025-02-08 05:39:35,671 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -72 predicate places. [2025-02-08 05:39:35,671 INFO L471 AbstractCegarLoop]: Abstraction has has 377 places, 378 transitions, 776 flow [2025-02-08 05:39:35,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 407.3333333333333) internal successors, (1222), 3 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:35,672 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:35,672 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] [2025-02-08 05:39:35,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:39:35,672 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 135 more)] === [2025-02-08 05:39:35,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:35,673 INFO L85 PathProgramCache]: Analyzing trace with hash -483283741, now seen corresponding path program 1 times [2025-02-08 05:39:35,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:35,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343299397] [2025-02-08 05:39:35,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:35,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:35,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-08 05:39:35,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-08 05:39:35,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:35,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:35,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:35,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:35,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343299397] [2025-02-08 05:39:35,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343299397] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:35,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:35,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:35,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428704723] [2025-02-08 05:39:35,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:35,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:35,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:35,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:35,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:35,726 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 521 [2025-02-08 05:39:35,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 378 transitions, 776 flow. Second operand has 3 states, 3 states have (on average 401.0) internal successors, (1203), 3 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:35,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:35,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 521 [2025-02-08 05:39:35,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:35,957 INFO L124 PetriNetUnfolderBase]: 909/2381 cut-off events. [2025-02-08 05:39:35,957 INFO L125 PetriNetUnfolderBase]: For 181/181 co-relation queries the response was YES. [2025-02-08 05:39:35,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3924 conditions, 2381 events. 909/2381 cut-off events. For 181/181 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 14611 event pairs, 735 based on Foata normal form. 0/2081 useless extension candidates. Maximal degree in co-relation 3798. Up to 1348 conditions per place. [2025-02-08 05:39:35,966 INFO L140 encePairwiseOnDemand]: 516/521 looper letters, 34 selfloop transitions, 1 changer transitions 0/374 dead transitions. [2025-02-08 05:39:35,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 374 transitions, 838 flow [2025-02-08 05:39:35,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:35,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:35,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1239 transitions. [2025-02-08 05:39:35,969 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7927063339731286 [2025-02-08 05:39:35,969 INFO L175 Difference]: Start difference. First operand has 377 places, 378 transitions, 776 flow. Second operand 3 states and 1239 transitions. [2025-02-08 05:39:35,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 374 transitions, 838 flow [2025-02-08 05:39:35,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 374 transitions, 834 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:35,973 INFO L231 Difference]: Finished difference. Result has 373 places, 374 transitions, 766 flow [2025-02-08 05:39:35,974 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=521, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=766, PETRI_PLACES=373, PETRI_TRANSITIONS=374} [2025-02-08 05:39:35,974 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -76 predicate places. [2025-02-08 05:39:35,974 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 374 transitions, 766 flow [2025-02-08 05:39:35,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.0) internal successors, (1203), 3 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:35,975 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:35,975 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] [2025-02-08 05:39:35,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:39:35,975 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 135 more)] === [2025-02-08 05:39:35,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:35,976 INFO L85 PathProgramCache]: Analyzing trace with hash -372490569, now seen corresponding path program 1 times [2025-02-08 05:39:35,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:35,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059219255] [2025-02-08 05:39:35,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:35,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:35,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-08 05:39:35,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-08 05:39:35,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:35,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:36,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:36,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:36,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059219255] [2025-02-08 05:39:36,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059219255] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:36,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:36,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:36,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867949199] [2025-02-08 05:39:36,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:36,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:36,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:36,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:36,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:36,032 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 521 [2025-02-08 05:39:36,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 374 transitions, 766 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:36,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:36,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 521 [2025-02-08 05:39:36,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:36,322 INFO L124 PetriNetUnfolderBase]: 785/1915 cut-off events. [2025-02-08 05:39:36,322 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-02-08 05:39:36,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3235 conditions, 1915 events. 785/1915 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 10787 event pairs, 627 based on Foata normal form. 0/1664 useless extension candidates. Maximal degree in co-relation 3109. Up to 1144 conditions per place. [2025-02-08 05:39:36,331 INFO L140 encePairwiseOnDemand]: 518/521 looper letters, 29 selfloop transitions, 2 changer transitions 0/373 dead transitions. [2025-02-08 05:39:36,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 373 transitions, 826 flow [2025-02-08 05:39:36,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:36,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:36,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1268 transitions. [2025-02-08 05:39:36,334 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8112603966730646 [2025-02-08 05:39:36,334 INFO L175 Difference]: Start difference. First operand has 373 places, 374 transitions, 766 flow. Second operand 3 states and 1268 transitions. [2025-02-08 05:39:36,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 373 transitions, 826 flow [2025-02-08 05:39:36,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 373 transitions, 825 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:36,339 INFO L231 Difference]: Finished difference. Result has 373 places, 373 transitions, 767 flow [2025-02-08 05:39:36,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=521, PETRI_DIFFERENCE_MINUEND_FLOW=763, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=767, PETRI_PLACES=373, PETRI_TRANSITIONS=373} [2025-02-08 05:39:36,339 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -76 predicate places. [2025-02-08 05:39:36,340 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 373 transitions, 767 flow [2025-02-08 05:39:36,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:36,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:36,340 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] [2025-02-08 05:39:36,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:39:36,341 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 135 more)] === [2025-02-08 05:39:36,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:36,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1034765556, now seen corresponding path program 1 times [2025-02-08 05:39:36,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:36,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150523188] [2025-02-08 05:39:36,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:36,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:36,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-08 05:39:36,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-08 05:39:36,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:36,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:36,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:36,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:36,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150523188] [2025-02-08 05:39:36,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150523188] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:36,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:36,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:39:36,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534004544] [2025-02-08 05:39:36,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:36,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:39:36,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:36,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:39:36,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:39:36,901 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 405 out of 521 [2025-02-08 05:39:36,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 373 transitions, 767 flow. Second operand has 6 states, 6 states have (on average 406.5) internal successors, (2439), 6 states have internal predecessors, (2439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:36,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:36,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 405 of 521 [2025-02-08 05:39:36,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:37,104 INFO L124 PetriNetUnfolderBase]: 785/1914 cut-off events. [2025-02-08 05:39:37,104 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-02-08 05:39:37,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3244 conditions, 1914 events. 785/1914 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 10675 event pairs, 627 based on Foata normal form. 0/1664 useless extension candidates. Maximal degree in co-relation 3119. Up to 1149 conditions per place. [2025-02-08 05:39:37,112 INFO L140 encePairwiseOnDemand]: 515/521 looper letters, 34 selfloop transitions, 5 changer transitions 0/372 dead transitions. [2025-02-08 05:39:37,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 372 transitions, 843 flow [2025-02-08 05:39:37,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:39:37,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:39:37,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2470 transitions. [2025-02-08 05:39:37,116 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7901471529110684 [2025-02-08 05:39:37,116 INFO L175 Difference]: Start difference. First operand has 373 places, 373 transitions, 767 flow. Second operand 6 states and 2470 transitions. [2025-02-08 05:39:37,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 372 transitions, 843 flow [2025-02-08 05:39:37,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 372 transitions, 839 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:37,120 INFO L231 Difference]: Finished difference. Result has 375 places, 372 transitions, 771 flow [2025-02-08 05:39:37,120 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=521, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=771, PETRI_PLACES=375, PETRI_TRANSITIONS=372} [2025-02-08 05:39:37,121 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -74 predicate places. [2025-02-08 05:39:37,121 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 372 transitions, 771 flow [2025-02-08 05:39:37,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 406.5) internal successors, (2439), 6 states have internal predecessors, (2439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:37,122 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:37,122 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:37,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:39:37,122 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 135 more)] === [2025-02-08 05:39:37,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:37,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1710556848, now seen corresponding path program 1 times [2025-02-08 05:39:37,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:37,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024774755] [2025-02-08 05:39:37,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:37,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:37,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-08 05:39:37,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-08 05:39:37,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:37,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:37,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:37,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:37,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024774755] [2025-02-08 05:39:37,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024774755] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:37,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:37,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:37,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219164133] [2025-02-08 05:39:37,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:37,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:37,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:37,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:37,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:37,179 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 521 [2025-02-08 05:39:37,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 372 transitions, 771 flow. Second operand has 3 states, 3 states have (on average 401.0) internal successors, (1203), 3 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:37,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:37,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 521 [2025-02-08 05:39:37,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:37,443 INFO L124 PetriNetUnfolderBase]: 785/1908 cut-off events. [2025-02-08 05:39:37,443 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-02-08 05:39:37,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3241 conditions, 1908 events. 785/1908 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 10772 event pairs, 627 based on Foata normal form. 0/1664 useless extension candidates. Maximal degree in co-relation 3223. Up to 1152 conditions per place. [2025-02-08 05:39:37,450 INFO L140 encePairwiseOnDemand]: 514/521 looper letters, 38 selfloop transitions, 1 changer transitions 0/366 dead transitions. [2025-02-08 05:39:37,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 366 transitions, 837 flow [2025-02-08 05:39:37,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:37,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:37,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1245 transitions. [2025-02-08 05:39:37,452 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7965451055662188 [2025-02-08 05:39:37,452 INFO L175 Difference]: Start difference. First operand has 375 places, 372 transitions, 771 flow. Second operand 3 states and 1245 transitions. [2025-02-08 05:39:37,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 366 transitions, 837 flow [2025-02-08 05:39:37,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 366 transitions, 827 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:39:37,456 INFO L231 Difference]: Finished difference. Result has 366 places, 366 transitions, 751 flow [2025-02-08 05:39:37,456 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=521, PETRI_DIFFERENCE_MINUEND_FLOW=749, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=751, PETRI_PLACES=366, PETRI_TRANSITIONS=366} [2025-02-08 05:39:37,456 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -83 predicate places. [2025-02-08 05:39:37,457 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 366 transitions, 751 flow [2025-02-08 05:39:37,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.0) internal successors, (1203), 3 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:37,457 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:37,457 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:39:37,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:39:37,458 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 135 more)] === [2025-02-08 05:39:37,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:37,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1127394829, now seen corresponding path program 1 times [2025-02-08 05:39:37,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:37,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041968485] [2025-02-08 05:39:37,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:37,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:37,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-08 05:39:37,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-08 05:39:37,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:37,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:37,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:37,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:37,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041968485] [2025-02-08 05:39:37,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041968485] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:37,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:37,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:37,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165515056] [2025-02-08 05:39:37,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:37,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:37,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:37,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:37,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:37,500 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 521 [2025-02-08 05:39:37,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 366 transitions, 751 flow. Second operand has 3 states, 3 states have (on average 416.0) internal successors, (1248), 3 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:37,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:37,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 521 [2025-02-08 05:39:37,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:37,688 INFO L124 PetriNetUnfolderBase]: 785/1907 cut-off events. [2025-02-08 05:39:37,688 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-02-08 05:39:37,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3226 conditions, 1907 events. 785/1907 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 10698 event pairs, 627 based on Foata normal form. 0/1664 useless extension candidates. Maximal degree in co-relation 3100. Up to 1142 conditions per place. [2025-02-08 05:39:37,698 INFO L140 encePairwiseOnDemand]: 519/521 looper letters, 28 selfloop transitions, 1 changer transitions 0/365 dead transitions. [2025-02-08 05:39:37,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 365 transitions, 807 flow [2025-02-08 05:39:37,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:37,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:37,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1275 transitions. [2025-02-08 05:39:37,700 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8157389635316699 [2025-02-08 05:39:37,700 INFO L175 Difference]: Start difference. First operand has 366 places, 366 transitions, 751 flow. Second operand 3 states and 1275 transitions. [2025-02-08 05:39:37,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 365 transitions, 807 flow [2025-02-08 05:39:37,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 365 transitions, 806 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:37,704 INFO L231 Difference]: Finished difference. Result has 366 places, 365 transitions, 750 flow [2025-02-08 05:39:37,704 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=521, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=750, PETRI_PLACES=366, PETRI_TRANSITIONS=365} [2025-02-08 05:39:37,704 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -83 predicate places. [2025-02-08 05:39:37,704 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 365 transitions, 750 flow [2025-02-08 05:39:37,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 416.0) internal successors, (1248), 3 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:37,705 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:37,705 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:37,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:39:37,705 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 135 more)] === [2025-02-08 05:39:37,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:37,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1976998860, now seen corresponding path program 1 times [2025-02-08 05:39:37,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:37,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049756032] [2025-02-08 05:39:37,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:37,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:37,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-08 05:39:37,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-08 05:39:37,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:37,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:37,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:37,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:37,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049756032] [2025-02-08 05:39:37,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049756032] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:37,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:37,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:37,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359206347] [2025-02-08 05:39:37,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:37,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:37,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:37,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:37,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:37,744 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 521 [2025-02-08 05:39:37,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 365 transitions, 750 flow. Second operand has 3 states, 3 states have (on average 416.6666666666667) internal successors, (1250), 3 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:37,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:37,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 521 [2025-02-08 05:39:37,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:38,104 INFO L124 PetriNetUnfolderBase]: 1455/3394 cut-off events. [2025-02-08 05:39:38,104 INFO L125 PetriNetUnfolderBase]: For 298/298 co-relation queries the response was YES. [2025-02-08 05:39:38,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5777 conditions, 3394 events. 1455/3394 cut-off events. For 298/298 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 22536 event pairs, 880 based on Foata normal form. 0/2940 useless extension candidates. Maximal degree in co-relation 5652. Up to 1237 conditions per place. [2025-02-08 05:39:38,121 INFO L140 encePairwiseOnDemand]: 517/521 looper letters, 50 selfloop transitions, 3 changer transitions 0/389 dead transitions. [2025-02-08 05:39:38,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 389 transitions, 919 flow [2025-02-08 05:39:38,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:38,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:38,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1302 transitions. [2025-02-08 05:39:38,124 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8330134357005758 [2025-02-08 05:39:38,124 INFO L175 Difference]: Start difference. First operand has 366 places, 365 transitions, 750 flow. Second operand 3 states and 1302 transitions. [2025-02-08 05:39:38,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 389 transitions, 919 flow [2025-02-08 05:39:38,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 389 transitions, 918 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:38,130 INFO L231 Difference]: Finished difference. Result has 367 places, 366 transitions, 764 flow [2025-02-08 05:39:38,130 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=521, PETRI_DIFFERENCE_MINUEND_FLOW=747, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=764, PETRI_PLACES=367, PETRI_TRANSITIONS=366} [2025-02-08 05:39:38,131 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -82 predicate places. [2025-02-08 05:39:38,131 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 366 transitions, 764 flow [2025-02-08 05:39:38,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 416.6666666666667) internal successors, (1250), 3 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:38,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:38,131 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:39:38,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:39:38,132 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 135 more)] === [2025-02-08 05:39:38,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:38,132 INFO L85 PathProgramCache]: Analyzing trace with hash -366728545, now seen corresponding path program 1 times [2025-02-08 05:39:38,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:38,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107781269] [2025-02-08 05:39:38,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:38,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:38,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-08 05:39:38,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-08 05:39:38,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:38,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:38,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:38,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:38,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107781269] [2025-02-08 05:39:38,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107781269] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:38,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:38,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:38,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619927340] [2025-02-08 05:39:38,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:38,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:38,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:38,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:38,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:38,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 521 [2025-02-08 05:39:38,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 366 transitions, 764 flow. Second operand has 3 states, 3 states have (on average 416.0) internal successors, (1248), 3 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:38,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:38,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 521 [2025-02-08 05:39:38,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:38,855 INFO L124 PetriNetUnfolderBase]: 2665/6143 cut-off events. [2025-02-08 05:39:38,855 INFO L125 PetriNetUnfolderBase]: For 715/715 co-relation queries the response was YES. [2025-02-08 05:39:38,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10994 conditions, 6143 events. 2665/6143 cut-off events. For 715/715 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 47182 event pairs, 1528 based on Foata normal form. 0/5318 useless extension candidates. Maximal degree in co-relation 10868. Up to 2247 conditions per place. [2025-02-08 05:39:38,894 INFO L140 encePairwiseOnDemand]: 517/521 looper letters, 54 selfloop transitions, 4 changer transitions 0/392 dead transitions. [2025-02-08 05:39:38,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 392 transitions, 957 flow [2025-02-08 05:39:38,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:38,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:38,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1300 transitions. [2025-02-08 05:39:38,897 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8317338451695457 [2025-02-08 05:39:38,897 INFO L175 Difference]: Start difference. First operand has 367 places, 366 transitions, 764 flow. Second operand 3 states and 1300 transitions. [2025-02-08 05:39:38,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 392 transitions, 957 flow [2025-02-08 05:39:38,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 392 transitions, 957 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:39:38,901 INFO L231 Difference]: Finished difference. Result has 369 places, 368 transitions, 791 flow [2025-02-08 05:39:38,902 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=521, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=791, PETRI_PLACES=369, PETRI_TRANSITIONS=368} [2025-02-08 05:39:38,902 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -80 predicate places. [2025-02-08 05:39:38,902 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 368 transitions, 791 flow [2025-02-08 05:39:38,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 416.0) internal successors, (1248), 3 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:38,903 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:38,903 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:38,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:39:38,903 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 135 more)] === [2025-02-08 05:39:38,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:38,904 INFO L85 PathProgramCache]: Analyzing trace with hash -2126911526, now seen corresponding path program 1 times [2025-02-08 05:39:38,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:38,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457852731] [2025-02-08 05:39:38,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:38,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:38,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-08 05:39:38,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-08 05:39:38,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:38,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:38,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:38,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:38,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457852731] [2025-02-08 05:39:38,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457852731] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:38,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:38,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:38,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271451812] [2025-02-08 05:39:38,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:38,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:38,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:38,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:38,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:38,970 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 521 [2025-02-08 05:39:38,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 368 transitions, 791 flow. Second operand has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:38,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:38,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 521 [2025-02-08 05:39:38,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:39,834 INFO L124 PetriNetUnfolderBase]: 3763/8471 cut-off events. [2025-02-08 05:39:39,835 INFO L125 PetriNetUnfolderBase]: For 1598/1598 co-relation queries the response was YES. [2025-02-08 05:39:39,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15968 conditions, 8471 events. 3763/8471 cut-off events. For 1598/1598 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 67772 event pairs, 758 based on Foata normal form. 0/7444 useless extension candidates. Maximal degree in co-relation 15841. Up to 4377 conditions per place. [2025-02-08 05:39:39,887 INFO L140 encePairwiseOnDemand]: 515/521 looper letters, 47 selfloop transitions, 4 changer transitions 12/393 dead transitions. [2025-02-08 05:39:39,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 393 transitions, 1011 flow [2025-02-08 05:39:39,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:39,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:39,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1282 transitions. [2025-02-08 05:39:39,889 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8202175303902751 [2025-02-08 05:39:39,889 INFO L175 Difference]: Start difference. First operand has 369 places, 368 transitions, 791 flow. Second operand 3 states and 1282 transitions. [2025-02-08 05:39:39,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 393 transitions, 1011 flow [2025-02-08 05:39:39,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 393 transitions, 1011 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:39:40,038 INFO L231 Difference]: Finished difference. Result has 370 places, 363 transitions, 789 flow [2025-02-08 05:39:40,038 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=521, PETRI_DIFFERENCE_MINUEND_FLOW=787, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=789, PETRI_PLACES=370, PETRI_TRANSITIONS=363} [2025-02-08 05:39:40,039 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -79 predicate places. [2025-02-08 05:39:40,039 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 363 transitions, 789 flow [2025-02-08 05:39:40,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:40,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:40,040 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:40,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 05:39:40,041 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 135 more)] === [2025-02-08 05:39:40,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:40,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1857138162, now seen corresponding path program 1 times [2025-02-08 05:39:40,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:40,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322292517] [2025-02-08 05:39:40,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:40,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:40,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-08 05:39:40,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-08 05:39:40,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:40,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:40,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:40,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:40,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322292517] [2025-02-08 05:39:40,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322292517] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:40,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:40,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:40,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342119224] [2025-02-08 05:39:40,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:40,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:40,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:40,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:40,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:40,092 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 521 [2025-02-08 05:39:40,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 363 transitions, 789 flow. Second operand has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:40,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:40,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 521 [2025-02-08 05:39:40,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:41,384 INFO L124 PetriNetUnfolderBase]: 2673/10195 cut-off events. [2025-02-08 05:39:41,384 INFO L125 PetriNetUnfolderBase]: For 1620/1620 co-relation queries the response was YES. [2025-02-08 05:39:41,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16393 conditions, 10195 events. 2673/10195 cut-off events. For 1620/1620 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 107216 event pairs, 1160 based on Foata normal form. 0/8896 useless extension candidates. Maximal degree in co-relation 16265. Up to 2393 conditions per place. [2025-02-08 05:39:41,433 INFO L140 encePairwiseOnDemand]: 517/521 looper letters, 41 selfloop transitions, 2 changer transitions 12/384 dead transitions. [2025-02-08 05:39:41,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 384 transitions, 966 flow [2025-02-08 05:39:41,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:41,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:41,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1277 transitions. [2025-02-08 05:39:41,438 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8170185540627 [2025-02-08 05:39:41,438 INFO L175 Difference]: Start difference. First operand has 370 places, 363 transitions, 789 flow. Second operand 3 states and 1277 transitions. [2025-02-08 05:39:41,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 384 transitions, 966 flow [2025-02-08 05:39:41,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 384 transitions, 966 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:39:41,443 INFO L231 Difference]: Finished difference. Result has 367 places, 356 transitions, 773 flow [2025-02-08 05:39:41,444 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=521, PETRI_DIFFERENCE_MINUEND_FLOW=785, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=773, PETRI_PLACES=367, PETRI_TRANSITIONS=356} [2025-02-08 05:39:41,444 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -82 predicate places. [2025-02-08 05:39:41,444 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 356 transitions, 773 flow [2025-02-08 05:39:41,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:41,445 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:41,445 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:41,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 05:39:41,445 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 135 more)] === [2025-02-08 05:39:41,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:41,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1916775978, now seen corresponding path program 1 times [2025-02-08 05:39:41,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:41,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608661655] [2025-02-08 05:39:41,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:41,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:41,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-02-08 05:39:41,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-02-08 05:39:41,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:41,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:41,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:41,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:41,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608661655] [2025-02-08 05:39:41,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608661655] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:41,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:41,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:41,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033215113] [2025-02-08 05:39:41,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:41,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:41,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:41,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:41,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:41,534 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 521 [2025-02-08 05:39:41,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 356 transitions, 773 flow. Second operand has 3 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:41,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:41,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 521 [2025-02-08 05:39:41,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:42,263 INFO L124 PetriNetUnfolderBase]: 895/6174 cut-off events. [2025-02-08 05:39:42,263 INFO L125 PetriNetUnfolderBase]: For 469/469 co-relation queries the response was YES. [2025-02-08 05:39:42,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8415 conditions, 6174 events. 895/6174 cut-off events. For 469/469 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 63767 event pairs, 402 based on Foata normal form. 0/5450 useless extension candidates. Maximal degree in co-relation 8286. Up to 1409 conditions per place. [2025-02-08 05:39:42,290 INFO L140 encePairwiseOnDemand]: 519/521 looper letters, 23 selfloop transitions, 1 changer transitions 0/355 dead transitions. [2025-02-08 05:39:42,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 355 transitions, 819 flow [2025-02-08 05:39:42,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:42,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:42,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1267 transitions. [2025-02-08 05:39:42,291 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8106206014075495 [2025-02-08 05:39:42,292 INFO L175 Difference]: Start difference. First operand has 367 places, 356 transitions, 773 flow. Second operand 3 states and 1267 transitions. [2025-02-08 05:39:42,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 355 transitions, 819 flow [2025-02-08 05:39:42,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 355 transitions, 819 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:39:42,295 INFO L231 Difference]: Finished difference. Result has 364 places, 355 transitions, 773 flow [2025-02-08 05:39:42,295 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=521, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=773, PETRI_PLACES=364, PETRI_TRANSITIONS=355} [2025-02-08 05:39:42,296 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -85 predicate places. [2025-02-08 05:39:42,296 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 355 transitions, 773 flow [2025-02-08 05:39:42,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:42,296 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:42,297 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:42,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 05:39:42,297 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 135 more)] === [2025-02-08 05:39:42,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:42,298 INFO L85 PathProgramCache]: Analyzing trace with hash -263196552, now seen corresponding path program 1 times [2025-02-08 05:39:42,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:42,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596381919] [2025-02-08 05:39:42,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:42,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:42,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-02-08 05:39:42,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-02-08 05:39:42,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:42,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:42,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:42,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:42,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596381919] [2025-02-08 05:39:42,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596381919] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:42,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:42,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:42,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088623249] [2025-02-08 05:39:42,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:42,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:42,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:42,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:42,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:42,363 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 521 [2025-02-08 05:39:42,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 355 transitions, 773 flow. Second operand has 3 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:42,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:42,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 521 [2025-02-08 05:39:42,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:42,897 INFO L124 PetriNetUnfolderBase]: 895/6173 cut-off events. [2025-02-08 05:39:42,897 INFO L125 PetriNetUnfolderBase]: For 469/469 co-relation queries the response was YES. [2025-02-08 05:39:42,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8415 conditions, 6173 events. 895/6173 cut-off events. For 469/469 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 63704 event pairs, 402 based on Foata normal form. 1/5450 useless extension candidates. Maximal degree in co-relation 8403. Up to 1409 conditions per place. [2025-02-08 05:39:42,981 INFO L140 encePairwiseOnDemand]: 519/521 looper letters, 0 selfloop transitions, 0 changer transitions 354/354 dead transitions. [2025-02-08 05:39:42,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 354 transitions, 817 flow [2025-02-08 05:39:42,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:42,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:42,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1266 transitions. [2025-02-08 05:39:42,988 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8099808061420346 [2025-02-08 05:39:42,988 INFO L175 Difference]: Start difference. First operand has 364 places, 355 transitions, 773 flow. Second operand 3 states and 1266 transitions. [2025-02-08 05:39:42,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 354 transitions, 817 flow [2025-02-08 05:39:42,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 354 transitions, 816 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:42,992 INFO L231 Difference]: Finished difference. Result has 364 places, 0 transitions, 0 flow [2025-02-08 05:39:42,996 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=521, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=364, PETRI_TRANSITIONS=0} [2025-02-08 05:39:42,996 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -85 predicate places. [2025-02-08 05:39:42,996 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 0 transitions, 0 flow [2025-02-08 05:39:42,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:42,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (138 of 139 remaining) [2025-02-08 05:39:43,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (137 of 139 remaining) [2025-02-08 05:39:43,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (136 of 139 remaining) [2025-02-08 05:39:43,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (135 of 139 remaining) [2025-02-08 05:39:43,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (134 of 139 remaining) [2025-02-08 05:39:43,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (133 of 139 remaining) [2025-02-08 05:39:43,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (132 of 139 remaining) [2025-02-08 05:39:43,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (131 of 139 remaining) [2025-02-08 05:39:43,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (130 of 139 remaining) [2025-02-08 05:39:43,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (129 of 139 remaining) [2025-02-08 05:39:43,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (128 of 139 remaining) [2025-02-08 05:39:43,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (127 of 139 remaining) [2025-02-08 05:39:43,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (126 of 139 remaining) [2025-02-08 05:39:43,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (125 of 139 remaining) [2025-02-08 05:39:43,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (124 of 139 remaining) [2025-02-08 05:39:43,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (123 of 139 remaining) [2025-02-08 05:39:43,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (122 of 139 remaining) [2025-02-08 05:39:43,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (121 of 139 remaining) [2025-02-08 05:39:43,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (120 of 139 remaining) [2025-02-08 05:39:43,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (119 of 139 remaining) [2025-02-08 05:39:43,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (118 of 139 remaining) [2025-02-08 05:39:43,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (117 of 139 remaining) [2025-02-08 05:39:43,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (116 of 139 remaining) [2025-02-08 05:39:43,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (115 of 139 remaining) [2025-02-08 05:39:43,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (114 of 139 remaining) [2025-02-08 05:39:43,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (113 of 139 remaining) [2025-02-08 05:39:43,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (112 of 139 remaining) [2025-02-08 05:39:43,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (111 of 139 remaining) [2025-02-08 05:39:43,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (110 of 139 remaining) [2025-02-08 05:39:43,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (109 of 139 remaining) [2025-02-08 05:39:43,005 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (108 of 139 remaining) [2025-02-08 05:39:43,005 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (107 of 139 remaining) [2025-02-08 05:39:43,005 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (106 of 139 remaining) [2025-02-08 05:39:43,005 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (105 of 139 remaining) [2025-02-08 05:39:43,005 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (104 of 139 remaining) [2025-02-08 05:39:43,005 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (103 of 139 remaining) [2025-02-08 05:39:43,005 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (102 of 139 remaining) [2025-02-08 05:39:43,005 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (101 of 139 remaining) [2025-02-08 05:39:43,005 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (100 of 139 remaining) [2025-02-08 05:39:43,005 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (99 of 139 remaining) [2025-02-08 05:39:43,005 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (98 of 139 remaining) [2025-02-08 05:39:43,005 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (97 of 139 remaining) [2025-02-08 05:39:43,005 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (96 of 139 remaining) [2025-02-08 05:39:43,005 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (95 of 139 remaining) [2025-02-08 05:39:43,006 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (94 of 139 remaining) [2025-02-08 05:39:43,006 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (93 of 139 remaining) [2025-02-08 05:39:43,006 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (92 of 139 remaining) [2025-02-08 05:39:43,006 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (91 of 139 remaining) [2025-02-08 05:39:43,006 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (90 of 139 remaining) [2025-02-08 05:39:43,006 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (89 of 139 remaining) [2025-02-08 05:39:43,006 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (88 of 139 remaining) [2025-02-08 05:39:43,006 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (87 of 139 remaining) [2025-02-08 05:39:43,006 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (86 of 139 remaining) [2025-02-08 05:39:43,006 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (85 of 139 remaining) [2025-02-08 05:39:43,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (84 of 139 remaining) [2025-02-08 05:39:43,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (83 of 139 remaining) [2025-02-08 05:39:43,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (82 of 139 remaining) [2025-02-08 05:39:43,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (81 of 139 remaining) [2025-02-08 05:39:43,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (80 of 139 remaining) [2025-02-08 05:39:43,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (79 of 139 remaining) [2025-02-08 05:39:43,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (78 of 139 remaining) [2025-02-08 05:39:43,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (77 of 139 remaining) [2025-02-08 05:39:43,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (76 of 139 remaining) [2025-02-08 05:39:43,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (75 of 139 remaining) [2025-02-08 05:39:43,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (74 of 139 remaining) [2025-02-08 05:39:43,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err10ASSERT_VIOLATIONDATA_RACE (73 of 139 remaining) [2025-02-08 05:39:43,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err9ASSERT_VIOLATIONDATA_RACE (72 of 139 remaining) [2025-02-08 05:39:43,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err8ASSERT_VIOLATIONDATA_RACE (71 of 139 remaining) [2025-02-08 05:39:43,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err7ASSERT_VIOLATIONDATA_RACE (70 of 139 remaining) [2025-02-08 05:39:43,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err6ASSERT_VIOLATIONDATA_RACE (69 of 139 remaining) [2025-02-08 05:39:43,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err5ASSERT_VIOLATIONDATA_RACE (68 of 139 remaining) [2025-02-08 05:39:43,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (67 of 139 remaining) [2025-02-08 05:39:43,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (66 of 139 remaining) [2025-02-08 05:39:43,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (65 of 139 remaining) [2025-02-08 05:39:43,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (64 of 139 remaining) [2025-02-08 05:39:43,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err10ASSERT_VIOLATIONDATA_RACE (63 of 139 remaining) [2025-02-08 05:39:43,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err9ASSERT_VIOLATIONDATA_RACE (62 of 139 remaining) [2025-02-08 05:39:43,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err8ASSERT_VIOLATIONDATA_RACE (61 of 139 remaining) [2025-02-08 05:39:43,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err7ASSERT_VIOLATIONDATA_RACE (60 of 139 remaining) [2025-02-08 05:39:43,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err6ASSERT_VIOLATIONDATA_RACE (59 of 139 remaining) [2025-02-08 05:39:43,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err5ASSERT_VIOLATIONDATA_RACE (58 of 139 remaining) [2025-02-08 05:39:43,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (57 of 139 remaining) [2025-02-08 05:39:43,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (56 of 139 remaining) [2025-02-08 05:39:43,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (55 of 139 remaining) [2025-02-08 05:39:43,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (54 of 139 remaining) [2025-02-08 05:39:43,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (53 of 139 remaining) [2025-02-08 05:39:43,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (52 of 139 remaining) [2025-02-08 05:39:43,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (51 of 139 remaining) [2025-02-08 05:39:43,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (50 of 139 remaining) [2025-02-08 05:39:43,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (49 of 139 remaining) [2025-02-08 05:39:43,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 139 remaining) [2025-02-08 05:39:43,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (47 of 139 remaining) [2025-02-08 05:39:43,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (46 of 139 remaining) [2025-02-08 05:39:43,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (45 of 139 remaining) [2025-02-08 05:39:43,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (44 of 139 remaining) [2025-02-08 05:39:43,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (43 of 139 remaining) [2025-02-08 05:39:43,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (42 of 139 remaining) [2025-02-08 05:39:43,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (41 of 139 remaining) [2025-02-08 05:39:43,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (40 of 139 remaining) [2025-02-08 05:39:43,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (39 of 139 remaining) [2025-02-08 05:39:43,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (38 of 139 remaining) [2025-02-08 05:39:43,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (37 of 139 remaining) [2025-02-08 05:39:43,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (36 of 139 remaining) [2025-02-08 05:39:43,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (35 of 139 remaining) [2025-02-08 05:39:43,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (34 of 139 remaining) [2025-02-08 05:39:43,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (33 of 139 remaining) [2025-02-08 05:39:43,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (32 of 139 remaining) [2025-02-08 05:39:43,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (31 of 139 remaining) [2025-02-08 05:39:43,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (30 of 139 remaining) [2025-02-08 05:39:43,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (29 of 139 remaining) [2025-02-08 05:39:43,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (28 of 139 remaining) [2025-02-08 05:39:43,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (27 of 139 remaining) [2025-02-08 05:39:43,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (26 of 139 remaining) [2025-02-08 05:39:43,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (25 of 139 remaining) [2025-02-08 05:39:43,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (24 of 139 remaining) [2025-02-08 05:39:43,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (23 of 139 remaining) [2025-02-08 05:39:43,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (22 of 139 remaining) [2025-02-08 05:39:43,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork5Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 139 remaining) [2025-02-08 05:39:43,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork5Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 139 remaining) [2025-02-08 05:39:43,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err10ASSERT_VIOLATIONDATA_RACE (19 of 139 remaining) [2025-02-08 05:39:43,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err9ASSERT_VIOLATIONDATA_RACE (18 of 139 remaining) [2025-02-08 05:39:43,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err8ASSERT_VIOLATIONDATA_RACE (17 of 139 remaining) [2025-02-08 05:39:43,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err7ASSERT_VIOLATIONDATA_RACE (16 of 139 remaining) [2025-02-08 05:39:43,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err6ASSERT_VIOLATIONDATA_RACE (15 of 139 remaining) [2025-02-08 05:39:43,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err5ASSERT_VIOLATIONDATA_RACE (14 of 139 remaining) [2025-02-08 05:39:43,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (13 of 139 remaining) [2025-02-08 05:39:43,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (12 of 139 remaining) [2025-02-08 05:39:43,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (11 of 139 remaining) [2025-02-08 05:39:43,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (10 of 139 remaining) [2025-02-08 05:39:43,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err10ASSERT_VIOLATIONDATA_RACE (9 of 139 remaining) [2025-02-08 05:39:43,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err9ASSERT_VIOLATIONDATA_RACE (8 of 139 remaining) [2025-02-08 05:39:43,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err8ASSERT_VIOLATIONDATA_RACE (7 of 139 remaining) [2025-02-08 05:39:43,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err7ASSERT_VIOLATIONDATA_RACE (6 of 139 remaining) [2025-02-08 05:39:43,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err6ASSERT_VIOLATIONDATA_RACE (5 of 139 remaining) [2025-02-08 05:39:43,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err5ASSERT_VIOLATIONDATA_RACE (4 of 139 remaining) [2025-02-08 05:39:43,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (3 of 139 remaining) [2025-02-08 05:39:43,018 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (2 of 139 remaining) [2025-02-08 05:39:43,018 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (1 of 139 remaining) [2025-02-08 05:39:43,018 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (0 of 139 remaining) [2025-02-08 05:39:43,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 05:39:43,018 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:43,022 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:39:43,025 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:39:43,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:39:43 BasicIcfg [2025-02-08 05:39:43,033 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:39:43,034 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:39:43,037 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:39:43,038 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:39:43,038 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:39:30" (3/4) ... [2025-02-08 05:39:43,039 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:39:43,041 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:39:43,045 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:39:43,045 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 05:39:43,046 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-02-08 05:39:43,046 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread5 [2025-02-08 05:39:43,046 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread6 [2025-02-08 05:39:43,051 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2025-02-08 05:39:43,052 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:39:43,052 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:39:43,052 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:39:43,128 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:39:43,129 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:39:43,129 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:39:43,130 INFO L158 Benchmark]: Toolchain (without parser) took 14378.32ms. Allocated memory was 167.8MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 128.3MB in the beginning and 826.2MB in the end (delta: -697.9MB). Peak memory consumption was 769.9MB. Max. memory is 16.1GB. [2025-02-08 05:39:43,131 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:39:43,131 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.14ms. Allocated memory is still 167.8MB. Free memory was 128.3MB in the beginning and 113.7MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:39:43,131 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.29ms. Allocated memory is still 167.8MB. Free memory was 113.7MB in the beginning and 110.2MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:39:43,131 INFO L158 Benchmark]: Boogie Preprocessor took 35.14ms. Allocated memory is still 167.8MB. Free memory was 110.2MB in the beginning and 107.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:39:43,131 INFO L158 Benchmark]: IcfgBuilder took 1186.64ms. Allocated memory is still 167.8MB. Free memory was 107.5MB in the beginning and 73.2MB in the end (delta: 34.3MB). Peak memory consumption was 83.4MB. Max. memory is 16.1GB. [2025-02-08 05:39:43,132 INFO L158 Benchmark]: TraceAbstraction took 12766.09ms. Allocated memory was 167.8MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 72.3MB in the beginning and 830.5MB in the end (delta: -758.2MB). Peak memory consumption was 703.3MB. Max. memory is 16.1GB. [2025-02-08 05:39:43,132 INFO L158 Benchmark]: Witness Printer took 95.10ms. Allocated memory is still 1.6GB. Free memory was 830.5MB in the beginning and 826.2MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:39:43,134 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.14ms. Allocated memory is still 167.8MB. Free memory was 128.3MB in the beginning and 113.7MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.29ms. Allocated memory is still 167.8MB. Free memory was 113.7MB in the beginning and 110.2MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.14ms. Allocated memory is still 167.8MB. Free memory was 110.2MB in the beginning and 107.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1186.64ms. Allocated memory is still 167.8MB. Free memory was 107.5MB in the beginning and 73.2MB in the end (delta: 34.3MB). Peak memory consumption was 83.4MB. Max. memory is 16.1GB. * TraceAbstraction took 12766.09ms. Allocated memory was 167.8MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 72.3MB in the beginning and 830.5MB in the end (delta: -758.2MB). Peak memory consumption was 703.3MB. Max. memory is 16.1GB. * Witness Printer took 95.10ms. Allocated memory is still 1.6GB. Free memory was 830.5MB in the beginning and 826.2MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 143]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 144]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 145]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 146]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 147]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 148]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 149]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 150]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 151]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 152]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 153]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 154]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 155]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 156]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 177]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 156]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 165]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 165]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 13 procedures, 625 locations, 139 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.6s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 597 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 273 mSDsluCounter, 133 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1535 IncrementalHoareTripleChecker+Invalid, 1625 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 133 mSDtfsCounter, 1535 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=948occurred in iteration=0, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2944 NumberOfCodeBlocks, 2944 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2921 ConstructedInterpolants, 0 QuantifiedInterpolants, 3080 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 83 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:39:43,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE