./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-collitem-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-collitem-symm.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 631177edb7ca950f3594c5b6eaac98148a00ee69e6a0cd62c1c95947fa56259c --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:37:24,279 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:37:24,335 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:37:24,338 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:37:24,338 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:37:24,352 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:37:24,353 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:37:24,353 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:37:24,353 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:37:24,354 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:37:24,354 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:37:24,354 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:37:24,354 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:37:24,354 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:37:24,354 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:37:24,354 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:37:24,354 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:37:24,354 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:37:24,355 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:37:24,355 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:37:24,355 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:37:24,355 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:37:24,355 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:37:24,355 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:37:24,355 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:37:24,355 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:37:24,355 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:37:24,355 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:37:24,355 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:37:24,356 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:37:24,356 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:37:24,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:37:24,356 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:37:24,356 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:37:24,356 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:37:24,356 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:37:24,356 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:37:24,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:37:24,356 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:37:24,356 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:37:24,356 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:37:24,356 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:37:24,356 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 -> 631177edb7ca950f3594c5b6eaac98148a00ee69e6a0cd62c1c95947fa56259c [2025-02-08 05:37:24,555 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:37:24,564 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:37:24,566 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:37:24,567 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:37:24,568 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:37:24,569 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-collitem-symm.wvr.c [2025-02-08 05:37:25,740 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5697696e3/e75fca33e28343c987b58711ccfbcc68/FLAGb87c84da7 [2025-02-08 05:37:25,995 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:37:25,997 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-collitem-symm.wvr.c [2025-02-08 05:37:26,003 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5697696e3/e75fca33e28343c987b58711ccfbcc68/FLAGb87c84da7 [2025-02-08 05:37:26,337 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5697696e3/e75fca33e28343c987b58711ccfbcc68 [2025-02-08 05:37:26,339 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:37:26,341 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:37:26,343 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:26,343 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:37:26,346 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:37:26,347 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:26" (1/1) ... [2025-02-08 05:37:26,349 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fc31da0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:26, skipping insertion in model container [2025-02-08 05:37:26,349 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:26" (1/1) ... [2025-02-08 05:37:26,362 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:37:26,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:26,498 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:37:26,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:26,536 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:37:26,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:26 WrapperNode [2025-02-08 05:37:26,537 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:26,537 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:26,537 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:37:26,537 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:37:26,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:26" (1/1) ... [2025-02-08 05:37:26,548 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:26" (1/1) ... [2025-02-08 05:37:26,575 INFO L138 Inliner]: procedures = 21, calls = 26, calls flagged for inlining = 16, calls inlined = 30, statements flattened = 405 [2025-02-08 05:37:26,576 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:26,577 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:37:26,577 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:37:26,577 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:37:26,582 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:26" (1/1) ... [2025-02-08 05:37:26,582 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:26" (1/1) ... [2025-02-08 05:37:26,588 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:26" (1/1) ... [2025-02-08 05:37:26,588 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:26" (1/1) ... [2025-02-08 05:37:26,597 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:26" (1/1) ... [2025-02-08 05:37:26,601 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:26" (1/1) ... [2025-02-08 05:37:26,602 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:26" (1/1) ... [2025-02-08 05:37:26,607 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:26" (1/1) ... [2025-02-08 05:37:26,609 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:37:26,610 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:37:26,610 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:37:26,610 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:37:26,611 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:26" (1/1) ... [2025-02-08 05:37:26,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:37:26,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:37:26,647 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:37:26,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:37:26,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:37:26,682 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:37:26,682 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:37:26,682 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:37:26,683 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:37:26,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:37:26,683 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 05:37:26,683 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 05:37:26,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:37:26,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:37:26,684 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:37:26,783 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:37:26,785 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:37:26,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L45-7: #t~ite4#1 := #t~ret3#1; [2025-02-08 05:37:26,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L45-8: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret3#1 && #t~ret3#1 <= 2147483647; [2025-02-08 05:37:26,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L45-9: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:26,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L45-10: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:26,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L45-11: #t~ret3#1 := minus_#res#1; [2025-02-08 05:37:26,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-7: #t~ite7#1 := #t~ret6#1; [2025-02-08 05:37:26,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-8: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647; [2025-02-08 05:37:26,947 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-9: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:26,947 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-10: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:26,947 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-11: #t~ret6#1 := minus_#res#1; [2025-02-08 05:37:26,947 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-7: #t~ite10#1 := #t~ret9#1; [2025-02-08 05:37:26,947 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-8: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647; [2025-02-08 05:37:26,947 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-9: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:26,947 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-10: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:26,947 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-11: #t~ret9#1 := minus_#res#1; [2025-02-08 05:37:27,083 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-7: #t~ite15#1 := #t~ret14#1; [2025-02-08 05:37:27,083 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-8: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret14#1 && #t~ret14#1 <= 2147483647; [2025-02-08 05:37:27,083 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-9: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:27,083 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-10: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:27,083 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-11: #t~ret14#1 := minus_#res#1; [2025-02-08 05:37:27,084 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L57-7: #t~ite18#1 := #t~ret17#1; [2025-02-08 05:37:27,084 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L57-8: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret17#1 && #t~ret17#1 <= 2147483647; [2025-02-08 05:37:27,084 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L57-9: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:27,084 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L57-10: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:27,085 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L57-11: #t~ret17#1 := minus_#res#1; [2025-02-08 05:37:27,085 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-7: #t~ite21#1 := #t~ret20#1; [2025-02-08 05:37:27,085 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-8: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret20#1 && #t~ret20#1 <= 2147483647; [2025-02-08 05:37:27,085 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-9: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:27,085 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-10: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:27,085 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-11: #t~ret20#1 := minus_#res#1; [2025-02-08 05:37:27,220 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:37:27,220 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:37:27,473 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L95-2 is not an error location. [2025-02-08 05:37:27,473 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L95-1 is not an error location. [2025-02-08 05:37:27,473 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L95 is not an error location. [2025-02-08 05:37:27,473 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L95-2 is not an error location. [2025-02-08 05:37:27,473 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L95-1 is not an error location. [2025-02-08 05:37:27,473 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L95 is not an error location. [2025-02-08 05:37:27,474 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:37:27,474 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:37:27,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:27 BoogieIcfgContainer [2025-02-08 05:37:27,474 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:37:27,476 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:37:27,476 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:37:27,479 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:37:27,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:37:26" (1/3) ... [2025-02-08 05:37:27,479 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@615eede9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:27, skipping insertion in model container [2025-02-08 05:37:27,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:26" (2/3) ... [2025-02-08 05:37:27,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@615eede9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:27, skipping insertion in model container [2025-02-08 05:37:27,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:27" (3/3) ... [2025-02-08 05:37:27,480 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-collitem-symm.wvr.c [2025-02-08 05:37:27,491 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:37:27,492 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-collitem-symm.wvr.c that has 3 procedures, 236 locations, 1 initial locations, 0 loop locations, and 52 error locations. [2025-02-08 05:37:27,492 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:37:27,541 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:37:27,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 242 places, 241 transitions, 496 flow [2025-02-08 05:37:27,613 INFO L124 PetriNetUnfolderBase]: 6/239 cut-off events. [2025-02-08 05:37:27,614 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:37:27,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 239 events. 6/239 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 347 event pairs, 0 based on Foata normal form. 0/175 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place. [2025-02-08 05:37:27,618 INFO L82 GeneralOperation]: Start removeDead. Operand has 242 places, 241 transitions, 496 flow [2025-02-08 05:37:27,647 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 222 places, 219 transitions, 450 flow [2025-02-08 05:37:27,656 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:37:27,673 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;@3797c385, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:37:27,674 INFO L334 AbstractCegarLoop]: Starting to check reachability of 90 error locations. [2025-02-08 05:37:27,678 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:37:27,678 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-02-08 05:37:27,678 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:37:27,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:27,679 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:27,679 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2025-02-08 05:37:27,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:27,683 INFO L85 PathProgramCache]: Analyzing trace with hash 203421670, now seen corresponding path program 1 times [2025-02-08 05:37:27,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:27,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538597818] [2025-02-08 05:37:27,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:27,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:27,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 05:37:27,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 05:37:27,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:27,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:27,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:27,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:27,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538597818] [2025-02-08 05:37:27,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538597818] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:27,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:27,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:27,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350316118] [2025-02-08 05:37:27,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:27,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:27,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:27,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:27,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:27,855 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 241 [2025-02-08 05:37:27,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 219 transitions, 450 flow. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:27,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:27,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 241 [2025-02-08 05:37:27,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:27,924 INFO L124 PetriNetUnfolderBase]: 10/198 cut-off events. [2025-02-08 05:37:27,924 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-02-08 05:37:27,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 198 events. 10/198 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 149 event pairs, 8 based on Foata normal form. 2/172 useless extension candidates. Maximal degree in co-relation 59. Up to 28 conditions per place. [2025-02-08 05:37:27,926 INFO L140 encePairwiseOnDemand]: 196/241 looper letters, 9 selfloop transitions, 2 changer transitions 4/176 dead transitions. [2025-02-08 05:37:27,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 176 transitions, 390 flow [2025-02-08 05:37:27,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:27,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:27,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 602 transitions. [2025-02-08 05:37:27,935 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8326417704011065 [2025-02-08 05:37:27,936 INFO L175 Difference]: Start difference. First operand has 222 places, 219 transitions, 450 flow. Second operand 3 states and 602 transitions. [2025-02-08 05:37:27,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 176 transitions, 390 flow [2025-02-08 05:37:27,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 176 transitions, 382 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:37:27,942 INFO L231 Difference]: Finished difference. Result has 179 places, 172 transitions, 352 flow [2025-02-08 05:37:27,944 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=352, PETRI_PLACES=179, PETRI_TRANSITIONS=172} [2025-02-08 05:37:27,946 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, -43 predicate places. [2025-02-08 05:37:27,946 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 172 transitions, 352 flow [2025-02-08 05:37:27,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:27,946 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:27,946 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:27,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:37:27,947 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2025-02-08 05:37:27,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:27,947 INFO L85 PathProgramCache]: Analyzing trace with hash 804438969, now seen corresponding path program 1 times [2025-02-08 05:37:27,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:27,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736826612] [2025-02-08 05:37:27,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:27,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:27,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 05:37:27,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 05:37:27,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:27,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:27,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:27,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:27,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736826612] [2025-02-08 05:37:27,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736826612] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:27,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:27,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:27,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194788541] [2025-02-08 05:37:27,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:27,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:27,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:27,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:27,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:27,988 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 241 [2025-02-08 05:37:27,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 172 transitions, 352 flow. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:27,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:27,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 241 [2025-02-08 05:37:27,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:28,014 INFO L124 PetriNetUnfolderBase]: 5/181 cut-off events. [2025-02-08 05:37:28,014 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:37:28,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 181 events. 5/181 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 3 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 172. Up to 16 conditions per place. [2025-02-08 05:37:28,015 INFO L140 encePairwiseOnDemand]: 238/241 looper letters, 9 selfloop transitions, 2 changer transitions 0/171 dead transitions. [2025-02-08 05:37:28,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 171 transitions, 372 flow [2025-02-08 05:37:28,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:28,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:28,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 558 transitions. [2025-02-08 05:37:28,019 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7717842323651453 [2025-02-08 05:37:28,020 INFO L175 Difference]: Start difference. First operand has 179 places, 172 transitions, 352 flow. Second operand 3 states and 558 transitions. [2025-02-08 05:37:28,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 171 transitions, 372 flow [2025-02-08 05:37:28,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 171 transitions, 368 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:28,022 INFO L231 Difference]: Finished difference. Result has 174 places, 171 transitions, 350 flow [2025-02-08 05:37:28,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=350, PETRI_PLACES=174, PETRI_TRANSITIONS=171} [2025-02-08 05:37:28,023 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, -48 predicate places. [2025-02-08 05:37:28,023 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 171 transitions, 350 flow [2025-02-08 05:37:28,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:28,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:28,024 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:28,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:37:28,024 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2025-02-08 05:37:28,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:28,024 INFO L85 PathProgramCache]: Analyzing trace with hash -736310549, now seen corresponding path program 1 times [2025-02-08 05:37:28,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:28,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789601198] [2025-02-08 05:37:28,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:28,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:28,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 05:37:28,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 05:37:28,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:28,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:28,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:28,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:28,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789601198] [2025-02-08 05:37:28,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789601198] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:28,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:28,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:28,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471173802] [2025-02-08 05:37:28,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:28,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:28,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:28,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:28,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:28,068 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 241 [2025-02-08 05:37:28,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 171 transitions, 350 flow. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:28,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:28,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 241 [2025-02-08 05:37:28,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:28,094 INFO L124 PetriNetUnfolderBase]: 5/180 cut-off events. [2025-02-08 05:37:28,094 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:37:28,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 180 events. 5/180 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 3 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 163. Up to 16 conditions per place. [2025-02-08 05:37:28,095 INFO L140 encePairwiseOnDemand]: 238/241 looper letters, 9 selfloop transitions, 2 changer transitions 0/170 dead transitions. [2025-02-08 05:37:28,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 170 transitions, 370 flow [2025-02-08 05:37:28,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:28,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:28,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 558 transitions. [2025-02-08 05:37:28,097 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7717842323651453 [2025-02-08 05:37:28,097 INFO L175 Difference]: Start difference. First operand has 174 places, 171 transitions, 350 flow. Second operand 3 states and 558 transitions. [2025-02-08 05:37:28,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 170 transitions, 370 flow [2025-02-08 05:37:28,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 170 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:28,100 INFO L231 Difference]: Finished difference. Result has 173 places, 170 transitions, 348 flow [2025-02-08 05:37:28,100 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=348, PETRI_PLACES=173, PETRI_TRANSITIONS=170} [2025-02-08 05:37:28,101 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, -49 predicate places. [2025-02-08 05:37:28,101 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 170 transitions, 348 flow [2025-02-08 05:37:28,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:28,101 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:28,101 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:28,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:37:28,102 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2025-02-08 05:37:28,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:28,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1527699744, now seen corresponding path program 1 times [2025-02-08 05:37:28,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:28,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687305267] [2025-02-08 05:37:28,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:28,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:28,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 05:37:28,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 05:37:28,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:28,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:28,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:28,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:28,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687305267] [2025-02-08 05:37:28,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687305267] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:28,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:28,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:28,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38189665] [2025-02-08 05:37:28,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:28,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:28,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:28,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:28,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:28,173 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 241 [2025-02-08 05:37:28,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 170 transitions, 348 flow. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:28,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:28,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 241 [2025-02-08 05:37:28,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:28,206 INFO L124 PetriNetUnfolderBase]: 5/179 cut-off events. [2025-02-08 05:37:28,206 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:37:28,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 179 events. 5/179 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 3 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 154. Up to 16 conditions per place. [2025-02-08 05:37:28,207 INFO L140 encePairwiseOnDemand]: 238/241 looper letters, 9 selfloop transitions, 2 changer transitions 0/169 dead transitions. [2025-02-08 05:37:28,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 169 transitions, 368 flow [2025-02-08 05:37:28,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:28,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:28,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 558 transitions. [2025-02-08 05:37:28,211 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7717842323651453 [2025-02-08 05:37:28,211 INFO L175 Difference]: Start difference. First operand has 173 places, 170 transitions, 348 flow. Second operand 3 states and 558 transitions. [2025-02-08 05:37:28,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 169 transitions, 368 flow [2025-02-08 05:37:28,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 169 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:28,215 INFO L231 Difference]: Finished difference. Result has 172 places, 169 transitions, 346 flow [2025-02-08 05:37:28,215 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=346, PETRI_PLACES=172, PETRI_TRANSITIONS=169} [2025-02-08 05:37:28,216 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, -50 predicate places. [2025-02-08 05:37:28,216 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 169 transitions, 346 flow [2025-02-08 05:37:28,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:28,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:28,216 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:28,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:37:28,216 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2025-02-08 05:37:28,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:28,217 INFO L85 PathProgramCache]: Analyzing trace with hash -851131468, now seen corresponding path program 1 times [2025-02-08 05:37:28,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:28,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784091821] [2025-02-08 05:37:28,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:28,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:28,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-08 05:37:28,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-08 05:37:28,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:28,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:28,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:28,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:28,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784091821] [2025-02-08 05:37:28,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784091821] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:28,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:28,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:28,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729547687] [2025-02-08 05:37:28,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:28,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:28,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:28,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:28,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:28,274 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 241 [2025-02-08 05:37:28,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 169 transitions, 346 flow. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:28,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:28,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 241 [2025-02-08 05:37:28,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:28,303 INFO L124 PetriNetUnfolderBase]: 5/178 cut-off events. [2025-02-08 05:37:28,303 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:37:28,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 178 events. 5/178 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 73 event pairs, 3 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 145. Up to 16 conditions per place. [2025-02-08 05:37:28,303 INFO L140 encePairwiseOnDemand]: 238/241 looper letters, 9 selfloop transitions, 2 changer transitions 0/168 dead transitions. [2025-02-08 05:37:28,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 168 transitions, 366 flow [2025-02-08 05:37:28,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:28,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:28,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 558 transitions. [2025-02-08 05:37:28,305 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7717842323651453 [2025-02-08 05:37:28,305 INFO L175 Difference]: Start difference. First operand has 172 places, 169 transitions, 346 flow. Second operand 3 states and 558 transitions. [2025-02-08 05:37:28,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 168 transitions, 366 flow [2025-02-08 05:37:28,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 168 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:28,307 INFO L231 Difference]: Finished difference. Result has 171 places, 168 transitions, 344 flow [2025-02-08 05:37:28,307 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=171, PETRI_TRANSITIONS=168} [2025-02-08 05:37:28,308 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, -51 predicate places. [2025-02-08 05:37:28,308 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 168 transitions, 344 flow [2025-02-08 05:37:28,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:28,308 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:28,308 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:28,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:37:28,308 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2025-02-08 05:37:28,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:28,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1204456816, now seen corresponding path program 1 times [2025-02-08 05:37:28,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:28,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954844345] [2025-02-08 05:37:28,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:28,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:28,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-08 05:37:28,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 05:37:28,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:28,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:28,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:28,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:28,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954844345] [2025-02-08 05:37:28,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954844345] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:28,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:28,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:28,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054438400] [2025-02-08 05:37:28,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:28,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:28,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:28,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:28,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:28,378 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 241 [2025-02-08 05:37:28,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 168 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:28,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:28,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 241 [2025-02-08 05:37:28,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:28,408 INFO L124 PetriNetUnfolderBase]: 5/177 cut-off events. [2025-02-08 05:37:28,408 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:37:28,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 177 events. 5/177 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 3 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 136. Up to 16 conditions per place. [2025-02-08 05:37:28,409 INFO L140 encePairwiseOnDemand]: 238/241 looper letters, 9 selfloop transitions, 2 changer transitions 0/167 dead transitions. [2025-02-08 05:37:28,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 167 transitions, 364 flow [2025-02-08 05:37:28,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:28,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:28,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 558 transitions. [2025-02-08 05:37:28,411 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7717842323651453 [2025-02-08 05:37:28,411 INFO L175 Difference]: Start difference. First operand has 171 places, 168 transitions, 344 flow. Second operand 3 states and 558 transitions. [2025-02-08 05:37:28,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 167 transitions, 364 flow [2025-02-08 05:37:28,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 167 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:28,413 INFO L231 Difference]: Finished difference. Result has 170 places, 167 transitions, 342 flow [2025-02-08 05:37:28,414 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=342, PETRI_PLACES=170, PETRI_TRANSITIONS=167} [2025-02-08 05:37:28,415 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, -52 predicate places. [2025-02-08 05:37:28,415 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 167 transitions, 342 flow [2025-02-08 05:37:28,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:28,415 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:28,415 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:37:28,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:37:28,416 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2025-02-08 05:37:28,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:28,416 INFO L85 PathProgramCache]: Analyzing trace with hash 263056653, now seen corresponding path program 1 times [2025-02-08 05:37:28,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:28,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631493047] [2025-02-08 05:37:28,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:28,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:28,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 05:37:28,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 05:37:28,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:28,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:28,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:28,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:28,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631493047] [2025-02-08 05:37:28,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631493047] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:28,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:28,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:28,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934853953] [2025-02-08 05:37:28,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:28,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:28,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:28,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:28,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:28,469 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 241 [2025-02-08 05:37:28,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 167 transitions, 342 flow. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:28,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:28,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 241 [2025-02-08 05:37:28,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:28,495 INFO L124 PetriNetUnfolderBase]: 5/176 cut-off events. [2025-02-08 05:37:28,495 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:37:28,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 176 events. 5/176 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 3 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 127. Up to 16 conditions per place. [2025-02-08 05:37:28,496 INFO L140 encePairwiseOnDemand]: 238/241 looper letters, 9 selfloop transitions, 2 changer transitions 0/166 dead transitions. [2025-02-08 05:37:28,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 166 transitions, 362 flow [2025-02-08 05:37:28,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:28,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:28,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 558 transitions. [2025-02-08 05:37:28,498 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7717842323651453 [2025-02-08 05:37:28,498 INFO L175 Difference]: Start difference. First operand has 170 places, 167 transitions, 342 flow. Second operand 3 states and 558 transitions. [2025-02-08 05:37:28,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 166 transitions, 362 flow [2025-02-08 05:37:28,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 166 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:28,502 INFO L231 Difference]: Finished difference. Result has 169 places, 166 transitions, 340 flow [2025-02-08 05:37:28,502 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=340, PETRI_PLACES=169, PETRI_TRANSITIONS=166} [2025-02-08 05:37:28,503 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, -53 predicate places. [2025-02-08 05:37:28,503 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 166 transitions, 340 flow [2025-02-08 05:37:28,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:28,503 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:28,504 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:28,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:37:28,504 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2025-02-08 05:37:28,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:28,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1136717713, now seen corresponding path program 1 times [2025-02-08 05:37:28,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:28,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460622045] [2025-02-08 05:37:28,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:28,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:28,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-08 05:37:28,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-08 05:37:28,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:28,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:28,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:28,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:28,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460622045] [2025-02-08 05:37:28,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460622045] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:28,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:28,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:28,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617638979] [2025-02-08 05:37:28,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:28,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:28,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:28,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:28,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:28,569 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 241 [2025-02-08 05:37:28,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 166 transitions, 340 flow. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:28,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:28,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 241 [2025-02-08 05:37:28,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:28,590 INFO L124 PetriNetUnfolderBase]: 5/175 cut-off events. [2025-02-08 05:37:28,590 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:37:28,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 175 events. 5/175 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 3 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 118. Up to 16 conditions per place. [2025-02-08 05:37:28,590 INFO L140 encePairwiseOnDemand]: 238/241 looper letters, 9 selfloop transitions, 2 changer transitions 0/165 dead transitions. [2025-02-08 05:37:28,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 165 transitions, 360 flow [2025-02-08 05:37:28,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:28,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:28,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 558 transitions. [2025-02-08 05:37:28,610 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7717842323651453 [2025-02-08 05:37:28,610 INFO L175 Difference]: Start difference. First operand has 169 places, 166 transitions, 340 flow. Second operand 3 states and 558 transitions. [2025-02-08 05:37:28,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 165 transitions, 360 flow [2025-02-08 05:37:28,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 165 transitions, 356 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:28,612 INFO L231 Difference]: Finished difference. Result has 168 places, 165 transitions, 338 flow [2025-02-08 05:37:28,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=338, PETRI_PLACES=168, PETRI_TRANSITIONS=165} [2025-02-08 05:37:28,613 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, -54 predicate places. [2025-02-08 05:37:28,613 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 165 transitions, 338 flow [2025-02-08 05:37:28,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:28,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:28,614 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:28,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:37:28,614 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2025-02-08 05:37:28,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:28,614 INFO L85 PathProgramCache]: Analyzing trace with hash -391242198, now seen corresponding path program 1 times [2025-02-08 05:37:28,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:28,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072977912] [2025-02-08 05:37:28,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:28,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:28,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-08 05:37:28,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-08 05:37:28,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:28,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:28,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:28,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:28,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072977912] [2025-02-08 05:37:28,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072977912] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:28,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:28,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:28,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744563306] [2025-02-08 05:37:28,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:28,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:28,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:28,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:28,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:28,709 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 241 [2025-02-08 05:37:28,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 165 transitions, 338 flow. Second operand has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:28,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:28,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 241 [2025-02-08 05:37:28,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:28,747 INFO L124 PetriNetUnfolderBase]: 5/174 cut-off events. [2025-02-08 05:37:28,747 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:37:28,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 174 events. 5/174 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 3 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 112. Up to 19 conditions per place. [2025-02-08 05:37:28,748 INFO L140 encePairwiseOnDemand]: 238/241 looper letters, 12 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2025-02-08 05:37:28,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 164 transitions, 364 flow [2025-02-08 05:37:28,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:28,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:28,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 552 transitions. [2025-02-08 05:37:28,749 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7634854771784232 [2025-02-08 05:37:28,749 INFO L175 Difference]: Start difference. First operand has 168 places, 165 transitions, 338 flow. Second operand 3 states and 552 transitions. [2025-02-08 05:37:28,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 164 transitions, 364 flow [2025-02-08 05:37:28,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 164 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:28,751 INFO L231 Difference]: Finished difference. Result has 167 places, 164 transitions, 336 flow [2025-02-08 05:37:28,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=167, PETRI_TRANSITIONS=164} [2025-02-08 05:37:28,752 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, -55 predicate places. [2025-02-08 05:37:28,753 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 164 transitions, 336 flow [2025-02-08 05:37:28,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:28,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:28,753 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] [2025-02-08 05:37:28,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:37:28,753 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2025-02-08 05:37:28,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:28,754 INFO L85 PathProgramCache]: Analyzing trace with hash 730739856, now seen corresponding path program 1 times [2025-02-08 05:37:28,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:28,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806831479] [2025-02-08 05:37:28,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:28,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:28,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 05:37:28,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 05:37:28,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:28,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:28,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:28,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:28,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806831479] [2025-02-08 05:37:28,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806831479] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:28,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:28,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:28,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373726603] [2025-02-08 05:37:28,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:28,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:28,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:28,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:28,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:28,815 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 241 [2025-02-08 05:37:28,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 164 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:28,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:28,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 241 [2025-02-08 05:37:28,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:28,842 INFO L124 PetriNetUnfolderBase]: 5/173 cut-off events. [2025-02-08 05:37:28,842 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:37:28,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 173 events. 5/173 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 3 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 103. Up to 19 conditions per place. [2025-02-08 05:37:28,843 INFO L140 encePairwiseOnDemand]: 238/241 looper letters, 12 selfloop transitions, 2 changer transitions 0/163 dead transitions. [2025-02-08 05:37:28,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 163 transitions, 362 flow [2025-02-08 05:37:28,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:28,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:28,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 552 transitions. [2025-02-08 05:37:28,847 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7634854771784232 [2025-02-08 05:37:28,847 INFO L175 Difference]: Start difference. First operand has 167 places, 164 transitions, 336 flow. Second operand 3 states and 552 transitions. [2025-02-08 05:37:28,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 163 transitions, 362 flow [2025-02-08 05:37:28,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 163 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:28,849 INFO L231 Difference]: Finished difference. Result has 166 places, 163 transitions, 334 flow [2025-02-08 05:37:28,849 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=334, PETRI_PLACES=166, PETRI_TRANSITIONS=163} [2025-02-08 05:37:28,853 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, -56 predicate places. [2025-02-08 05:37:28,854 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 163 transitions, 334 flow [2025-02-08 05:37:28,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:28,854 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:28,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:28,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:37:28,854 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2025-02-08 05:37:28,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:28,855 INFO L85 PathProgramCache]: Analyzing trace with hash 639060119, now seen corresponding path program 1 times [2025-02-08 05:37:28,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:28,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519880246] [2025-02-08 05:37:28,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:28,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:28,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-08 05:37:28,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-08 05:37:28,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:28,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:28,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:28,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:28,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519880246] [2025-02-08 05:37:28,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519880246] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:28,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:28,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:28,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140972226] [2025-02-08 05:37:28,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:28,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:28,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:28,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:28,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:28,957 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 241 [2025-02-08 05:37:28,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 163 transitions, 334 flow. Second operand has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:28,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:28,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 241 [2025-02-08 05:37:28,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:28,985 INFO L124 PetriNetUnfolderBase]: 5/170 cut-off events. [2025-02-08 05:37:28,985 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:37:28,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 170 events. 5/170 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 3 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 91. Up to 14 conditions per place. [2025-02-08 05:37:28,986 INFO L140 encePairwiseOnDemand]: 237/241 looper letters, 12 selfloop transitions, 1 changer transitions 0/160 dead transitions. [2025-02-08 05:37:28,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 160 transitions, 354 flow [2025-02-08 05:37:28,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:28,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:28,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 553 transitions. [2025-02-08 05:37:28,988 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7648686030428768 [2025-02-08 05:37:28,988 INFO L175 Difference]: Start difference. First operand has 166 places, 163 transitions, 334 flow. Second operand 3 states and 553 transitions. [2025-02-08 05:37:28,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 160 transitions, 354 flow [2025-02-08 05:37:28,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 160 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:28,990 INFO L231 Difference]: Finished difference. Result has 163 places, 160 transitions, 326 flow [2025-02-08 05:37:28,990 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=326, PETRI_PLACES=163, PETRI_TRANSITIONS=160} [2025-02-08 05:37:28,990 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, -59 predicate places. [2025-02-08 05:37:28,992 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 160 transitions, 326 flow [2025-02-08 05:37:28,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:28,992 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:28,992 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] [2025-02-08 05:37:28,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:37:28,992 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2025-02-08 05:37:28,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:28,993 INFO L85 PathProgramCache]: Analyzing trace with hash -716307193, now seen corresponding path program 1 times [2025-02-08 05:37:28,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:28,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291558747] [2025-02-08 05:37:28,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:28,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:29,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-08 05:37:29,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-08 05:37:29,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:29,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:29,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:29,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:29,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291558747] [2025-02-08 05:37:29,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291558747] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:29,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:29,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:29,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281202881] [2025-02-08 05:37:29,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:29,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:29,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:29,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:29,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:29,074 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 241 [2025-02-08 05:37:29,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 160 transitions, 326 flow. Second operand has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:29,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:29,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 241 [2025-02-08 05:37:29,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:29,100 INFO L124 PetriNetUnfolderBase]: 6/192 cut-off events. [2025-02-08 05:37:29,100 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:37:29,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 192 events. 6/192 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 108 event pairs, 3 based on Foata normal form. 1/189 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2025-02-08 05:37:29,101 INFO L140 encePairwiseOnDemand]: 235/241 looper letters, 0 selfloop transitions, 0 changer transitions 159/159 dead transitions. [2025-02-08 05:37:29,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 159 transitions, 352 flow [2025-02-08 05:37:29,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:29,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:29,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 554 transitions. [2025-02-08 05:37:29,102 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7662517289073306 [2025-02-08 05:37:29,102 INFO L175 Difference]: Start difference. First operand has 163 places, 160 transitions, 326 flow. Second operand 3 states and 554 transitions. [2025-02-08 05:37:29,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 159 transitions, 352 flow [2025-02-08 05:37:29,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 159 transitions, 351 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:29,103 INFO L231 Difference]: Finished difference. Result has 161 places, 0 transitions, 0 flow [2025-02-08 05:37:29,104 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=161, PETRI_TRANSITIONS=0} [2025-02-08 05:37:29,104 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, -61 predicate places. [2025-02-08 05:37:29,104 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 0 transitions, 0 flow [2025-02-08 05:37:29,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:29,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (89 of 90 remaining) [2025-02-08 05:37:29,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (88 of 90 remaining) [2025-02-08 05:37:29,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (87 of 90 remaining) [2025-02-08 05:37:29,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (86 of 90 remaining) [2025-02-08 05:37:29,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (85 of 90 remaining) [2025-02-08 05:37:29,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (84 of 90 remaining) [2025-02-08 05:37:29,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (83 of 90 remaining) [2025-02-08 05:37:29,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (82 of 90 remaining) [2025-02-08 05:37:29,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (81 of 90 remaining) [2025-02-08 05:37:29,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (80 of 90 remaining) [2025-02-08 05:37:29,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (79 of 90 remaining) [2025-02-08 05:37:29,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (78 of 90 remaining) [2025-02-08 05:37:29,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (77 of 90 remaining) [2025-02-08 05:37:29,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (76 of 90 remaining) [2025-02-08 05:37:29,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (75 of 90 remaining) [2025-02-08 05:37:29,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (74 of 90 remaining) [2025-02-08 05:37:29,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (73 of 90 remaining) [2025-02-08 05:37:29,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (72 of 90 remaining) [2025-02-08 05:37:29,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (71 of 90 remaining) [2025-02-08 05:37:29,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (70 of 90 remaining) [2025-02-08 05:37:29,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (69 of 90 remaining) [2025-02-08 05:37:29,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (68 of 90 remaining) [2025-02-08 05:37:29,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (67 of 90 remaining) [2025-02-08 05:37:29,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (66 of 90 remaining) [2025-02-08 05:37:29,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (65 of 90 remaining) [2025-02-08 05:37:29,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (64 of 90 remaining) [2025-02-08 05:37:29,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (63 of 90 remaining) [2025-02-08 05:37:29,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (62 of 90 remaining) [2025-02-08 05:37:29,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (61 of 90 remaining) [2025-02-08 05:37:29,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (60 of 90 remaining) [2025-02-08 05:37:29,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (59 of 90 remaining) [2025-02-08 05:37:29,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (58 of 90 remaining) [2025-02-08 05:37:29,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (57 of 90 remaining) [2025-02-08 05:37:29,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (56 of 90 remaining) [2025-02-08 05:37:29,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (55 of 90 remaining) [2025-02-08 05:37:29,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (54 of 90 remaining) [2025-02-08 05:37:29,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (53 of 90 remaining) [2025-02-08 05:37:29,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (52 of 90 remaining) [2025-02-08 05:37:29,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (51 of 90 remaining) [2025-02-08 05:37:29,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (50 of 90 remaining) [2025-02-08 05:37:29,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (49 of 90 remaining) [2025-02-08 05:37:29,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (48 of 90 remaining) [2025-02-08 05:37:29,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (47 of 90 remaining) [2025-02-08 05:37:29,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (46 of 90 remaining) [2025-02-08 05:37:29,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (45 of 90 remaining) [2025-02-08 05:37:29,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (44 of 90 remaining) [2025-02-08 05:37:29,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (43 of 90 remaining) [2025-02-08 05:37:29,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (42 of 90 remaining) [2025-02-08 05:37:29,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (41 of 90 remaining) [2025-02-08 05:37:29,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (40 of 90 remaining) [2025-02-08 05:37:29,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (39 of 90 remaining) [2025-02-08 05:37:29,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (38 of 90 remaining) [2025-02-08 05:37:29,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 90 remaining) [2025-02-08 05:37:29,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 90 remaining) [2025-02-08 05:37:29,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (35 of 90 remaining) [2025-02-08 05:37:29,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (34 of 90 remaining) [2025-02-08 05:37:29,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (33 of 90 remaining) [2025-02-08 05:37:29,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (32 of 90 remaining) [2025-02-08 05:37:29,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (31 of 90 remaining) [2025-02-08 05:37:29,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (30 of 90 remaining) [2025-02-08 05:37:29,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (29 of 90 remaining) [2025-02-08 05:37:29,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (28 of 90 remaining) [2025-02-08 05:37:29,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (27 of 90 remaining) [2025-02-08 05:37:29,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (26 of 90 remaining) [2025-02-08 05:37:29,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (25 of 90 remaining) [2025-02-08 05:37:29,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (24 of 90 remaining) [2025-02-08 05:37:29,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (23 of 90 remaining) [2025-02-08 05:37:29,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (22 of 90 remaining) [2025-02-08 05:37:29,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (21 of 90 remaining) [2025-02-08 05:37:29,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (20 of 90 remaining) [2025-02-08 05:37:29,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (19 of 90 remaining) [2025-02-08 05:37:29,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (18 of 90 remaining) [2025-02-08 05:37:29,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (17 of 90 remaining) [2025-02-08 05:37:29,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (16 of 90 remaining) [2025-02-08 05:37:29,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (15 of 90 remaining) [2025-02-08 05:37:29,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (14 of 90 remaining) [2025-02-08 05:37:29,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (13 of 90 remaining) [2025-02-08 05:37:29,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (12 of 90 remaining) [2025-02-08 05:37:29,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (11 of 90 remaining) [2025-02-08 05:37:29,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (10 of 90 remaining) [2025-02-08 05:37:29,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (9 of 90 remaining) [2025-02-08 05:37:29,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (8 of 90 remaining) [2025-02-08 05:37:29,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (7 of 90 remaining) [2025-02-08 05:37:29,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (6 of 90 remaining) [2025-02-08 05:37:29,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (5 of 90 remaining) [2025-02-08 05:37:29,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (4 of 90 remaining) [2025-02-08 05:37:29,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (3 of 90 remaining) [2025-02-08 05:37:29,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (2 of 90 remaining) [2025-02-08 05:37:29,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (1 of 90 remaining) [2025-02-08 05:37:29,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (0 of 90 remaining) [2025-02-08 05:37:29,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:37:29,109 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:29,115 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:37:29,115 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:37:29,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:37:29 BasicIcfg [2025-02-08 05:37:29,121 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:37:29,122 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:37:29,122 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:37:29,122 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:37:29,122 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:27" (3/4) ... [2025-02-08 05:37:29,123 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:37:29,125 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:37:29,125 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:37:29,129 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-02-08 05:37:29,129 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:37:29,129 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:37:29,129 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:37:29,193 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:37:29,193 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:37:29,193 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:37:29,194 INFO L158 Benchmark]: Toolchain (without parser) took 2852.98ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 113.1MB in the beginning and 136.2MB in the end (delta: -23.1MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. [2025-02-08 05:37:29,194 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:37:29,194 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.69ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 100.8MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:29,195 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.90ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 98.1MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:29,196 INFO L158 Benchmark]: Boogie Preprocessor took 32.68ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 96.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:37:29,196 INFO L158 Benchmark]: IcfgBuilder took 864.67ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 67.1MB in the end (delta: 29.6MB). Peak memory consumption was 64.7MB. Max. memory is 16.1GB. [2025-02-08 05:37:29,196 INFO L158 Benchmark]: TraceAbstraction took 1645.35ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 66.4MB in the beginning and 143.2MB in the end (delta: -76.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:37:29,196 INFO L158 Benchmark]: Witness Printer took 71.43ms. Allocated memory is still 192.9MB. Free memory was 143.2MB in the beginning and 136.2MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:29,197 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.23ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 194.69ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 100.8MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.90ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 98.1MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.68ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 96.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 864.67ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 67.1MB in the end (delta: 29.6MB). Peak memory consumption was 64.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1645.35ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 66.4MB in the beginning and 143.2MB in the end (delta: -76.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 71.43ms. Allocated memory is still 192.9MB. Free memory was 143.2MB in the beginning and 136.2MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: 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: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: 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: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: 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 5 procedures, 290 locations, 90 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: 1.6s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 106 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29 mSDsluCounter, 18 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 273 IncrementalHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 18 mSDtfsCounter, 273 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=450occurred in iteration=0, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 872 NumberOfCodeBlocks, 872 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 860 ConstructedInterpolants, 0 QuantifiedInterpolants, 884 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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 52 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:37:29,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE