./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-file-item-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-file-item-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 3bc77f08e5fdc1758b216096ce0b18debc22015dafe53c78389dc7da36650394 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:37:31,797 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:37:31,833 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:31,836 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:37:31,836 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:37:31,851 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:37:31,852 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:37:31,852 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:37:31,852 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:37:31,852 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:37:31,852 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:37:31,852 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:37:31,852 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:37:31,852 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:37:31,853 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:37:31,853 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:37:31,853 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:37:31,853 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:37:31,853 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:37:31,853 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:37:31,853 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:37:31,853 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:37:31,853 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:37:31,853 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:37:31,853 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:37:31,853 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:37:31,853 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:37:31,853 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:37:31,853 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:37:31,853 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:37:31,853 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:37:31,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:37:31,854 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:37:31,854 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:37:31,854 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:37:31,854 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:37:31,854 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:37:31,854 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:37:31,854 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:37:31,854 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:37:31,854 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:37:31,854 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:37:31,854 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 -> 3bc77f08e5fdc1758b216096ce0b18debc22015dafe53c78389dc7da36650394 [2025-02-08 05:37:32,054 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:37:32,060 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:37:32,066 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:37:32,067 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:37:32,067 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:37:32,068 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-file-item-symm.wvr.c [2025-02-08 05:37:33,221 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f426ca26/172b7582cf384fd69f1c79ca2ccc26c1/FLAG639bbb560 [2025-02-08 05:37:33,457 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:37:33,457 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-file-item-symm.wvr.c [2025-02-08 05:37:33,464 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f426ca26/172b7582cf384fd69f1c79ca2ccc26c1/FLAG639bbb560 [2025-02-08 05:37:33,814 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f426ca26/172b7582cf384fd69f1c79ca2ccc26c1 [2025-02-08 05:37:33,817 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:37:33,819 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:37:33,821 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:33,821 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:37:33,824 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:37:33,825 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:33" (1/1) ... [2025-02-08 05:37:33,827 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf0269b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:33, skipping insertion in model container [2025-02-08 05:37:33,827 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:33" (1/1) ... [2025-02-08 05:37:33,839 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:37:33,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:33,991 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:37:34,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:34,026 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:37:34,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:34 WrapperNode [2025-02-08 05:37:34,027 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:34,028 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:34,028 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:37:34,028 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:37:34,034 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:34" (1/1) ... [2025-02-08 05:37:34,039 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:34" (1/1) ... [2025-02-08 05:37:34,061 INFO L138 Inliner]: procedures = 21, calls = 16, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 231 [2025-02-08 05:37:34,061 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:34,062 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:37:34,063 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:37:34,063 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:37:34,067 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:34" (1/1) ... [2025-02-08 05:37:34,068 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:34" (1/1) ... [2025-02-08 05:37:34,069 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:34" (1/1) ... [2025-02-08 05:37:34,069 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:34" (1/1) ... [2025-02-08 05:37:34,077 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:34" (1/1) ... [2025-02-08 05:37:34,081 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:34" (1/1) ... [2025-02-08 05:37:34,082 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:34" (1/1) ... [2025-02-08 05:37:34,086 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:34" (1/1) ... [2025-02-08 05:37:34,087 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:37:34,088 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:37:34,088 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:37:34,088 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:37:34,089 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:34" (1/1) ... [2025-02-08 05:37:34,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:37:34,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:37:34,118 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:34,125 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:34,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:37:34,141 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:37:34,141 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:37:34,141 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:37:34,141 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:37:34,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:37:34,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:37:34,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:37:34,142 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:34,209 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:37:34,210 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:37:34,321 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L44-17: #t~ite2#1 := #t~ret1#1; [2025-02-08 05:37:34,323 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L44-18: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret1#1 && #t~ret1#1 <= 2147483647; [2025-02-08 05:37:34,323 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L44-19: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:34,323 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L44-20: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:34,323 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L44-21: #t~ret1#1 := minus_#res#1; [2025-02-08 05:37:34,402 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-17: #t~ite8#1 := #t~ret7#1; [2025-02-08 05:37:34,403 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-18: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret7#1 && #t~ret7#1 <= 2147483647; [2025-02-08 05:37:34,403 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-19: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:34,403 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-20: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:34,403 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-21: #t~ret7#1 := minus_#res#1; [2025-02-08 05:37:34,532 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:37:34,532 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:37:34,551 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:37:34,554 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:37:34,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:34 BoogieIcfgContainer [2025-02-08 05:37:34,555 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:37:34,557 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:37:34,557 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:37:34,561 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:37:34,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:37:33" (1/3) ... [2025-02-08 05:37:34,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47673d00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:34, skipping insertion in model container [2025-02-08 05:37:34,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:34" (2/3) ... [2025-02-08 05:37:34,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47673d00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:34, skipping insertion in model container [2025-02-08 05:37:34,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:34" (3/3) ... [2025-02-08 05:37:34,563 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-file-item-symm.wvr.c [2025-02-08 05:37:34,575 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:37:34,576 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-file-item-symm.wvr.c that has 3 procedures, 288 locations, 1 initial locations, 0 loop locations, and 30 error locations. [2025-02-08 05:37:34,576 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:37:34,660 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:37:34,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 294 places, 303 transitions, 620 flow [2025-02-08 05:37:34,786 INFO L124 PetriNetUnfolderBase]: 16/301 cut-off events. [2025-02-08 05:37:34,787 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:37:34,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 301 events. 16/301 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 584 event pairs, 0 based on Foata normal form. 0/253 useless extension candidates. Maximal degree in co-relation 160. Up to 2 conditions per place. [2025-02-08 05:37:34,796 INFO L82 GeneralOperation]: Start removeDead. Operand has 294 places, 303 transitions, 620 flow [2025-02-08 05:37:34,801 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 274 places, 281 transitions, 574 flow [2025-02-08 05:37:34,810 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:37:34,821 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;@f02cf89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:37:34,821 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-02-08 05:37:34,829 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:37:34,829 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-02-08 05:37:34,829 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:37:34,830 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:34,830 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] [2025-02-08 05:37:34,831 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:34,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:34,836 INFO L85 PathProgramCache]: Analyzing trace with hash 259232807, now seen corresponding path program 1 times [2025-02-08 05:37:34,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:34,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442808593] [2025-02-08 05:37:34,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:34,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:34,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 05:37:34,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 05:37:34,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:34,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:34,994 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:34,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:34,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442808593] [2025-02-08 05:37:34,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442808593] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:34,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:34,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:34,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904879573] [2025-02-08 05:37:34,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:35,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:35,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:35,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:35,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:35,058 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 303 [2025-02-08 05:37:35,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 281 transitions, 574 flow. Second operand has 3 states, 3 states have (on average 283.3333333333333) internal successors, (850), 3 states have internal predecessors, (850), 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:35,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:35,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 303 [2025-02-08 05:37:35,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:35,122 INFO L124 PetriNetUnfolderBase]: 14/354 cut-off events. [2025-02-08 05:37:35,122 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2025-02-08 05:37:35,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 384 conditions, 354 events. 14/354 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1050 event pairs, 3 based on Foata normal form. 12/306 useless extension candidates. Maximal degree in co-relation 243. Up to 16 conditions per place. [2025-02-08 05:37:35,126 INFO L140 encePairwiseOnDemand]: 294/303 looper letters, 9 selfloop transitions, 2 changer transitions 2/274 dead transitions. [2025-02-08 05:37:35,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 274 transitions, 582 flow [2025-02-08 05:37:35,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:35,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:35,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 864 transitions. [2025-02-08 05:37:35,137 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9504950495049505 [2025-02-08 05:37:35,138 INFO L175 Difference]: Start difference. First operand has 274 places, 281 transitions, 574 flow. Second operand 3 states and 864 transitions. [2025-02-08 05:37:35,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 274 transitions, 582 flow [2025-02-08 05:37:35,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 274 transitions, 574 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:37:35,146 INFO L231 Difference]: Finished difference. Result has 271 places, 272 transitions, 552 flow [2025-02-08 05:37:35,149 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=552, PETRI_PLACES=271, PETRI_TRANSITIONS=272} [2025-02-08 05:37:35,151 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, -3 predicate places. [2025-02-08 05:37:35,151 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 272 transitions, 552 flow [2025-02-08 05:37:35,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 283.3333333333333) internal successors, (850), 3 states have internal predecessors, (850), 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:35,152 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:35,152 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] [2025-02-08 05:37:35,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:37:35,152 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:35,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:35,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1933822962, now seen corresponding path program 1 times [2025-02-08 05:37:35,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:35,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249969362] [2025-02-08 05:37:35,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:35,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:35,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 05:37:35,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 05:37:35,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:35,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:35,185 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:35,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:35,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249969362] [2025-02-08 05:37:35,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249969362] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:35,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:35,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:35,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196079710] [2025-02-08 05:37:35,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:35,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:35,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:35,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:35,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:35,203 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 303 [2025-02-08 05:37:35,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 272 transitions, 552 flow. Second operand has 3 states, 3 states have (on average 283.3333333333333) internal successors, (850), 3 states have internal predecessors, (850), 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:35,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:35,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 303 [2025-02-08 05:37:35,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:35,241 INFO L124 PetriNetUnfolderBase]: 14/351 cut-off events. [2025-02-08 05:37:35,241 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2025-02-08 05:37:35,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 376 conditions, 351 events. 14/351 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1046 event pairs, 3 based on Foata normal form. 0/294 useless extension candidates. Maximal degree in co-relation 344. Up to 16 conditions per place. [2025-02-08 05:37:35,244 INFO L140 encePairwiseOnDemand]: 300/303 looper letters, 9 selfloop transitions, 2 changer transitions 0/271 dead transitions. [2025-02-08 05:37:35,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 271 transitions, 572 flow [2025-02-08 05:37:35,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:35,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:35,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 858 transitions. [2025-02-08 05:37:35,246 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9438943894389439 [2025-02-08 05:37:35,246 INFO L175 Difference]: Start difference. First operand has 271 places, 272 transitions, 552 flow. Second operand 3 states and 858 transitions. [2025-02-08 05:37:35,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 271 transitions, 572 flow [2025-02-08 05:37:35,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 271 transitions, 568 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:35,251 INFO L231 Difference]: Finished difference. Result has 268 places, 271 transitions, 550 flow [2025-02-08 05:37:35,251 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=550, PETRI_PLACES=268, PETRI_TRANSITIONS=271} [2025-02-08 05:37:35,252 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, -6 predicate places. [2025-02-08 05:37:35,252 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 271 transitions, 550 flow [2025-02-08 05:37:35,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 283.3333333333333) internal successors, (850), 3 states have internal predecessors, (850), 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:35,253 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:35,253 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] [2025-02-08 05:37:35,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:37:35,253 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:35,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:35,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1420924692, now seen corresponding path program 1 times [2025-02-08 05:37:35,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:35,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097716338] [2025-02-08 05:37:35,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:35,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:35,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 05:37:35,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 05:37:35,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:35,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:35,293 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:35,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:35,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097716338] [2025-02-08 05:37:35,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097716338] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:35,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:35,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:35,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188849635] [2025-02-08 05:37:35,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:35,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:35,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:35,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:35,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:35,317 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 303 [2025-02-08 05:37:35,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 271 transitions, 550 flow. Second operand has 3 states, 3 states have (on average 282.3333333333333) internal successors, (847), 3 states have internal predecessors, (847), 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:35,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:35,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 303 [2025-02-08 05:37:35,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:35,391 INFO L124 PetriNetUnfolderBase]: 22/493 cut-off events. [2025-02-08 05:37:35,392 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:37:35,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 523 conditions, 493 events. 22/493 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2114 event pairs, 5 based on Foata normal form. 0/405 useless extension candidates. Maximal degree in co-relation 483. Up to 21 conditions per place. [2025-02-08 05:37:35,395 INFO L140 encePairwiseOnDemand]: 300/303 looper letters, 10 selfloop transitions, 2 changer transitions 0/270 dead transitions. [2025-02-08 05:37:35,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 270 transitions, 572 flow [2025-02-08 05:37:35,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:35,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:35,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 856 transitions. [2025-02-08 05:37:35,397 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9416941694169417 [2025-02-08 05:37:35,397 INFO L175 Difference]: Start difference. First operand has 268 places, 271 transitions, 550 flow. Second operand 3 states and 856 transitions. [2025-02-08 05:37:35,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 270 transitions, 572 flow [2025-02-08 05:37:35,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 270 transitions, 568 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:35,404 INFO L231 Difference]: Finished difference. Result has 267 places, 270 transitions, 548 flow [2025-02-08 05:37:35,404 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=548, PETRI_PLACES=267, PETRI_TRANSITIONS=270} [2025-02-08 05:37:35,405 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, -7 predicate places. [2025-02-08 05:37:35,405 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 270 transitions, 548 flow [2025-02-08 05:37:35,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 282.3333333333333) internal successors, (847), 3 states have internal predecessors, (847), 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:35,405 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:35,405 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] [2025-02-08 05:37:35,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:37:35,406 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:35,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:35,406 INFO L85 PathProgramCache]: Analyzing trace with hash 693153480, now seen corresponding path program 1 times [2025-02-08 05:37:35,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:35,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640718219] [2025-02-08 05:37:35,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:35,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:35,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 05:37:35,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 05:37:35,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:35,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:35,466 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:35,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:35,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640718219] [2025-02-08 05:37:35,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640718219] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:35,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:35,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:35,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363231488] [2025-02-08 05:37:35,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:35,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:35,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:35,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:35,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:35,485 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 303 [2025-02-08 05:37:35,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 270 transitions, 548 flow. Second operand has 3 states, 3 states have (on average 282.3333333333333) internal successors, (847), 3 states have internal predecessors, (847), 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:35,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:35,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 303 [2025-02-08 05:37:35,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:35,522 INFO L124 PetriNetUnfolderBase]: 19/409 cut-off events. [2025-02-08 05:37:35,522 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:37:35,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 440 conditions, 409 events. 19/409 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1525 event pairs, 5 based on Foata normal form. 0/344 useless extension candidates. Maximal degree in co-relation 392. Up to 21 conditions per place. [2025-02-08 05:37:35,524 INFO L140 encePairwiseOnDemand]: 300/303 looper letters, 10 selfloop transitions, 2 changer transitions 0/269 dead transitions. [2025-02-08 05:37:35,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 269 transitions, 570 flow [2025-02-08 05:37:35,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:35,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:35,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 856 transitions. [2025-02-08 05:37:35,526 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9416941694169417 [2025-02-08 05:37:35,526 INFO L175 Difference]: Start difference. First operand has 267 places, 270 transitions, 548 flow. Second operand 3 states and 856 transitions. [2025-02-08 05:37:35,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 269 transitions, 570 flow [2025-02-08 05:37:35,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 269 transitions, 566 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:35,530 INFO L231 Difference]: Finished difference. Result has 266 places, 269 transitions, 546 flow [2025-02-08 05:37:35,530 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=546, PETRI_PLACES=266, PETRI_TRANSITIONS=269} [2025-02-08 05:37:35,531 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, -8 predicate places. [2025-02-08 05:37:35,531 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 269 transitions, 546 flow [2025-02-08 05:37:35,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 282.3333333333333) internal successors, (847), 3 states have internal predecessors, (847), 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:35,531 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:35,531 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] [2025-02-08 05:37:35,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:37:35,531 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:35,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:35,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1342610147, now seen corresponding path program 1 times [2025-02-08 05:37:35,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:35,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820145651] [2025-02-08 05:37:35,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:35,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:35,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-08 05:37:35,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 05:37:35,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:35,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:35,570 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:35,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:35,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820145651] [2025-02-08 05:37:35,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820145651] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:35,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:35,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:35,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66897249] [2025-02-08 05:37:35,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:35,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:35,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:35,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:35,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:35,599 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 303 [2025-02-08 05:37:35,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 269 transitions, 546 flow. Second operand has 3 states, 3 states have (on average 282.3333333333333) internal successors, (847), 3 states have internal predecessors, (847), 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:35,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:35,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 303 [2025-02-08 05:37:35,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:35,647 INFO L124 PetriNetUnfolderBase]: 18/402 cut-off events. [2025-02-08 05:37:35,648 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-02-08 05:37:35,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 433 conditions, 402 events. 18/402 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1351 event pairs, 5 based on Foata normal form. 0/338 useless extension candidates. Maximal degree in co-relation 377. Up to 22 conditions per place. [2025-02-08 05:37:35,650 INFO L140 encePairwiseOnDemand]: 300/303 looper letters, 10 selfloop transitions, 2 changer transitions 0/268 dead transitions. [2025-02-08 05:37:35,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 268 transitions, 568 flow [2025-02-08 05:37:35,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:35,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:35,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 856 transitions. [2025-02-08 05:37:35,652 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9416941694169417 [2025-02-08 05:37:35,652 INFO L175 Difference]: Start difference. First operand has 266 places, 269 transitions, 546 flow. Second operand 3 states and 856 transitions. [2025-02-08 05:37:35,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 268 transitions, 568 flow [2025-02-08 05:37:35,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 268 transitions, 564 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:35,657 INFO L231 Difference]: Finished difference. Result has 265 places, 268 transitions, 544 flow [2025-02-08 05:37:35,658 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=544, PETRI_PLACES=265, PETRI_TRANSITIONS=268} [2025-02-08 05:37:35,658 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, -9 predicate places. [2025-02-08 05:37:35,658 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 268 transitions, 544 flow [2025-02-08 05:37:35,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 282.3333333333333) internal successors, (847), 3 states have internal predecessors, (847), 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:35,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:35,659 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:35,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:37:35,659 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:35,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:35,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1240082824, now seen corresponding path program 1 times [2025-02-08 05:37:35,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:35,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840619879] [2025-02-08 05:37:35,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:35,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:35,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-08 05:37:35,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-08 05:37:35,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:35,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:35,750 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:35,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:35,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840619879] [2025-02-08 05:37:35,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840619879] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:35,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:35,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:35,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397700047] [2025-02-08 05:37:35,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:35,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:35,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:35,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:35,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:35,769 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 303 [2025-02-08 05:37:35,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 268 transitions, 544 flow. Second operand has 3 states, 3 states have (on average 282.3333333333333) internal successors, (847), 3 states have internal predecessors, (847), 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:35,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:35,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 303 [2025-02-08 05:37:35,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:35,807 INFO L124 PetriNetUnfolderBase]: 21/482 cut-off events. [2025-02-08 05:37:35,807 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-02-08 05:37:35,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 514 conditions, 482 events. 21/482 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1917 event pairs, 5 based on Foata normal form. 0/402 useless extension candidates. Maximal degree in co-relation 450. Up to 22 conditions per place. [2025-02-08 05:37:35,809 INFO L140 encePairwiseOnDemand]: 300/303 looper letters, 10 selfloop transitions, 2 changer transitions 0/267 dead transitions. [2025-02-08 05:37:35,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 267 transitions, 566 flow [2025-02-08 05:37:35,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:35,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:35,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 856 transitions. [2025-02-08 05:37:35,811 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9416941694169417 [2025-02-08 05:37:35,811 INFO L175 Difference]: Start difference. First operand has 265 places, 268 transitions, 544 flow. Second operand 3 states and 856 transitions. [2025-02-08 05:37:35,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 267 transitions, 566 flow [2025-02-08 05:37:35,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 267 transitions, 562 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:35,814 INFO L231 Difference]: Finished difference. Result has 264 places, 267 transitions, 542 flow [2025-02-08 05:37:35,814 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=542, PETRI_PLACES=264, PETRI_TRANSITIONS=267} [2025-02-08 05:37:35,815 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, -10 predicate places. [2025-02-08 05:37:35,815 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 267 transitions, 542 flow [2025-02-08 05:37:35,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 282.3333333333333) internal successors, (847), 3 states have internal predecessors, (847), 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:35,815 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:35,815 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:35,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:37:35,816 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:35,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:35,816 INFO L85 PathProgramCache]: Analyzing trace with hash 2124011440, now seen corresponding path program 1 times [2025-02-08 05:37:35,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:35,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141021097] [2025-02-08 05:37:35,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:35,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:35,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-08 05:37:35,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-08 05:37:35,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:35,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:35,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:35,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:35,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141021097] [2025-02-08 05:37:35,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141021097] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:35,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:35,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:35,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49464005] [2025-02-08 05:37:35,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:35,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:35,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:35,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:35,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:35,868 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 303 [2025-02-08 05:37:35,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 267 transitions, 542 flow. Second operand has 3 states, 3 states have (on average 282.3333333333333) internal successors, (847), 3 states have internal predecessors, (847), 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:35,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:35,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 303 [2025-02-08 05:37:35,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:35,921 INFO L124 PetriNetUnfolderBase]: 40/690 cut-off events. [2025-02-08 05:37:35,922 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:37:35,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 738 conditions, 690 events. 40/690 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3651 event pairs, 9 based on Foata normal form. 0/574 useless extension candidates. Maximal degree in co-relation 666. Up to 36 conditions per place. [2025-02-08 05:37:35,925 INFO L140 encePairwiseOnDemand]: 297/303 looper letters, 12 selfloop transitions, 3 changer transitions 0/268 dead transitions. [2025-02-08 05:37:35,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 268 transitions, 575 flow [2025-02-08 05:37:35,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:35,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:35,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 861 transitions. [2025-02-08 05:37:35,927 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9471947194719472 [2025-02-08 05:37:35,927 INFO L175 Difference]: Start difference. First operand has 264 places, 267 transitions, 542 flow. Second operand 3 states and 861 transitions. [2025-02-08 05:37:35,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 268 transitions, 575 flow [2025-02-08 05:37:35,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 268 transitions, 571 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:35,931 INFO L231 Difference]: Finished difference. Result has 262 places, 267 transitions, 553 flow [2025-02-08 05:37:35,932 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=553, PETRI_PLACES=262, PETRI_TRANSITIONS=267} [2025-02-08 05:37:35,932 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, -12 predicate places. [2025-02-08 05:37:35,932 INFO L471 AbstractCegarLoop]: Abstraction has has 262 places, 267 transitions, 553 flow [2025-02-08 05:37:35,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 282.3333333333333) internal successors, (847), 3 states have internal predecessors, (847), 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:35,933 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:35,933 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] [2025-02-08 05:37:35,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:37:35,933 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:35,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:35,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1327778978, now seen corresponding path program 1 times [2025-02-08 05:37:35,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:35,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018620117] [2025-02-08 05:37:35,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:35,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:35,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-08 05:37:35,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-08 05:37:35,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:35,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:35,979 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:35,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:35,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018620117] [2025-02-08 05:37:35,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018620117] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:35,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:35,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:35,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948313281] [2025-02-08 05:37:35,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:35,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:35,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:35,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:35,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:35,991 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 303 [2025-02-08 05:37:35,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 267 transitions, 553 flow. Second operand has 3 states, 3 states have (on average 282.3333333333333) internal successors, (847), 3 states have internal predecessors, (847), 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:35,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:35,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 303 [2025-02-08 05:37:35,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:36,046 INFO L124 PetriNetUnfolderBase]: 45/752 cut-off events. [2025-02-08 05:37:36,047 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:37:36,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 820 conditions, 752 events. 45/752 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4264 event pairs, 6 based on Foata normal form. 0/637 useless extension candidates. Maximal degree in co-relation 667. Up to 36 conditions per place. [2025-02-08 05:37:36,050 INFO L140 encePairwiseOnDemand]: 297/303 looper letters, 12 selfloop transitions, 3 changer transitions 0/268 dead transitions. [2025-02-08 05:37:36,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 268 transitions, 586 flow [2025-02-08 05:37:36,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:36,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:36,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 861 transitions. [2025-02-08 05:37:36,052 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9471947194719472 [2025-02-08 05:37:36,052 INFO L175 Difference]: Start difference. First operand has 262 places, 267 transitions, 553 flow. Second operand 3 states and 861 transitions. [2025-02-08 05:37:36,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 268 transitions, 586 flow [2025-02-08 05:37:36,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 268 transitions, 586 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:36,055 INFO L231 Difference]: Finished difference. Result has 262 places, 267 transitions, 568 flow [2025-02-08 05:37:36,055 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=568, PETRI_PLACES=262, PETRI_TRANSITIONS=267} [2025-02-08 05:37:36,056 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, -12 predicate places. [2025-02-08 05:37:36,056 INFO L471 AbstractCegarLoop]: Abstraction has has 262 places, 267 transitions, 568 flow [2025-02-08 05:37:36,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 282.3333333333333) internal successors, (847), 3 states have internal predecessors, (847), 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:36,056 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:36,056 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] [2025-02-08 05:37:36,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:37:36,057 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:36,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:36,060 INFO L85 PathProgramCache]: Analyzing trace with hash 815468729, now seen corresponding path program 1 times [2025-02-08 05:37:36,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:36,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35265182] [2025-02-08 05:37:36,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:36,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:36,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-08 05:37:36,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-08 05:37:36,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:36,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:36,093 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:36,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:36,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35265182] [2025-02-08 05:37:36,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35265182] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:36,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:36,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:36,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203482575] [2025-02-08 05:37:36,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:36,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:36,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:36,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:36,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:36,105 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 303 [2025-02-08 05:37:36,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 267 transitions, 568 flow. Second operand has 3 states, 3 states have (on average 282.3333333333333) internal successors, (847), 3 states have internal predecessors, (847), 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:36,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:36,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 303 [2025-02-08 05:37:36,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:36,194 INFO L124 PetriNetUnfolderBase]: 45/907 cut-off events. [2025-02-08 05:37:36,195 INFO L125 PetriNetUnfolderBase]: For 12/14 co-relation queries the response was YES. [2025-02-08 05:37:36,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 999 conditions, 907 events. 45/907 cut-off events. For 12/14 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 5632 event pairs, 4 based on Foata normal form. 0/787 useless extension candidates. Maximal degree in co-relation 829. Up to 55 conditions per place. [2025-02-08 05:37:36,198 INFO L140 encePairwiseOnDemand]: 297/303 looper letters, 14 selfloop transitions, 3 changer transitions 0/270 dead transitions. [2025-02-08 05:37:36,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 270 transitions, 611 flow [2025-02-08 05:37:36,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:36,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:36,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 863 transitions. [2025-02-08 05:37:36,200 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9493949394939494 [2025-02-08 05:37:36,200 INFO L175 Difference]: Start difference. First operand has 262 places, 267 transitions, 568 flow. Second operand 3 states and 863 transitions. [2025-02-08 05:37:36,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 270 transitions, 611 flow [2025-02-08 05:37:36,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 270 transitions, 611 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:36,204 INFO L231 Difference]: Finished difference. Result has 262 places, 267 transitions, 583 flow [2025-02-08 05:37:36,204 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=583, PETRI_PLACES=262, PETRI_TRANSITIONS=267} [2025-02-08 05:37:36,205 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, -12 predicate places. [2025-02-08 05:37:36,205 INFO L471 AbstractCegarLoop]: Abstraction has has 262 places, 267 transitions, 583 flow [2025-02-08 05:37:36,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 282.3333333333333) internal successors, (847), 3 states have internal predecessors, (847), 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:36,205 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:36,206 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:36,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:37:36,206 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:36,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:36,206 INFO L85 PathProgramCache]: Analyzing trace with hash -708060772, now seen corresponding path program 1 times [2025-02-08 05:37:36,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:36,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938768433] [2025-02-08 05:37:36,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:36,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:36,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-08 05:37:36,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-08 05:37:36,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:36,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:36,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:36,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:36,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938768433] [2025-02-08 05:37:36,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938768433] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:36,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:36,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:36,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865935891] [2025-02-08 05:37:36,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:36,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:36,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:36,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:36,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:36,263 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 303 [2025-02-08 05:37:36,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 267 transitions, 583 flow. Second operand has 3 states, 3 states have (on average 284.3333333333333) internal successors, (853), 3 states have internal predecessors, (853), 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:36,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:36,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 303 [2025-02-08 05:37:36,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:36,337 INFO L124 PetriNetUnfolderBase]: 35/758 cut-off events. [2025-02-08 05:37:36,337 INFO L125 PetriNetUnfolderBase]: For 4/12 co-relation queries the response was YES. [2025-02-08 05:37:36,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 867 conditions, 758 events. 35/758 cut-off events. For 4/12 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4354 event pairs, 4 based on Foata normal form. 2/669 useless extension candidates. Maximal degree in co-relation 697. Up to 25 conditions per place. [2025-02-08 05:37:36,342 INFO L140 encePairwiseOnDemand]: 300/303 looper letters, 10 selfloop transitions, 2 changer transitions 0/267 dead transitions. [2025-02-08 05:37:36,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 267 transitions, 608 flow [2025-02-08 05:37:36,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:36,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:36,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 862 transitions. [2025-02-08 05:37:36,344 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9482948294829483 [2025-02-08 05:37:36,344 INFO L175 Difference]: Start difference. First operand has 262 places, 267 transitions, 583 flow. Second operand 3 states and 862 transitions. [2025-02-08 05:37:36,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 267 transitions, 608 flow [2025-02-08 05:37:36,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 267 transitions, 608 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:36,348 INFO L231 Difference]: Finished difference. Result has 263 places, 266 transitions, 585 flow [2025-02-08 05:37:36,348 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=585, PETRI_PLACES=263, PETRI_TRANSITIONS=266} [2025-02-08 05:37:36,348 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, -11 predicate places. [2025-02-08 05:37:36,349 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 266 transitions, 585 flow [2025-02-08 05:37:36,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 284.3333333333333) internal successors, (853), 3 states have internal predecessors, (853), 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:36,349 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:36,349 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:36,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:37:36,349 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:36,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:36,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1294483339, now seen corresponding path program 1 times [2025-02-08 05:37:36,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:36,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396493627] [2025-02-08 05:37:36,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:36,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:36,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-08 05:37:36,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-08 05:37:36,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:36,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:36,389 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:36,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:36,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396493627] [2025-02-08 05:37:36,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396493627] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:36,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:36,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:36,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720136698] [2025-02-08 05:37:36,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:36,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:36,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:36,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:36,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:36,404 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 303 [2025-02-08 05:37:36,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 266 transitions, 585 flow. Second operand has 3 states, 3 states have (on average 282.3333333333333) internal successors, (847), 3 states have internal predecessors, (847), 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:36,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:36,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 303 [2025-02-08 05:37:36,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:36,501 INFO L124 PetriNetUnfolderBase]: 47/1003 cut-off events. [2025-02-08 05:37:36,501 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2025-02-08 05:37:36,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1135 conditions, 1003 events. 47/1003 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 6649 event pairs, 7 based on Foata normal form. 0/883 useless extension candidates. Maximal degree in co-relation 962. Up to 47 conditions per place. [2025-02-08 05:37:36,506 INFO L140 encePairwiseOnDemand]: 297/303 looper letters, 14 selfloop transitions, 3 changer transitions 0/269 dead transitions. [2025-02-08 05:37:36,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 269 transitions, 628 flow [2025-02-08 05:37:36,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:36,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:36,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 863 transitions. [2025-02-08 05:37:36,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9493949394939494 [2025-02-08 05:37:36,509 INFO L175 Difference]: Start difference. First operand has 263 places, 266 transitions, 585 flow. Second operand 3 states and 863 transitions. [2025-02-08 05:37:36,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 269 transitions, 628 flow [2025-02-08 05:37:36,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 269 transitions, 624 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:36,513 INFO L231 Difference]: Finished difference. Result has 261 places, 266 transitions, 596 flow [2025-02-08 05:37:36,513 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=596, PETRI_PLACES=261, PETRI_TRANSITIONS=266} [2025-02-08 05:37:36,514 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, -13 predicate places. [2025-02-08 05:37:36,514 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 266 transitions, 596 flow [2025-02-08 05:37:36,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 282.3333333333333) internal successors, (847), 3 states have internal predecessors, (847), 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:36,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:36,514 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] [2025-02-08 05:37:36,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:37:36,514 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:36,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:36,515 INFO L85 PathProgramCache]: Analyzing trace with hash -557581851, now seen corresponding path program 1 times [2025-02-08 05:37:36,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:36,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457437848] [2025-02-08 05:37:36,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:36,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:36,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-08 05:37:36,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-08 05:37:36,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:36,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:36,557 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:36,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:36,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457437848] [2025-02-08 05:37:36,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457437848] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:36,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:36,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:36,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408394680] [2025-02-08 05:37:36,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:36,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:36,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:36,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:36,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:36,575 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 284 out of 303 [2025-02-08 05:37:36,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 266 transitions, 596 flow. Second operand has 3 states, 3 states have (on average 285.3333333333333) internal successors, (856), 3 states have internal predecessors, (856), 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:36,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:36,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 284 of 303 [2025-02-08 05:37:36,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:36,660 INFO L124 PetriNetUnfolderBase]: 38/845 cut-off events. [2025-02-08 05:37:36,660 INFO L125 PetriNetUnfolderBase]: For 9/14 co-relation queries the response was YES. [2025-02-08 05:37:36,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 965 conditions, 845 events. 38/845 cut-off events. For 9/14 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5022 event pairs, 2 based on Foata normal form. 0/756 useless extension candidates. Maximal degree in co-relation 791. Up to 35 conditions per place. [2025-02-08 05:37:36,664 INFO L140 encePairwiseOnDemand]: 299/303 looper letters, 10 selfloop transitions, 2 changer transitions 1/268 dead transitions. [2025-02-08 05:37:36,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 268 transitions, 628 flow [2025-02-08 05:37:36,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:36,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:36,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 867 transitions. [2025-02-08 05:37:36,666 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9537953795379538 [2025-02-08 05:37:36,667 INFO L175 Difference]: Start difference. First operand has 261 places, 266 transitions, 596 flow. Second operand 3 states and 867 transitions. [2025-02-08 05:37:36,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 268 transitions, 628 flow [2025-02-08 05:37:36,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 268 transitions, 628 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:36,672 INFO L231 Difference]: Finished difference. Result has 262 places, 266 transitions, 606 flow [2025-02-08 05:37:36,672 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=606, PETRI_PLACES=262, PETRI_TRANSITIONS=266} [2025-02-08 05:37:36,674 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, -12 predicate places. [2025-02-08 05:37:36,674 INFO L471 AbstractCegarLoop]: Abstraction has has 262 places, 266 transitions, 606 flow [2025-02-08 05:37:36,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 285.3333333333333) internal successors, (856), 3 states have internal predecessors, (856), 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:36,675 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:36,675 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] [2025-02-08 05:37:36,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:37:36,675 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:36,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:36,676 INFO L85 PathProgramCache]: Analyzing trace with hash 66148380, now seen corresponding path program 1 times [2025-02-08 05:37:36,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:36,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460660958] [2025-02-08 05:37:36,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:36,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:36,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-08 05:37:36,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-08 05:37:36,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:36,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:36,749 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:36,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:36,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460660958] [2025-02-08 05:37:36,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460660958] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:36,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:36,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:36,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279957832] [2025-02-08 05:37:36,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:36,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:36,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:36,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:36,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:36,775 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 303 [2025-02-08 05:37:36,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 266 transitions, 606 flow. Second operand has 3 states, 3 states have (on average 284.6666666666667) internal successors, (854), 3 states have internal predecessors, (854), 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:36,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:36,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 303 [2025-02-08 05:37:36,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:36,838 INFO L124 PetriNetUnfolderBase]: 44/768 cut-off events. [2025-02-08 05:37:36,838 INFO L125 PetriNetUnfolderBase]: For 19/21 co-relation queries the response was YES. [2025-02-08 05:37:36,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 943 conditions, 768 events. 44/768 cut-off events. For 19/21 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4385 event pairs, 4 based on Foata normal form. 0/698 useless extension candidates. Maximal degree in co-relation 763. Up to 49 conditions per place. [2025-02-08 05:37:36,841 INFO L140 encePairwiseOnDemand]: 300/303 looper letters, 10 selfloop transitions, 2 changer transitions 0/266 dead transitions. [2025-02-08 05:37:36,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 266 transitions, 631 flow [2025-02-08 05:37:36,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:36,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:36,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 862 transitions. [2025-02-08 05:37:36,843 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9482948294829483 [2025-02-08 05:37:36,843 INFO L175 Difference]: Start difference. First operand has 262 places, 266 transitions, 606 flow. Second operand 3 states and 862 transitions. [2025-02-08 05:37:36,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 266 transitions, 631 flow [2025-02-08 05:37:36,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 266 transitions, 631 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:36,848 INFO L231 Difference]: Finished difference. Result has 263 places, 265 transitions, 608 flow [2025-02-08 05:37:36,848 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=608, PETRI_PLACES=263, PETRI_TRANSITIONS=265} [2025-02-08 05:37:36,849 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, -11 predicate places. [2025-02-08 05:37:36,849 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 265 transitions, 608 flow [2025-02-08 05:37:36,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 284.6666666666667) internal successors, (854), 3 states have internal predecessors, (854), 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:36,850 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:36,851 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] [2025-02-08 05:37:36,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:37:36,851 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:36,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:36,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1034773383, now seen corresponding path program 1 times [2025-02-08 05:37:36,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:36,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878415657] [2025-02-08 05:37:36,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:36,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:36,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-08 05:37:36,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-08 05:37:36,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:36,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:36,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:36,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:36,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878415657] [2025-02-08 05:37:36,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878415657] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:36,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:36,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:36,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201461295] [2025-02-08 05:37:36,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:36,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:36,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:36,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:36,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:36,922 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 284 out of 303 [2025-02-08 05:37:36,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 265 transitions, 608 flow. Second operand has 3 states, 3 states have (on average 285.3333333333333) internal successors, (856), 3 states have internal predecessors, (856), 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:36,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:36,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 284 of 303 [2025-02-08 05:37:36,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:36,984 INFO L124 PetriNetUnfolderBase]: 39/849 cut-off events. [2025-02-08 05:37:36,984 INFO L125 PetriNetUnfolderBase]: For 9/14 co-relation queries the response was YES. [2025-02-08 05:37:36,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1015 conditions, 849 events. 39/849 cut-off events. For 9/14 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 5052 event pairs, 2 based on Foata normal form. 0/779 useless extension candidates. Maximal degree in co-relation 836. Up to 35 conditions per place. [2025-02-08 05:37:36,989 INFO L140 encePairwiseOnDemand]: 299/303 looper letters, 8 selfloop transitions, 2 changer transitions 5/267 dead transitions. [2025-02-08 05:37:36,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 267 transitions, 640 flow [2025-02-08 05:37:36,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:36,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:36,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 867 transitions. [2025-02-08 05:37:36,991 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9537953795379538 [2025-02-08 05:37:36,991 INFO L175 Difference]: Start difference. First operand has 263 places, 265 transitions, 608 flow. Second operand 3 states and 867 transitions. [2025-02-08 05:37:36,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 267 transitions, 640 flow [2025-02-08 05:37:36,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 267 transitions, 636 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:36,995 INFO L231 Difference]: Finished difference. Result has 261 places, 261 transitions, 596 flow [2025-02-08 05:37:36,996 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=596, PETRI_PLACES=261, PETRI_TRANSITIONS=261} [2025-02-08 05:37:36,996 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, -13 predicate places. [2025-02-08 05:37:36,996 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 261 transitions, 596 flow [2025-02-08 05:37:36,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 285.3333333333333) internal successors, (856), 3 states have internal predecessors, (856), 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:36,997 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:36,997 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] [2025-02-08 05:37:36,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:37:36,997 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:36,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:36,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1734626913, now seen corresponding path program 1 times [2025-02-08 05:37:36,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:36,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830912713] [2025-02-08 05:37:36,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:36,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:37,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-08 05:37:37,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-08 05:37:37,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:37,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:37,046 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:37,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:37,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830912713] [2025-02-08 05:37:37,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830912713] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:37,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:37,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:37,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973035749] [2025-02-08 05:37:37,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:37,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:37,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:37,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:37,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:37,064 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 303 [2025-02-08 05:37:37,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 261 transitions, 596 flow. Second operand has 3 states, 3 states have (on average 283.3333333333333) internal successors, (850), 3 states have internal predecessors, (850), 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:37,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:37,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 303 [2025-02-08 05:37:37,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:37,113 INFO L124 PetriNetUnfolderBase]: 33/797 cut-off events. [2025-02-08 05:37:37,114 INFO L125 PetriNetUnfolderBase]: For 4/8 co-relation queries the response was YES. [2025-02-08 05:37:37,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 941 conditions, 797 events. 33/797 cut-off events. For 4/8 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4621 event pairs, 2 based on Foata normal form. 0/736 useless extension candidates. Maximal degree in co-relation 768. Up to 21 conditions per place. [2025-02-08 05:37:37,117 INFO L140 encePairwiseOnDemand]: 299/303 looper letters, 10 selfloop transitions, 1 changer transitions 0/258 dead transitions. [2025-02-08 05:37:37,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 258 transitions, 612 flow [2025-02-08 05:37:37,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:37,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:37,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 857 transitions. [2025-02-08 05:37:37,120 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427942794279428 [2025-02-08 05:37:37,120 INFO L175 Difference]: Start difference. First operand has 261 places, 261 transitions, 596 flow. Second operand 3 states and 857 transitions. [2025-02-08 05:37:37,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 258 transitions, 612 flow [2025-02-08 05:37:37,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 258 transitions, 612 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:37,123 INFO L231 Difference]: Finished difference. Result has 260 places, 258 transitions, 592 flow [2025-02-08 05:37:37,124 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=592, PETRI_PLACES=260, PETRI_TRANSITIONS=258} [2025-02-08 05:37:37,124 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, -14 predicate places. [2025-02-08 05:37:37,124 INFO L471 AbstractCegarLoop]: Abstraction has has 260 places, 258 transitions, 592 flow [2025-02-08 05:37:37,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 283.3333333333333) internal successors, (850), 3 states have internal predecessors, (850), 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:37,125 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:37,125 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:37,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:37:37,125 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:37,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:37,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1274719608, now seen corresponding path program 1 times [2025-02-08 05:37:37,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:37,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352573523] [2025-02-08 05:37:37,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:37,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:37,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-08 05:37:37,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-08 05:37:37,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:37,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:37,172 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:37,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:37,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352573523] [2025-02-08 05:37:37,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352573523] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:37,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:37,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:37,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067278254] [2025-02-08 05:37:37,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:37,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:37,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:37,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:37,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:37,187 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 303 [2025-02-08 05:37:37,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 258 transitions, 592 flow. Second operand has 3 states, 3 states have (on average 283.3333333333333) internal successors, (850), 3 states have internal predecessors, (850), 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:37,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:37,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 303 [2025-02-08 05:37:37,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:37,252 INFO L124 PetriNetUnfolderBase]: 33/754 cut-off events. [2025-02-08 05:37:37,253 INFO L125 PetriNetUnfolderBase]: For 7/9 co-relation queries the response was YES. [2025-02-08 05:37:37,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 896 conditions, 754 events. 33/754 cut-off events. For 7/9 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4027 event pairs, 2 based on Foata normal form. 2/705 useless extension candidates. Maximal degree in co-relation 751. Up to 26 conditions per place. [2025-02-08 05:37:37,254 INFO L140 encePairwiseOnDemand]: 297/303 looper letters, 0 selfloop transitions, 0 changer transitions 257/257 dead transitions. [2025-02-08 05:37:37,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 257 transitions, 614 flow [2025-02-08 05:37:37,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:37,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:37,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 858 transitions. [2025-02-08 05:37:37,257 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9438943894389439 [2025-02-08 05:37:37,257 INFO L175 Difference]: Start difference. First operand has 260 places, 258 transitions, 592 flow. Second operand 3 states and 858 transitions. [2025-02-08 05:37:37,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 257 transitions, 614 flow [2025-02-08 05:37:37,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 257 transitions, 613 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:37,259 INFO L231 Difference]: Finished difference. Result has 258 places, 0 transitions, 0 flow [2025-02-08 05:37:37,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=585, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=258, PETRI_TRANSITIONS=0} [2025-02-08 05:37:37,260 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, -16 predicate places. [2025-02-08 05:37:37,260 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 0 transitions, 0 flow [2025-02-08 05:37:37,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 283.3333333333333) internal successors, (850), 3 states have internal predecessors, (850), 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:37,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (49 of 50 remaining) [2025-02-08 05:37:37,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (48 of 50 remaining) [2025-02-08 05:37:37,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (47 of 50 remaining) [2025-02-08 05:37:37,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (46 of 50 remaining) [2025-02-08 05:37:37,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (45 of 50 remaining) [2025-02-08 05:37:37,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (44 of 50 remaining) [2025-02-08 05:37:37,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (43 of 50 remaining) [2025-02-08 05:37:37,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (42 of 50 remaining) [2025-02-08 05:37:37,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (41 of 50 remaining) [2025-02-08 05:37:37,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (40 of 50 remaining) [2025-02-08 05:37:37,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (39 of 50 remaining) [2025-02-08 05:37:37,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (38 of 50 remaining) [2025-02-08 05:37:37,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (37 of 50 remaining) [2025-02-08 05:37:37,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (36 of 50 remaining) [2025-02-08 05:37:37,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (35 of 50 remaining) [2025-02-08 05:37:37,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (34 of 50 remaining) [2025-02-08 05:37:37,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (33 of 50 remaining) [2025-02-08 05:37:37,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (32 of 50 remaining) [2025-02-08 05:37:37,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (31 of 50 remaining) [2025-02-08 05:37:37,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (30 of 50 remaining) [2025-02-08 05:37:37,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (29 of 50 remaining) [2025-02-08 05:37:37,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (28 of 50 remaining) [2025-02-08 05:37:37,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (27 of 50 remaining) [2025-02-08 05:37:37,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (26 of 50 remaining) [2025-02-08 05:37:37,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (25 of 50 remaining) [2025-02-08 05:37:37,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (24 of 50 remaining) [2025-02-08 05:37:37,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (23 of 50 remaining) [2025-02-08 05:37:37,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (22 of 50 remaining) [2025-02-08 05:37:37,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (21 of 50 remaining) [2025-02-08 05:37:37,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (20 of 50 remaining) [2025-02-08 05:37:37,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 50 remaining) [2025-02-08 05:37:37,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 50 remaining) [2025-02-08 05:37:37,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (17 of 50 remaining) [2025-02-08 05:37:37,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (16 of 50 remaining) [2025-02-08 05:37:37,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (15 of 50 remaining) [2025-02-08 05:37:37,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (14 of 50 remaining) [2025-02-08 05:37:37,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (13 of 50 remaining) [2025-02-08 05:37:37,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (12 of 50 remaining) [2025-02-08 05:37:37,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (11 of 50 remaining) [2025-02-08 05:37:37,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (10 of 50 remaining) [2025-02-08 05:37:37,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (9 of 50 remaining) [2025-02-08 05:37:37,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (8 of 50 remaining) [2025-02-08 05:37:37,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (7 of 50 remaining) [2025-02-08 05:37:37,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (6 of 50 remaining) [2025-02-08 05:37:37,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (5 of 50 remaining) [2025-02-08 05:37:37,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (4 of 50 remaining) [2025-02-08 05:37:37,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (3 of 50 remaining) [2025-02-08 05:37:37,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (2 of 50 remaining) [2025-02-08 05:37:37,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (1 of 50 remaining) [2025-02-08 05:37:37,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (0 of 50 remaining) [2025-02-08 05:37:37,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:37:37,267 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:37,272 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:37:37,272 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:37:37,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:37:37 BasicIcfg [2025-02-08 05:37:37,278 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:37:37,279 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:37:37,279 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:37:37,279 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:37:37,280 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:34" (3/4) ... [2025-02-08 05:37:37,281 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:37:37,283 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:37:37,283 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:37:37,287 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-02-08 05:37:37,287 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:37:37,287 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:37:37,287 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:37:37,378 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:37:37,383 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:37:37,383 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:37:37,383 INFO L158 Benchmark]: Toolchain (without parser) took 3564.37ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 106.6MB in the beginning and 247.7MB in the end (delta: -141.1MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2025-02-08 05:37:37,384 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:37:37,384 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.55ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 94.7MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:37,384 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.11ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 91.7MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:37,384 INFO L158 Benchmark]: Boogie Preprocessor took 25.27ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 90.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:37:37,384 INFO L158 Benchmark]: IcfgBuilder took 466.83ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 68.3MB in the end (delta: 22.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:37:37,385 INFO L158 Benchmark]: TraceAbstraction took 2720.92ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 68.3MB in the beginning and 256.1MB in the end (delta: -187.8MB). Peak memory consumption was 140.7MB. Max. memory is 16.1GB. [2025-02-08 05:37:37,385 INFO L158 Benchmark]: Witness Printer took 104.17ms. Allocated memory is still 302.0MB. Free memory was 256.1MB in the beginning and 247.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:37,385 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.18ms. Allocated memory is still 201.3MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 206.55ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 94.7MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.11ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 91.7MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.27ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 90.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 466.83ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 68.3MB in the end (delta: 22.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2720.92ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 68.3MB in the beginning and 256.1MB in the end (delta: -187.8MB). Peak memory consumption was 140.7MB. Max. memory is 16.1GB. * Witness Printer took 104.17ms. Allocated memory is still 302.0MB. Free memory was 256.1MB in the beginning and 247.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 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: 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: 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: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: 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: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: 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: 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: 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: 73]: 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, 432 locations, 50 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: 2.6s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 333 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 107 mSDsluCounter, 97 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 391 IncrementalHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 97 mSDtfsCounter, 391 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=608occurred in iteration=13, InterpolantAutomatonStates: 48, 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.6s InterpolantComputationTime, 1158 NumberOfCodeBlocks, 1158 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1142 ConstructedInterpolants, 0 QuantifiedInterpolants, 1174 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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 30 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:37:37,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE