./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/parallel-parallel-sum-1-dsl.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-1-dsl.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 462fb42b593b74362524fb8209dde3f76380a79de0c48b612eb75bd0eda8df1c --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:39:24,628 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:39:24,694 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:24,700 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:39:24,701 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:39:24,725 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:39:24,726 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:39:24,726 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:39:24,727 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:39:24,727 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:39:24,727 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:39:24,728 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:39:24,728 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:39:24,728 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:39:24,728 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:39:24,729 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:39:24,729 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:39:24,729 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:39:24,729 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:39:24,730 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:39:24,730 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:39:24,730 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:39:24,730 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:39:24,730 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:39:24,730 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:39:24,730 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:39:24,730 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:39:24,730 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:39:24,731 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:39:24,731 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:39:24,731 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:39:24,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:39:24,731 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:39:24,731 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:39:24,731 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:39:24,732 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:39:24,732 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:39:24,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:39:24,732 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:39:24,732 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:39:24,732 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:39:24,733 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:39:24,733 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 -> 462fb42b593b74362524fb8209dde3f76380a79de0c48b612eb75bd0eda8df1c [2025-02-08 05:39:25,031 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:39:25,041 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:39:25,044 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:39:25,045 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:39:25,045 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:39:25,046 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-parallel-sum-1-dsl.wvr.c [2025-02-08 05:39:26,409 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/407da64a3/4abffe0252ab44d4a35dc357c654d7cd/FLAGd16dec717 [2025-02-08 05:39:26,708 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:39:26,711 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-parallel-sum-1-dsl.wvr.c [2025-02-08 05:39:26,722 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/407da64a3/4abffe0252ab44d4a35dc357c654d7cd/FLAGd16dec717 [2025-02-08 05:39:26,745 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/407da64a3/4abffe0252ab44d4a35dc357c654d7cd [2025-02-08 05:39:26,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:39:26,749 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:39:26,751 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:39:26,751 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:39:26,755 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:39:26,756 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:39:26" (1/1) ... [2025-02-08 05:39:26,757 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dba5444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:26, skipping insertion in model container [2025-02-08 05:39:26,757 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:39:26" (1/1) ... [2025-02-08 05:39:26,781 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:39:26,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:39:26,985 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:39:27,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:39:27,058 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:39:27,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:27 WrapperNode [2025-02-08 05:39:27,059 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:39:27,060 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:39:27,060 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:39:27,061 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:39:27,066 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:27" (1/1) ... [2025-02-08 05:39:27,078 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:27" (1/1) ... [2025-02-08 05:39:27,124 INFO L138 Inliner]: procedures = 28, calls = 66, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 489 [2025-02-08 05:39:27,129 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:39:27,129 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:39:27,129 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:39:27,129 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:39:27,135 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:27" (1/1) ... [2025-02-08 05:39:27,137 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:27" (1/1) ... [2025-02-08 05:39:27,146 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:27" (1/1) ... [2025-02-08 05:39:27,146 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:27" (1/1) ... [2025-02-08 05:39:27,170 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:27" (1/1) ... [2025-02-08 05:39:27,176 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:27" (1/1) ... [2025-02-08 05:39:27,178 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:27" (1/1) ... [2025-02-08 05:39:27,183 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:27" (1/1) ... [2025-02-08 05:39:27,187 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:39:27,191 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:39:27,194 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:39:27,195 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:39:27,195 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:27" (1/1) ... [2025-02-08 05:39:27,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:39:27,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:39:27,232 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:27,239 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:27,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:39:27,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:39:27,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:39:27,258 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:39:27,258 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:39:27,258 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:39:27,259 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:39:27,259 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 05:39:27,259 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 05:39:27,259 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-08 05:39:27,259 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-08 05:39:27,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:39:27,260 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-02-08 05:39:27,260 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-02-08 05:39:27,260 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-02-08 05:39:27,260 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-02-08 05:39:27,260 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 05:39:27,260 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 05:39:27,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:39:27,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:39:27,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:39:27,262 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:27,373 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:39:27,375 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:39:27,598 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55: havoc #t~nondet7#1; [2025-02-08 05:39:27,598 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-1: assume #race~s_2~0 == #t~nondet7#1; [2025-02-08 05:39:27,598 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-1: assume !(#race~s_2~0 == #t~nondet7#1); [2025-02-08 05:39:27,599 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-2: havoc #t~ret6#1; [2025-02-08 05:39:27,599 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-3: #race~s_2~0 := #t~nondet7#1; [2025-02-08 05:39:27,599 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-4: havoc #t~nondet7#1; [2025-02-08 05:39:27,599 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-5: ~s_2~0 := #t~ret6#1; [2025-02-08 05:39:27,599 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:27,599 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-7: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:39:27,599 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-8: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:39:27,599 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-9: #t~ret6#1 := plus_#res#1; [2025-02-08 05:39:27,599 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56: [2025-02-08 05:39:27,732 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L73: havoc #t~nondet14#1; [2025-02-08 05:39:27,733 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L73-1: assume #race~s_2~0 == #t~nondet14#1; [2025-02-08 05:39:27,733 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L73-1: assume !(#race~s_2~0 == #t~nondet14#1); [2025-02-08 05:39:27,733 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L73-2: havoc #t~ret13#1; [2025-02-08 05:39:27,733 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L73-3: #race~s_2~0 := #t~nondet14#1; [2025-02-08 05:39:27,733 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L73-4: havoc #t~nondet14#1; [2025-02-08 05:39:27,733 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L73-5: ~s_2~0 := #t~ret13#1; [2025-02-08 05:39:27,733 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L73-6: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret13#1 && #t~ret13#1 <= 2147483647; [2025-02-08 05:39:27,734 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L73-7: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:39:27,734 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L73-8: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:39:27,734 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L73-9: #t~ret13#1 := plus_#res#1; [2025-02-08 05:39:27,734 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L74: [2025-02-08 05:39:27,854 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L107: havoc #t~nondet27#1; [2025-02-08 05:39:27,854 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L107-1: assume #race~s_6~0 == #t~nondet27#1; [2025-02-08 05:39:27,854 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L107-1: assume !(#race~s_6~0 == #t~nondet27#1); [2025-02-08 05:39:27,854 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L107-2: havoc #t~ret26#1; [2025-02-08 05:39:27,854 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L107-3: #race~s_6~0 := #t~nondet27#1; [2025-02-08 05:39:27,854 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L107-4: havoc #t~nondet27#1; [2025-02-08 05:39:27,854 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L107-5: ~s_6~0 := #t~ret26#1; [2025-02-08 05:39:27,854 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L107-6: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647; [2025-02-08 05:39:27,855 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L107-7: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:39:27,855 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L107-8: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:39:27,855 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L107-9: #t~ret26#1 := plus_#res#1; [2025-02-08 05:39:27,855 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108: [2025-02-08 05:39:27,945 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L126: [2025-02-08 05:39:27,945 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L125: havoc #t~nondet34#1; [2025-02-08 05:39:27,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L125-1: assume #race~s_6~0 == #t~nondet34#1; [2025-02-08 05:39:27,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L125-1: assume !(#race~s_6~0 == #t~nondet34#1); [2025-02-08 05:39:27,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L125-2: havoc #t~ret33#1; [2025-02-08 05:39:27,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L125-3: #race~s_6~0 := #t~nondet34#1; [2025-02-08 05:39:27,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L125-4: havoc #t~nondet34#1; [2025-02-08 05:39:27,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L125-5: ~s_6~0 := #t~ret33#1; [2025-02-08 05:39:27,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L125-6: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647; [2025-02-08 05:39:27,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L125-7: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:39:27,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L125-8: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:39:27,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L125-9: #t~ret33#1 := plus_#res#1; [2025-02-08 05:39:28,095 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:39:28,095 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:39:28,440 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L193 is not an error location. [2025-02-08 05:39:28,440 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L193 is not an error location. [2025-02-08 05:39:28,440 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L193 is not an error location. [2025-02-08 05:39:28,441 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L193 is not an error location. [2025-02-08 05:39:28,443 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:39:28,444 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:39:28,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:39:28 BoogieIcfgContainer [2025-02-08 05:39:28,444 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:39:28,446 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:39:28,446 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:39:28,450 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:39:28,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:39:26" (1/3) ... [2025-02-08 05:39:28,451 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68a1e70c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:39:28, skipping insertion in model container [2025-02-08 05:39:28,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:27" (2/3) ... [2025-02-08 05:39:28,451 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68a1e70c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:39:28, skipping insertion in model container [2025-02-08 05:39:28,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:39:28" (3/3) ... [2025-02-08 05:39:28,453 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-1-dsl.wvr.c [2025-02-08 05:39:28,467 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:39:28,469 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-parallel-sum-1-dsl.wvr.c that has 7 procedures, 346 locations, 1 initial locations, 5 loop locations, and 71 error locations. [2025-02-08 05:39:28,469 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:39:28,620 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2025-02-08 05:39:28,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 372 places, 366 transitions, 798 flow [2025-02-08 05:39:28,786 INFO L124 PetriNetUnfolderBase]: 13/352 cut-off events. [2025-02-08 05:39:28,789 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:39:28,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 381 conditions, 352 events. 13/352 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 702 event pairs, 0 based on Foata normal form. 0/268 useless extension candidates. Maximal degree in co-relation 310. Up to 3 conditions per place. [2025-02-08 05:39:28,798 INFO L82 GeneralOperation]: Start removeDead. Operand has 372 places, 366 transitions, 798 flow [2025-02-08 05:39:28,806 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 342 places, 335 transitions, 718 flow [2025-02-08 05:39:28,820 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:39:28,830 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;@b987a0c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:39:28,830 INFO L334 AbstractCegarLoop]: Starting to check reachability of 129 error locations. [2025-02-08 05:39:28,838 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:39:28,838 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-02-08 05:39:28,838 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:39:28,838 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:28,838 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:28,839 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 126 more)] === [2025-02-08 05:39:28,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:28,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1983182015, now seen corresponding path program 1 times [2025-02-08 05:39:28,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:28,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949222295] [2025-02-08 05:39:28,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:28,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:28,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 05:39:28,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 05:39:28,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:28,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:29,010 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:29,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:29,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949222295] [2025-02-08 05:39:29,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949222295] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:29,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:29,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:29,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997910239] [2025-02-08 05:39:29,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:29,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:29,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:29,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:29,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:29,078 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 370 [2025-02-08 05:39:29,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 335 transitions, 718 flow. Second operand has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 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:29,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:29,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 370 [2025-02-08 05:39:29,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:30,259 INFO L124 PetriNetUnfolderBase]: 1849/3517 cut-off events. [2025-02-08 05:39:30,259 INFO L125 PetriNetUnfolderBase]: For 1150/1150 co-relation queries the response was YES. [2025-02-08 05:39:30,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7368 conditions, 3517 events. 1849/3517 cut-off events. For 1150/1150 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 22592 event pairs, 1568 based on Foata normal form. 554/3636 useless extension candidates. Maximal degree in co-relation 6979. Up to 2638 conditions per place. [2025-02-08 05:39:30,291 INFO L140 encePairwiseOnDemand]: 308/370 looper letters, 27 selfloop transitions, 2 changer transitions 11/275 dead transitions. [2025-02-08 05:39:30,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 275 transitions, 672 flow [2025-02-08 05:39:30,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:30,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:30,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 883 transitions. [2025-02-08 05:39:30,310 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7954954954954955 [2025-02-08 05:39:30,313 INFO L175 Difference]: Start difference. First operand has 342 places, 335 transitions, 718 flow. Second operand 3 states and 883 transitions. [2025-02-08 05:39:30,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 275 transitions, 672 flow [2025-02-08 05:39:30,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 275 transitions, 640 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-02-08 05:39:30,339 INFO L231 Difference]: Finished difference. Result has 279 places, 264 transitions, 548 flow [2025-02-08 05:39:30,343 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=548, PETRI_PLACES=279, PETRI_TRANSITIONS=264} [2025-02-08 05:39:30,348 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -63 predicate places. [2025-02-08 05:39:30,349 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 264 transitions, 548 flow [2025-02-08 05:39:30,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 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,350 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:30,350 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:30,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:39:30,351 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 126 more)] === [2025-02-08 05:39:30,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:30,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1756917784, now seen corresponding path program 1 times [2025-02-08 05:39:30,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:30,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055403930] [2025-02-08 05:39:30,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:30,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:30,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 05:39:30,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 05:39:30,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:30,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:30,452 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,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:30,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055403930] [2025-02-08 05:39:30,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055403930] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:30,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:30,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:30,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468418941] [2025-02-08 05:39:30,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:30,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:30,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:30,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:30,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:30,475 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 370 [2025-02-08 05:39:30,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 264 transitions, 548 flow. Second operand has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 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,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:30,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 370 [2025-02-08 05:39:30,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:30,709 INFO L124 PetriNetUnfolderBase]: 265/972 cut-off events. [2025-02-08 05:39:30,710 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-02-08 05:39:30,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1475 conditions, 972 events. 265/972 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 4690 event pairs, 192 based on Foata normal form. 0/853 useless extension candidates. Maximal degree in co-relation 1441. Up to 413 conditions per place. [2025-02-08 05:39:30,722 INFO L140 encePairwiseOnDemand]: 367/370 looper letters, 26 selfloop transitions, 2 changer transitions 0/263 dead transitions. [2025-02-08 05:39:30,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 263 transitions, 602 flow [2025-02-08 05:39:30,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:30,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:30,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 818 transitions. [2025-02-08 05:39:30,726 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.736936936936937 [2025-02-08 05:39:30,727 INFO L175 Difference]: Start difference. First operand has 279 places, 264 transitions, 548 flow. Second operand 3 states and 818 transitions. [2025-02-08 05:39:30,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 263 transitions, 602 flow [2025-02-08 05:39:30,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 263 transitions, 598 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:30,735 INFO L231 Difference]: Finished difference. Result has 267 places, 263 transitions, 546 flow [2025-02-08 05:39:30,737 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=546, PETRI_PLACES=267, PETRI_TRANSITIONS=263} [2025-02-08 05:39:30,738 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -75 predicate places. [2025-02-08 05:39:30,739 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 263 transitions, 546 flow [2025-02-08 05:39:30,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 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,739 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:30,740 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:30,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:39:30,740 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 126 more)] === [2025-02-08 05:39:30,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:30,742 INFO L85 PathProgramCache]: Analyzing trace with hash -780840986, now seen corresponding path program 1 times [2025-02-08 05:39:30,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:30,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061464932] [2025-02-08 05:39:30,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:30,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:30,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 05:39:30,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 05:39:30,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:30,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:30,824 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,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:30,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061464932] [2025-02-08 05:39:30,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061464932] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:30,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:30,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:30,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456351481] [2025-02-08 05:39:30,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:30,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:30,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:30,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:30,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:30,838 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 370 [2025-02-08 05:39:30,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 263 transitions, 546 flow. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:30,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 370 [2025-02-08 05:39:30,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:31,008 INFO L124 PetriNetUnfolderBase]: 265/971 cut-off events. [2025-02-08 05:39:31,008 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-02-08 05:39:31,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1473 conditions, 971 events. 265/971 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 4671 event pairs, 192 based on Foata normal form. 0/853 useless extension candidates. Maximal degree in co-relation 1431. Up to 412 conditions per place. [2025-02-08 05:39:31,017 INFO L140 encePairwiseOnDemand]: 367/370 looper letters, 25 selfloop transitions, 2 changer transitions 0/262 dead transitions. [2025-02-08 05:39:31,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 262 transitions, 598 flow [2025-02-08 05:39:31,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:31,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:31,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 820 transitions. [2025-02-08 05:39:31,023 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7387387387387387 [2025-02-08 05:39:31,023 INFO L175 Difference]: Start difference. First operand has 267 places, 263 transitions, 546 flow. Second operand 3 states and 820 transitions. [2025-02-08 05:39:31,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 262 transitions, 598 flow [2025-02-08 05:39:31,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 262 transitions, 594 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:31,028 INFO L231 Difference]: Finished difference. Result has 266 places, 262 transitions, 544 flow [2025-02-08 05:39:31,029 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=544, PETRI_PLACES=266, PETRI_TRANSITIONS=262} [2025-02-08 05:39:31,029 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -76 predicate places. [2025-02-08 05:39:31,030 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 262 transitions, 544 flow [2025-02-08 05:39:31,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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,030 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:31,030 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:31,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:39:31,031 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 126 more)] === [2025-02-08 05:39:31,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:31,032 INFO L85 PathProgramCache]: Analyzing trace with hash 998245509, now seen corresponding path program 1 times [2025-02-08 05:39:31,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:31,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111628543] [2025-02-08 05:39:31,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:31,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:31,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 05:39:31,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 05:39:31,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:31,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:31,116 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,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:31,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111628543] [2025-02-08 05:39:31,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111628543] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:31,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:31,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:31,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931079616] [2025-02-08 05:39:31,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:31,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:31,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:31,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:31,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:31,128 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 370 [2025-02-08 05:39:31,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 262 transitions, 544 flow. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:31,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 370 [2025-02-08 05:39:31,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:31,316 INFO L124 PetriNetUnfolderBase]: 265/970 cut-off events. [2025-02-08 05:39:31,316 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-02-08 05:39:31,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1472 conditions, 970 events. 265/970 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 4640 event pairs, 192 based on Foata normal form. 0/853 useless extension candidates. Maximal degree in co-relation 1422. Up to 412 conditions per place. [2025-02-08 05:39:31,324 INFO L140 encePairwiseOnDemand]: 367/370 looper letters, 25 selfloop transitions, 2 changer transitions 0/261 dead transitions. [2025-02-08 05:39:31,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 261 transitions, 596 flow [2025-02-08 05:39:31,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:31,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:31,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 820 transitions. [2025-02-08 05:39:31,327 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7387387387387387 [2025-02-08 05:39:31,327 INFO L175 Difference]: Start difference. First operand has 266 places, 262 transitions, 544 flow. Second operand 3 states and 820 transitions. [2025-02-08 05:39:31,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 261 transitions, 596 flow [2025-02-08 05:39:31,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 261 transitions, 592 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:31,332 INFO L231 Difference]: Finished difference. Result has 265 places, 261 transitions, 542 flow [2025-02-08 05:39:31,332 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=542, PETRI_PLACES=265, PETRI_TRANSITIONS=261} [2025-02-08 05:39:31,333 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -77 predicate places. [2025-02-08 05:39:31,333 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 261 transitions, 542 flow [2025-02-08 05:39:31,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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,334 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:31,334 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:31,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:39:31,334 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 126 more)] === [2025-02-08 05:39:31,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:31,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1117397978, now seen corresponding path program 1 times [2025-02-08 05:39:31,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:31,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623631103] [2025-02-08 05:39:31,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:31,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:31,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-08 05:39:31,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-08 05:39:31,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:31,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:31,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:31,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:31,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623631103] [2025-02-08 05:39:31,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623631103] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:31,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:31,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:31,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139272584] [2025-02-08 05:39:31,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:31,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:31,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:31,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:31,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:31,404 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 370 [2025-02-08 05:39:31,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 261 transitions, 542 flow. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:31,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 370 [2025-02-08 05:39:31,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:31,554 INFO L124 PetriNetUnfolderBase]: 265/969 cut-off events. [2025-02-08 05:39:31,555 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-02-08 05:39:31,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1471 conditions, 969 events. 265/969 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 4636 event pairs, 192 based on Foata normal form. 0/853 useless extension candidates. Maximal degree in co-relation 1413. Up to 412 conditions per place. [2025-02-08 05:39:31,563 INFO L140 encePairwiseOnDemand]: 367/370 looper letters, 25 selfloop transitions, 2 changer transitions 0/260 dead transitions. [2025-02-08 05:39:31,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 260 transitions, 594 flow [2025-02-08 05:39:31,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:31,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:31,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 820 transitions. [2025-02-08 05:39:31,566 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7387387387387387 [2025-02-08 05:39:31,566 INFO L175 Difference]: Start difference. First operand has 265 places, 261 transitions, 542 flow. Second operand 3 states and 820 transitions. [2025-02-08 05:39:31,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 260 transitions, 594 flow [2025-02-08 05:39:31,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 260 transitions, 590 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:31,571 INFO L231 Difference]: Finished difference. Result has 264 places, 260 transitions, 540 flow [2025-02-08 05:39:31,572 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=540, PETRI_PLACES=264, PETRI_TRANSITIONS=260} [2025-02-08 05:39:31,572 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -78 predicate places. [2025-02-08 05:39:31,572 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 260 transitions, 540 flow [2025-02-08 05:39:31,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:31,573 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:31,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:39:31,574 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 126 more)] === [2025-02-08 05:39:31,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:31,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1081200421, now seen corresponding path program 1 times [2025-02-08 05:39:31,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:31,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761379063] [2025-02-08 05:39:31,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:31,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:31,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-08 05:39:31,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 05:39:31,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:31,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:31,662 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,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:31,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761379063] [2025-02-08 05:39:31,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761379063] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:31,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:31,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:31,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014923554] [2025-02-08 05:39:31,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:31,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:31,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:31,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:31,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:31,687 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 370 [2025-02-08 05:39:31,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 260 transitions, 540 flow. Second operand has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 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,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:31,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 370 [2025-02-08 05:39:31,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:31,834 INFO L124 PetriNetUnfolderBase]: 265/968 cut-off events. [2025-02-08 05:39:31,835 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-02-08 05:39:31,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1471 conditions, 968 events. 265/968 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 4639 event pairs, 192 based on Foata normal form. 0/853 useless extension candidates. Maximal degree in co-relation 1405. Up to 413 conditions per place. [2025-02-08 05:39:31,842 INFO L140 encePairwiseOnDemand]: 367/370 looper letters, 26 selfloop transitions, 2 changer transitions 0/259 dead transitions. [2025-02-08 05:39:31,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 259 transitions, 594 flow [2025-02-08 05:39:31,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:31,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:31,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 818 transitions. [2025-02-08 05:39:31,845 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.736936936936937 [2025-02-08 05:39:31,845 INFO L175 Difference]: Start difference. First operand has 264 places, 260 transitions, 540 flow. Second operand 3 states and 818 transitions. [2025-02-08 05:39:31,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 259 transitions, 594 flow [2025-02-08 05:39:31,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 259 transitions, 590 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:31,850 INFO L231 Difference]: Finished difference. Result has 263 places, 259 transitions, 538 flow [2025-02-08 05:39:31,850 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=538, PETRI_PLACES=263, PETRI_TRANSITIONS=259} [2025-02-08 05:39:31,851 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -79 predicate places. [2025-02-08 05:39:31,853 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 259 transitions, 538 flow [2025-02-08 05:39:31,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 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,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:31,854 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:31,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:39:31,854 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 126 more)] === [2025-02-08 05:39:31,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:31,855 INFO L85 PathProgramCache]: Analyzing trace with hash 655215232, now seen corresponding path program 1 times [2025-02-08 05:39:31,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:31,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450611639] [2025-02-08 05:39:31,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:31,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:31,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 05:39:31,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 05:39:31,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:31,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:31,918 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,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:31,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450611639] [2025-02-08 05:39:31,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450611639] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:31,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:31,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:31,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468090358] [2025-02-08 05:39:31,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:31,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:31,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:31,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:31,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:31,930 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 370 [2025-02-08 05:39:31,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 259 transitions, 538 flow. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:31,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 370 [2025-02-08 05:39:31,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:32,082 INFO L124 PetriNetUnfolderBase]: 265/967 cut-off events. [2025-02-08 05:39:32,083 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-02-08 05:39:32,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1469 conditions, 967 events. 265/967 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 4637 event pairs, 192 based on Foata normal form. 0/853 useless extension candidates. Maximal degree in co-relation 1395. Up to 412 conditions per place. [2025-02-08 05:39:32,093 INFO L140 encePairwiseOnDemand]: 367/370 looper letters, 25 selfloop transitions, 2 changer transitions 0/258 dead transitions. [2025-02-08 05:39:32,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 258 transitions, 590 flow [2025-02-08 05:39:32,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:32,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:32,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 820 transitions. [2025-02-08 05:39:32,096 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7387387387387387 [2025-02-08 05:39:32,097 INFO L175 Difference]: Start difference. First operand has 263 places, 259 transitions, 538 flow. Second operand 3 states and 820 transitions. [2025-02-08 05:39:32,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 258 transitions, 590 flow [2025-02-08 05:39:32,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 258 transitions, 586 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:32,116 INFO L231 Difference]: Finished difference. Result has 262 places, 258 transitions, 536 flow [2025-02-08 05:39:32,116 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=536, PETRI_PLACES=262, PETRI_TRANSITIONS=258} [2025-02-08 05:39:32,118 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -80 predicate places. [2025-02-08 05:39:32,118 INFO L471 AbstractCegarLoop]: Abstraction has has 262 places, 258 transitions, 536 flow [2025-02-08 05:39:32,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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,119 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:32,119 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] [2025-02-08 05:39:32,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:39:32,119 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 126 more)] === [2025-02-08 05:39:32,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:32,119 INFO L85 PathProgramCache]: Analyzing trace with hash -745362122, now seen corresponding path program 1 times [2025-02-08 05:39:32,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:32,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938017605] [2025-02-08 05:39:32,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:32,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:32,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-08 05:39:32,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-08 05:39:32,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:32,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:32,190 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,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:32,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938017605] [2025-02-08 05:39:32,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938017605] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:32,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:32,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:32,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931757885] [2025-02-08 05:39:32,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:32,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:32,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:32,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:32,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:32,204 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 370 [2025-02-08 05:39:32,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 258 transitions, 536 flow. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:32,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 370 [2025-02-08 05:39:32,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:32,397 INFO L124 PetriNetUnfolderBase]: 265/966 cut-off events. [2025-02-08 05:39:32,397 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-02-08 05:39:32,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1468 conditions, 966 events. 265/966 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 4634 event pairs, 192 based on Foata normal form. 0/853 useless extension candidates. Maximal degree in co-relation 1386. Up to 412 conditions per place. [2025-02-08 05:39:32,406 INFO L140 encePairwiseOnDemand]: 367/370 looper letters, 25 selfloop transitions, 2 changer transitions 0/257 dead transitions. [2025-02-08 05:39:32,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 257 transitions, 588 flow [2025-02-08 05:39:32,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:32,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:32,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 820 transitions. [2025-02-08 05:39:32,409 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7387387387387387 [2025-02-08 05:39:32,409 INFO L175 Difference]: Start difference. First operand has 262 places, 258 transitions, 536 flow. Second operand 3 states and 820 transitions. [2025-02-08 05:39:32,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 257 transitions, 588 flow [2025-02-08 05:39:32,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 257 transitions, 584 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:32,418 INFO L231 Difference]: Finished difference. Result has 261 places, 257 transitions, 534 flow [2025-02-08 05:39:32,418 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=534, PETRI_PLACES=261, PETRI_TRANSITIONS=257} [2025-02-08 05:39:32,419 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -81 predicate places. [2025-02-08 05:39:32,419 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 257 transitions, 534 flow [2025-02-08 05:39:32,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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: SelfDestructingSolverStorable7 [2025-02-08 05:39:32,420 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 126 more)] === [2025-02-08 05:39:32,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:32,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1582696777, now seen corresponding path program 1 times [2025-02-08 05:39:32,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:32,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701542361] [2025-02-08 05:39:32,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:32,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:32,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-08 05:39:32,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-08 05:39:32,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:32,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:32,511 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,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:32,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701542361] [2025-02-08 05:39:32,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701542361] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:32,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:32,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:32,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908605315] [2025-02-08 05:39:32,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:32,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:32,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:32,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:32,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:32,532 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 370 [2025-02-08 05:39:32,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 257 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:32,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 370 [2025-02-08 05:39:32,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:32,720 INFO L124 PetriNetUnfolderBase]: 265/965 cut-off events. [2025-02-08 05:39:32,720 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-02-08 05:39:32,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1467 conditions, 965 events. 265/965 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 4632 event pairs, 192 based on Foata normal form. 0/853 useless extension candidates. Maximal degree in co-relation 1377. Up to 412 conditions per place. [2025-02-08 05:39:32,729 INFO L140 encePairwiseOnDemand]: 367/370 looper letters, 25 selfloop transitions, 2 changer transitions 0/256 dead transitions. [2025-02-08 05:39:32,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 256 transitions, 586 flow [2025-02-08 05:39:32,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:32,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:32,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 820 transitions. [2025-02-08 05:39:32,733 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7387387387387387 [2025-02-08 05:39:32,733 INFO L175 Difference]: Start difference. First operand has 261 places, 257 transitions, 534 flow. Second operand 3 states and 820 transitions. [2025-02-08 05:39:32,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 256 transitions, 586 flow [2025-02-08 05:39:32,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 256 transitions, 582 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:32,739 INFO L231 Difference]: Finished difference. Result has 260 places, 256 transitions, 532 flow [2025-02-08 05:39:32,740 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=532, PETRI_PLACES=260, PETRI_TRANSITIONS=256} [2025-02-08 05:39:32,740 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -82 predicate places. [2025-02-08 05:39:32,740 INFO L471 AbstractCegarLoop]: Abstraction has has 260 places, 256 transitions, 532 flow [2025-02-08 05:39:32,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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, 1, 1, 1, 1, 1, 1, 1, 1, 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,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:39:32,741 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 126 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 -934170351, 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 [1334466248] [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,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 05:39:32,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 05:39:32,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:32,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:32,818 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,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:32,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334466248] [2025-02-08 05:39:32,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334466248] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:32,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:32,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:32,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018319208] [2025-02-08 05:39:32,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:32,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:32,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:32,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:32,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:32,831 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 370 [2025-02-08 05:39:32,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 256 transitions, 532 flow. Second operand has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 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,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:32,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 370 [2025-02-08 05:39:32,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:32,999 INFO L124 PetriNetUnfolderBase]: 265/963 cut-off events. [2025-02-08 05:39:32,999 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-02-08 05:39:33,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1465 conditions, 963 events. 265/963 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 4628 event pairs, 192 based on Foata normal form. 0/853 useless extension candidates. Maximal degree in co-relation 1367. Up to 412 conditions per place. [2025-02-08 05:39:33,008 INFO L140 encePairwiseOnDemand]: 367/370 looper letters, 26 selfloop transitions, 1 changer transitions 0/254 dead transitions. [2025-02-08 05:39:33,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 254 transitions, 582 flow [2025-02-08 05:39:33,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:33,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:33,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 821 transitions. [2025-02-08 05:39:33,011 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7396396396396396 [2025-02-08 05:39:33,011 INFO L175 Difference]: Start difference. First operand has 260 places, 256 transitions, 532 flow. Second operand 3 states and 821 transitions. [2025-02-08 05:39:33,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 254 transitions, 582 flow [2025-02-08 05:39:33,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 254 transitions, 578 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:33,017 INFO L231 Difference]: Finished difference. Result has 258 places, 254 transitions, 526 flow [2025-02-08 05:39:33,017 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=526, PETRI_PLACES=258, PETRI_TRANSITIONS=254} [2025-02-08 05:39:33,019 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -84 predicate places. [2025-02-08 05:39:33,019 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 254 transitions, 526 flow [2025-02-08 05:39:33,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 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,019 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:33,020 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:33,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:39:33,020 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 126 more)] === [2025-02-08 05:39:33,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:33,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1405560931, now seen corresponding path program 1 times [2025-02-08 05:39:33,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:33,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079370756] [2025-02-08 05:39:33,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:33,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:33,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-08 05:39:33,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-08 05:39:33,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:33,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:33,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:33,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:33,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079370756] [2025-02-08 05:39:33,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079370756] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:33,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:33,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:33,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026001448] [2025-02-08 05:39:33,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:33,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:33,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:33,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:33,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:33,123 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 370 [2025-02-08 05:39:33,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 254 transitions, 526 flow. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:33,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 370 [2025-02-08 05:39:33,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:33,292 INFO L124 PetriNetUnfolderBase]: 265/962 cut-off events. [2025-02-08 05:39:33,292 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-02-08 05:39:33,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1463 conditions, 962 events. 265/962 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 4645 event pairs, 192 based on Foata normal form. 0/853 useless extension candidates. Maximal degree in co-relation 1365. Up to 412 conditions per place. [2025-02-08 05:39:33,302 INFO L140 encePairwiseOnDemand]: 367/370 looper letters, 25 selfloop transitions, 2 changer transitions 0/253 dead transitions. [2025-02-08 05:39:33,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 253 transitions, 578 flow [2025-02-08 05:39:33,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:33,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:33,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 820 transitions. [2025-02-08 05:39:33,305 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7387387387387387 [2025-02-08 05:39:33,305 INFO L175 Difference]: Start difference. First operand has 258 places, 254 transitions, 526 flow. Second operand 3 states and 820 transitions. [2025-02-08 05:39:33,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 253 transitions, 578 flow [2025-02-08 05:39:33,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 253 transitions, 577 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:33,310 INFO L231 Difference]: Finished difference. Result has 258 places, 253 transitions, 527 flow [2025-02-08 05:39:33,311 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=527, PETRI_PLACES=258, PETRI_TRANSITIONS=253} [2025-02-08 05:39:33,312 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -84 predicate places. [2025-02-08 05:39:33,312 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 253 transitions, 527 flow [2025-02-08 05:39:33,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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,313 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:33,313 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:33,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:39:33,313 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 126 more)] === [2025-02-08 05:39:33,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:33,314 INFO L85 PathProgramCache]: Analyzing trace with hash 248781167, now seen corresponding path program 1 times [2025-02-08 05:39:33,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:33,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147348007] [2025-02-08 05:39:33,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:33,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:33,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-08 05:39:33,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-08 05:39:33,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:33,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:33,897 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,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:33,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147348007] [2025-02-08 05:39:33,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147348007] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:33,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:33,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:39:33,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44137609] [2025-02-08 05:39:33,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:33,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:39:33,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:33,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:39:33,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:39:33,964 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 370 [2025-02-08 05:39:33,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 253 transitions, 527 flow. Second operand has 6 states, 6 states have (on average 258.5) internal successors, (1551), 6 states have internal predecessors, (1551), 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,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:33,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 370 [2025-02-08 05:39:33,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:34,132 INFO L124 PetriNetUnfolderBase]: 265/961 cut-off events. [2025-02-08 05:39:34,133 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-02-08 05:39:34,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1472 conditions, 961 events. 265/961 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 4641 event pairs, 192 based on Foata normal form. 0/853 useless extension candidates. Maximal degree in co-relation 1375. Up to 417 conditions per place. [2025-02-08 05:39:34,140 INFO L140 encePairwiseOnDemand]: 364/370 looper letters, 30 selfloop transitions, 5 changer transitions 0/252 dead transitions. [2025-02-08 05:39:34,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 252 transitions, 595 flow [2025-02-08 05:39:34,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:39:34,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:39:34,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1578 transitions. [2025-02-08 05:39:34,144 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7108108108108108 [2025-02-08 05:39:34,144 INFO L175 Difference]: Start difference. First operand has 258 places, 253 transitions, 527 flow. Second operand 6 states and 1578 transitions. [2025-02-08 05:39:34,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 252 transitions, 595 flow [2025-02-08 05:39:34,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 252 transitions, 591 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:34,149 INFO L231 Difference]: Finished difference. Result has 260 places, 252 transitions, 531 flow [2025-02-08 05:39:34,150 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=521, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=531, PETRI_PLACES=260, PETRI_TRANSITIONS=252} [2025-02-08 05:39:34,152 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -82 predicate places. [2025-02-08 05:39:34,152 INFO L471 AbstractCegarLoop]: Abstraction has has 260 places, 252 transitions, 531 flow [2025-02-08 05:39:34,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 258.5) internal successors, (1551), 6 states have internal predecessors, (1551), 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,153 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:34,153 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:34,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:39:34,154 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 126 more)] === [2025-02-08 05:39:34,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:34,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1353963276, now seen corresponding path program 1 times [2025-02-08 05:39:34,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:34,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229151783] [2025-02-08 05:39:34,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:34,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:34,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-02-08 05:39:34,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-02-08 05:39:34,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:34,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:34,242 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,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:34,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229151783] [2025-02-08 05:39:34,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229151783] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:34,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:34,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:34,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748840412] [2025-02-08 05:39:34,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:34,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:34,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:34,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:34,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:34,251 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 370 [2025-02-08 05:39:34,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 252 transitions, 531 flow. Second operand has 3 states, 3 states have (on average 274.0) internal successors, (822), 3 states have internal predecessors, (822), 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,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:34,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 370 [2025-02-08 05:39:34,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:34,389 INFO L124 PetriNetUnfolderBase]: 265/960 cut-off events. [2025-02-08 05:39:34,390 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-02-08 05:39:34,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1464 conditions, 960 events. 265/960 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 4630 event pairs, 192 based on Foata normal form. 0/853 useless extension candidates. Maximal degree in co-relation 1446. Up to 410 conditions per place. [2025-02-08 05:39:34,397 INFO L140 encePairwiseOnDemand]: 368/370 looper letters, 24 selfloop transitions, 1 changer transitions 0/251 dead transitions. [2025-02-08 05:39:34,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 251 transitions, 579 flow [2025-02-08 05:39:34,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:34,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:34,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 827 transitions. [2025-02-08 05:39:34,400 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7450450450450451 [2025-02-08 05:39:34,400 INFO L175 Difference]: Start difference. First operand has 260 places, 252 transitions, 531 flow. Second operand 3 states and 827 transitions. [2025-02-08 05:39:34,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 251 transitions, 579 flow [2025-02-08 05:39:34,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 251 transitions, 569 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:39:34,404 INFO L231 Difference]: Finished difference. Result has 256 places, 251 transitions, 521 flow [2025-02-08 05:39:34,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=521, PETRI_PLACES=256, PETRI_TRANSITIONS=251} [2025-02-08 05:39:34,406 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -86 predicate places. [2025-02-08 05:39:34,406 INFO L471 AbstractCegarLoop]: Abstraction has has 256 places, 251 transitions, 521 flow [2025-02-08 05:39:34,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 274.0) internal successors, (822), 3 states have internal predecessors, (822), 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,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:34,408 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:34,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:39:34,408 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 126 more)] === [2025-02-08 05:39:34,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:34,409 INFO L85 PathProgramCache]: Analyzing trace with hash -2010226110, now seen corresponding path program 1 times [2025-02-08 05:39:34,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:34,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477276511] [2025-02-08 05:39:34,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:34,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:34,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-02-08 05:39:34,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-02-08 05:39:34,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:34,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:34,503 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,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:34,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477276511] [2025-02-08 05:39:34,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477276511] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:34,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:34,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:34,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820806292] [2025-02-08 05:39:34,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:34,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:34,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:34,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:34,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:34,513 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 370 [2025-02-08 05:39:34,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 251 transitions, 521 flow. Second operand has 3 states, 3 states have (on average 274.0) internal successors, (822), 3 states have internal predecessors, (822), 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,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:34,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 370 [2025-02-08 05:39:34,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:34,639 INFO L124 PetriNetUnfolderBase]: 265/959 cut-off events. [2025-02-08 05:39:34,639 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-02-08 05:39:34,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1458 conditions, 959 events. 265/959 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 4641 event pairs, 192 based on Foata normal form. 1/853 useless extension candidates. Maximal degree in co-relation 1450. Up to 410 conditions per place. [2025-02-08 05:39:34,644 INFO L140 encePairwiseOnDemand]: 368/370 looper letters, 0 selfloop transitions, 0 changer transitions 250/250 dead transitions. [2025-02-08 05:39:34,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 250 transitions, 567 flow [2025-02-08 05:39:34,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:34,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:34,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 826 transitions. [2025-02-08 05:39:34,647 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7441441441441441 [2025-02-08 05:39:34,647 INFO L175 Difference]: Start difference. First operand has 256 places, 251 transitions, 521 flow. Second operand 3 states and 826 transitions. [2025-02-08 05:39:34,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 250 transitions, 567 flow [2025-02-08 05:39:34,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 250 transitions, 566 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:34,651 INFO L231 Difference]: Finished difference. Result has 256 places, 0 transitions, 0 flow [2025-02-08 05:39:34,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=256, PETRI_TRANSITIONS=0} [2025-02-08 05:39:34,652 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -86 predicate places. [2025-02-08 05:39:34,652 INFO L471 AbstractCegarLoop]: Abstraction has has 256 places, 0 transitions, 0 flow [2025-02-08 05:39:34,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 274.0) internal successors, (822), 3 states have internal predecessors, (822), 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,656 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (128 of 129 remaining) [2025-02-08 05:39:34,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (127 of 129 remaining) [2025-02-08 05:39:34,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (126 of 129 remaining) [2025-02-08 05:39:34,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (125 of 129 remaining) [2025-02-08 05:39:34,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (124 of 129 remaining) [2025-02-08 05:39:34,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (123 of 129 remaining) [2025-02-08 05:39:34,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (122 of 129 remaining) [2025-02-08 05:39:34,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (121 of 129 remaining) [2025-02-08 05:39:34,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (120 of 129 remaining) [2025-02-08 05:39:34,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (119 of 129 remaining) [2025-02-08 05:39:34,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (118 of 129 remaining) [2025-02-08 05:39:34,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (117 of 129 remaining) [2025-02-08 05:39:34,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (116 of 129 remaining) [2025-02-08 05:39:34,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (115 of 129 remaining) [2025-02-08 05:39:34,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (114 of 129 remaining) [2025-02-08 05:39:34,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (113 of 129 remaining) [2025-02-08 05:39:34,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (112 of 129 remaining) [2025-02-08 05:39:34,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (111 of 129 remaining) [2025-02-08 05:39:34,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (110 of 129 remaining) [2025-02-08 05:39:34,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (109 of 129 remaining) [2025-02-08 05:39:34,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (108 of 129 remaining) [2025-02-08 05:39:34,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (107 of 129 remaining) [2025-02-08 05:39:34,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (106 of 129 remaining) [2025-02-08 05:39:34,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (105 of 129 remaining) [2025-02-08 05:39:34,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (104 of 129 remaining) [2025-02-08 05:39:34,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (103 of 129 remaining) [2025-02-08 05:39:34,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (102 of 129 remaining) [2025-02-08 05:39:34,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (101 of 129 remaining) [2025-02-08 05:39:34,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (100 of 129 remaining) [2025-02-08 05:39:34,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (99 of 129 remaining) [2025-02-08 05:39:34,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (98 of 129 remaining) [2025-02-08 05:39:34,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (97 of 129 remaining) [2025-02-08 05:39:34,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (96 of 129 remaining) [2025-02-08 05:39:34,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (95 of 129 remaining) [2025-02-08 05:39:34,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (94 of 129 remaining) [2025-02-08 05:39:34,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (93 of 129 remaining) [2025-02-08 05:39:34,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (92 of 129 remaining) [2025-02-08 05:39:34,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (91 of 129 remaining) [2025-02-08 05:39:34,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (90 of 129 remaining) [2025-02-08 05:39:34,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (89 of 129 remaining) [2025-02-08 05:39:34,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (88 of 129 remaining) [2025-02-08 05:39:34,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (87 of 129 remaining) [2025-02-08 05:39:34,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (86 of 129 remaining) [2025-02-08 05:39:34,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (85 of 129 remaining) [2025-02-08 05:39:34,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (84 of 129 remaining) [2025-02-08 05:39:34,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (83 of 129 remaining) [2025-02-08 05:39:34,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (82 of 129 remaining) [2025-02-08 05:39:34,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (81 of 129 remaining) [2025-02-08 05:39:34,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (80 of 129 remaining) [2025-02-08 05:39:34,661 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (79 of 129 remaining) [2025-02-08 05:39:34,661 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (78 of 129 remaining) [2025-02-08 05:39:34,661 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err12ASSERT_VIOLATIONDATA_RACE (77 of 129 remaining) [2025-02-08 05:39:34,661 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err11ASSERT_VIOLATIONDATA_RACE (76 of 129 remaining) [2025-02-08 05:39:34,661 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err10ASSERT_VIOLATIONDATA_RACE (75 of 129 remaining) [2025-02-08 05:39:34,661 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err9ASSERT_VIOLATIONDATA_RACE (74 of 129 remaining) [2025-02-08 05:39:34,661 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err8ASSERT_VIOLATIONDATA_RACE (73 of 129 remaining) [2025-02-08 05:39:34,661 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err7ASSERT_VIOLATIONDATA_RACE (72 of 129 remaining) [2025-02-08 05:39:34,661 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err6ASSERT_VIOLATIONDATA_RACE (71 of 129 remaining) [2025-02-08 05:39:34,661 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err5ASSERT_VIOLATIONDATA_RACE (70 of 129 remaining) [2025-02-08 05:39:34,661 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (69 of 129 remaining) [2025-02-08 05:39:34,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (68 of 129 remaining) [2025-02-08 05:39:34,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (67 of 129 remaining) [2025-02-08 05:39:34,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (66 of 129 remaining) [2025-02-08 05:39:34,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err12ASSERT_VIOLATIONDATA_RACE (65 of 129 remaining) [2025-02-08 05:39:34,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err11ASSERT_VIOLATIONDATA_RACE (64 of 129 remaining) [2025-02-08 05:39:34,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err10ASSERT_VIOLATIONDATA_RACE (63 of 129 remaining) [2025-02-08 05:39:34,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err9ASSERT_VIOLATIONDATA_RACE (62 of 129 remaining) [2025-02-08 05:39:34,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err8ASSERT_VIOLATIONDATA_RACE (61 of 129 remaining) [2025-02-08 05:39:34,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err7ASSERT_VIOLATIONDATA_RACE (60 of 129 remaining) [2025-02-08 05:39:34,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err6ASSERT_VIOLATIONDATA_RACE (59 of 129 remaining) [2025-02-08 05:39:34,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err5ASSERT_VIOLATIONDATA_RACE (58 of 129 remaining) [2025-02-08 05:39:34,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (57 of 129 remaining) [2025-02-08 05:39:34,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (56 of 129 remaining) [2025-02-08 05:39:34,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (55 of 129 remaining) [2025-02-08 05:39:34,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (54 of 129 remaining) [2025-02-08 05:39:34,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork5Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (53 of 129 remaining) [2025-02-08 05:39:34,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork5Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (52 of 129 remaining) [2025-02-08 05:39:34,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (51 of 129 remaining) [2025-02-08 05:39:34,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (50 of 129 remaining) [2025-02-08 05:39:34,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (49 of 129 remaining) [2025-02-08 05:39:34,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (48 of 129 remaining) [2025-02-08 05:39:34,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (47 of 129 remaining) [2025-02-08 05:39:34,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (46 of 129 remaining) [2025-02-08 05:39:34,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (45 of 129 remaining) [2025-02-08 05:39:34,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (44 of 129 remaining) [2025-02-08 05:39:34,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (43 of 129 remaining) [2025-02-08 05:39:34,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (42 of 129 remaining) [2025-02-08 05:39:34,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (41 of 129 remaining) [2025-02-08 05:39:34,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (40 of 129 remaining) [2025-02-08 05:39:34,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (39 of 129 remaining) [2025-02-08 05:39:34,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (38 of 129 remaining) [2025-02-08 05:39:34,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (37 of 129 remaining) [2025-02-08 05:39:34,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (36 of 129 remaining) [2025-02-08 05:39:34,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (35 of 129 remaining) [2025-02-08 05:39:34,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (34 of 129 remaining) [2025-02-08 05:39:34,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (33 of 129 remaining) [2025-02-08 05:39:34,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (32 of 129 remaining) [2025-02-08 05:39:34,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (31 of 129 remaining) [2025-02-08 05:39:34,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (30 of 129 remaining) [2025-02-08 05:39:34,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (29 of 129 remaining) [2025-02-08 05:39:34,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (28 of 129 remaining) [2025-02-08 05:39:34,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (27 of 129 remaining) [2025-02-08 05:39:34,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (26 of 129 remaining) [2025-02-08 05:39:34,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork2Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 129 remaining) [2025-02-08 05:39:34,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork2Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 129 remaining) [2025-02-08 05:39:34,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (23 of 129 remaining) [2025-02-08 05:39:34,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (22 of 129 remaining) [2025-02-08 05:39:34,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err12ASSERT_VIOLATIONDATA_RACE (21 of 129 remaining) [2025-02-08 05:39:34,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err11ASSERT_VIOLATIONDATA_RACE (20 of 129 remaining) [2025-02-08 05:39:34,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err10ASSERT_VIOLATIONDATA_RACE (19 of 129 remaining) [2025-02-08 05:39:34,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err9ASSERT_VIOLATIONDATA_RACE (18 of 129 remaining) [2025-02-08 05:39:34,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err8ASSERT_VIOLATIONDATA_RACE (17 of 129 remaining) [2025-02-08 05:39:34,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err7ASSERT_VIOLATIONDATA_RACE (16 of 129 remaining) [2025-02-08 05:39:34,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err6ASSERT_VIOLATIONDATA_RACE (15 of 129 remaining) [2025-02-08 05:39:34,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err5ASSERT_VIOLATIONDATA_RACE (14 of 129 remaining) [2025-02-08 05:39:34,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (13 of 129 remaining) [2025-02-08 05:39:34,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (12 of 129 remaining) [2025-02-08 05:39:34,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (11 of 129 remaining) [2025-02-08 05:39:34,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (10 of 129 remaining) [2025-02-08 05:39:34,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err12ASSERT_VIOLATIONDATA_RACE (9 of 129 remaining) [2025-02-08 05:39:34,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err11ASSERT_VIOLATIONDATA_RACE (8 of 129 remaining) [2025-02-08 05:39:34,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err10ASSERT_VIOLATIONDATA_RACE (7 of 129 remaining) [2025-02-08 05:39:34,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err9ASSERT_VIOLATIONDATA_RACE (6 of 129 remaining) [2025-02-08 05:39:34,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err8ASSERT_VIOLATIONDATA_RACE (5 of 129 remaining) [2025-02-08 05:39:34,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err7ASSERT_VIOLATIONDATA_RACE (4 of 129 remaining) [2025-02-08 05:39:34,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err6ASSERT_VIOLATIONDATA_RACE (3 of 129 remaining) [2025-02-08 05:39:34,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err5ASSERT_VIOLATIONDATA_RACE (2 of 129 remaining) [2025-02-08 05:39:34,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (1 of 129 remaining) [2025-02-08 05:39:34,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (0 of 129 remaining) [2025-02-08 05:39:34,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:39:34,667 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:34,673 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:39:34,673 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:39:34,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:39:34 BasicIcfg [2025-02-08 05:39:34,680 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:39:34,680 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:39:34,680 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:39:34,680 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:39:34,681 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:28" (3/4) ... [2025-02-08 05:39:34,683 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:39:34,685 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:39:34,685 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:39:34,685 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 05:39:34,685 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-02-08 05:39:34,685 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread5 [2025-02-08 05:39:34,685 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread6 [2025-02-08 05:39:34,691 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-02-08 05:39:34,691 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:39:34,692 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:39:34,692 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:39:34,775 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:39:34,775 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:39:34,775 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:39:34,776 INFO L158 Benchmark]: Toolchain (without parser) took 8027.22ms. Allocated memory was 142.6MB in the beginning and 536.9MB in the end (delta: 394.3MB). Free memory was 112.3MB in the beginning and 343.6MB in the end (delta: -231.3MB). Peak memory consumption was 162.4MB. Max. memory is 16.1GB. [2025-02-08 05:39:34,776 INFO L158 Benchmark]: CDTParser took 0.52ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:39:34,776 INFO L158 Benchmark]: CACSL2BoogieTranslator took 308.81ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 98.2MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:39:34,776 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.72ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 95.1MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:39:34,777 INFO L158 Benchmark]: Boogie Preprocessor took 61.04ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 92.4MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:39:34,777 INFO L158 Benchmark]: IcfgBuilder took 1253.26ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 54.8MB in the end (delta: 37.6MB). Peak memory consumption was 65.8MB. Max. memory is 16.1GB. [2025-02-08 05:39:34,777 INFO L158 Benchmark]: TraceAbstraction took 6233.78ms. Allocated memory was 142.6MB in the beginning and 536.9MB in the end (delta: 394.3MB). Free memory was 54.1MB in the beginning and 352.0MB in the end (delta: -297.9MB). Peak memory consumption was 96.5MB. Max. memory is 16.1GB. [2025-02-08 05:39:34,777 INFO L158 Benchmark]: Witness Printer took 94.79ms. Allocated memory is still 536.9MB. Free memory was 352.0MB in the beginning and 343.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:39:34,782 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.52ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 308.81ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 98.2MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.72ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 95.1MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 61.04ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 92.4MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1253.26ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 54.8MB in the end (delta: 37.6MB). Peak memory consumption was 65.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6233.78ms. Allocated memory was 142.6MB in the beginning and 536.9MB in the end (delta: 394.3MB). Free memory was 54.1MB in the beginning and 352.0MB in the end (delta: -297.9MB). Peak memory consumption was 96.5MB. Max. memory is 16.1GB. * Witness Printer took 94.79ms. Allocated memory is still 536.9MB. Free memory was 352.0MB in the beginning and 343.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: 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: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: 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: 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: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: 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: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 158]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 159]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 160]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 161]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 162]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 163]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 164]: 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: 185]: 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: 173]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 173]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: 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: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 122]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 122]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 122]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 122]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 125]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 125]: 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, 502 locations, 129 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: 6.0s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 188 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 63 mSDsluCounter, 49 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 835 IncrementalHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 49 mSDtfsCounter, 835 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=718occurred in iteration=0, InterpolantAutomatonStates: 45, 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.3s InterpolantComputationTime, 1326 NumberOfCodeBlocks, 1326 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1312 ConstructedInterpolants, 0 QuantifiedInterpolants, 1453 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 71 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:39:34,801 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