./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-deagle/circular_buffer_ok.i --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/pthread-deagle/circular_buffer_ok.i -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 8fcb457b1bed8494a9a3b58e82500f367f4337ac38b5a41a5dad0da896f97e40 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:41:29,687 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:41:29,734 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:41:29,737 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:41:29,737 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:41:29,751 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:41:29,751 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:41:29,751 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:41:29,752 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:41:29,752 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:41:29,752 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:41:29,752 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:41:29,752 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:41:29,752 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:41:29,753 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:41:29,753 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:41:29,753 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:41:29,753 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:41:29,753 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:41:29,753 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:41:29,753 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:41:29,753 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:41:29,753 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:41:29,753 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:41:29,753 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:41:29,753 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:41:29,754 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:41:29,754 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:41:29,754 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:41:29,754 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:41:29,754 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:41:29,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:41:29,754 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:41:29,754 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:41:29,754 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:41:29,754 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:41:29,754 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:41:29,755 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:41:29,755 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:41:29,755 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:41:29,755 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:41:29,755 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:41:29,755 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 -> 8fcb457b1bed8494a9a3b58e82500f367f4337ac38b5a41a5dad0da896f97e40 [2025-02-08 05:41:29,958 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:41:29,963 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:41:29,967 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:41:29,967 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:41:29,968 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:41:29,968 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/circular_buffer_ok.i [2025-02-08 05:41:31,192 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/75f170d53/2d421906cbea4746b13d775c124eb06e/FLAG47d4fdc01 [2025-02-08 05:41:31,549 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:41:31,550 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-deagle/circular_buffer_ok.i [2025-02-08 05:41:31,559 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/75f170d53/2d421906cbea4746b13d775c124eb06e/FLAG47d4fdc01 [2025-02-08 05:41:31,770 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/75f170d53/2d421906cbea4746b13d775c124eb06e [2025-02-08 05:41:31,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:41:31,773 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:41:31,774 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:41:31,774 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:41:31,777 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:41:31,777 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:41:31" (1/1) ... [2025-02-08 05:41:31,778 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5867074e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:31, skipping insertion in model container [2025-02-08 05:41:31,778 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:41:31" (1/1) ... [2025-02-08 05:41:31,799 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:41:32,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:41:32,061 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:41:32,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:41:32,146 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:41:32,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:32 WrapperNode [2025-02-08 05:41:32,148 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:41:32,149 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:41:32,149 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:41:32,149 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:41:32,154 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:41:32" (1/1) ... [2025-02-08 05:41:32,165 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:41:32" (1/1) ... [2025-02-08 05:41:32,191 INFO L138 Inliner]: procedures = 168, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 243 [2025-02-08 05:41:32,192 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:41:32,196 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:41:32,196 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:41:32,196 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:41:32,203 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:32" (1/1) ... [2025-02-08 05:41:32,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:32" (1/1) ... [2025-02-08 05:41:32,206 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:32" (1/1) ... [2025-02-08 05:41:32,206 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:32" (1/1) ... [2025-02-08 05:41:32,218 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:32" (1/1) ... [2025-02-08 05:41:32,219 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:32" (1/1) ... [2025-02-08 05:41:32,220 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:32" (1/1) ... [2025-02-08 05:41:32,221 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:32" (1/1) ... [2025-02-08 05:41:32,223 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:41:32,223 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:41:32,223 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:41:32,224 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:41:32,224 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:32" (1/1) ... [2025-02-08 05:41:32,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:41:32,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:41:32,258 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:41:32,266 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:41:32,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:41:32,278 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-02-08 05:41:32,278 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-02-08 05:41:32,278 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-02-08 05:41:32,278 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-02-08 05:41:32,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:41:32,278 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:41:32,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:41:32,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-08 05:41:32,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:41:32,278 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:41:32,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:41:32,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:41:32,279 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:41:32,358 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:41:32,359 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:41:32,647 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L730: assume ~i~0#1 == #t~ret12#1; [2025-02-08 05:41:32,647 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L730: assume !(~i~0#1 == #t~ret12#1); [2025-02-08 05:41:32,647 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L730-1: havoc #t~ret12#1; [2025-02-08 05:41:32,647 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L730-2: havoc #t~ret12#1; [2025-02-08 05:41:32,647 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L730-3: assume { :end_inline_insertLogElement } true;assume -2147483648 <= #t~ret12#1 && #t~ret12#1 <= 2147483647; [2025-02-08 05:41:32,647 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L730-4: havoc insertLogElement_#in~b#1; [2025-02-08 05:41:32,647 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L730-5: havoc insertLogElement_#t~short8#1, insertLogElement_#t~nondet9#1, insertLogElement_#t~nondet10#1, insertLogElement_~b#1; [2025-02-08 05:41:32,647 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L730-6: #t~ret12#1 := insertLogElement_#res#1; [2025-02-08 05:41:32,647 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L681: assume false; [2025-02-08 05:41:32,647 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L681: assume !false; [2025-02-08 05:41:32,647 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L681-1: assume false; [2025-02-08 05:41:32,647 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L731: assume { :end_inline_reach_error } true;assume false; [2025-02-08 05:41:32,647 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L731-1: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 05:41:32,648 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L731-2: assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 05:41:32,648 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L732: assume #race~value~0 == #t~nondet13#1; [2025-02-08 05:41:32,648 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L732: assume !(#race~value~0 == #t~nondet13#1); [2025-02-08 05:41:32,648 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L732-1: havoc #t~nondet13#1; [2025-02-08 05:41:32,648 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L732-2: #race~value~0 := #t~nondet13#1; [2025-02-08 05:41:32,648 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L732-3: havoc #t~nondet13#1; [2025-02-08 05:41:32,648 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L732-4: ~value~0 := ~i~0#1; [2025-02-08 05:41:32,648 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733: assume #race~send~0 == #t~nondet14#1; [2025-02-08 05:41:32,648 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733: assume !(#race~send~0 == #t~nondet14#1); [2025-02-08 05:41:32,648 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733-1: havoc #t~nondet14#1; [2025-02-08 05:41:32,648 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733-2: #race~send~0 := #t~nondet14#1; [2025-02-08 05:41:32,648 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733-3: havoc #t~nondet14#1; [2025-02-08 05:41:32,648 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733-4: ~send~0 := 0; [2025-02-08 05:41:32,648 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: assume #race~receive~0 == #t~nondet15#1; [2025-02-08 05:41:32,648 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: assume !(#race~receive~0 == #t~nondet15#1); [2025-02-08 05:41:32,648 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L734-1: havoc #t~nondet15#1; [2025-02-08 05:41:32,648 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L734-2: #race~receive~0 := #t~nondet15#1; [2025-02-08 05:41:32,648 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L734-3: havoc #t~nondet15#1; [2025-02-08 05:41:32,648 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L734-4: ~receive~0 := 1; [2025-02-08 05:41:32,717 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L750: assume #race~receive~0 == #t~nondet20#1; [2025-02-08 05:41:32,717 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L750: assume !(#race~receive~0 == #t~nondet20#1); [2025-02-08 05:41:32,717 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-1: havoc #t~nondet20#1; [2025-02-08 05:41:32,717 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-2: #race~receive~0 := #t~nondet20#1; [2025-02-08 05:41:32,717 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-3: havoc #t~nondet20#1; [2025-02-08 05:41:32,717 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-4: ~receive~0 := 0; [2025-02-08 05:41:32,718 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751: assume #race~send~0 == #t~nondet21#1; [2025-02-08 05:41:32,718 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751: assume !(#race~send~0 == #t~nondet21#1); [2025-02-08 05:41:32,718 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751-1: havoc #t~nondet21#1; [2025-02-08 05:41:32,718 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751-2: #race~send~0 := #t~nondet21#1; [2025-02-08 05:41:32,718 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751-3: havoc #t~nondet21#1; [2025-02-08 05:41:32,718 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751-4: ~send~0 := 1; [2025-02-08 05:41:32,718 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L681: assume false; [2025-02-08 05:41:32,718 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L681: assume !false; [2025-02-08 05:41:32,718 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L681-1: assume false; [2025-02-08 05:41:32,718 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748: assume #t~ret19#1 == ~value~0; [2025-02-08 05:41:32,718 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748: assume !(#t~ret19#1 == ~value~0); [2025-02-08 05:41:32,718 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-1: havoc #t~ret19#1; [2025-02-08 05:41:32,718 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-2: havoc #t~ret19#1; [2025-02-08 05:41:32,719 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-3: assume 0 == #race~value~0; [2025-02-08 05:41:32,719 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-3: assume !(0 == #race~value~0); [2025-02-08 05:41:32,719 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-4: #race~value~0 := 0; [2025-02-08 05:41:32,719 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-5: assume { :end_inline_removeLogElement } true;assume -2147483648 <= #t~ret19#1 && #t~ret19#1 <= 2147483647; [2025-02-08 05:41:32,719 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-6: havoc removeLogElement_#t~short4#1, removeLogElement_#t~post5#1, removeLogElement_#t~nondet6#1, removeLogElement_#t~mem7#1; [2025-02-08 05:41:32,719 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-7: #t~ret19#1 := removeLogElement_#res#1; [2025-02-08 05:41:32,719 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L699: havoc removeLogElement_#t~mem7#1; [2025-02-08 05:41:32,719 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L749: assume { :end_inline_reach_error } true;assume false; [2025-02-08 05:41:32,719 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L749-1: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 05:41:32,719 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L749-2: assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 05:41:32,724 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:41:32,724 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:41:32,758 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:41:32,760 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:41:32,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:41:32 BoogieIcfgContainer [2025-02-08 05:41:32,761 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:41:32,766 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:41:32,766 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:41:32,774 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:41:32,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:41:31" (1/3) ... [2025-02-08 05:41:32,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f38b51c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:41:32, skipping insertion in model container [2025-02-08 05:41:32,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:32" (2/3) ... [2025-02-08 05:41:32,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f38b51c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:41:32, skipping insertion in model container [2025-02-08 05:41:32,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:41:32" (3/3) ... [2025-02-08 05:41:32,776 INFO L128 eAbstractionObserver]: Analyzing ICFG circular_buffer_ok.i [2025-02-08 05:41:32,800 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:41:32,805 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG circular_buffer_ok.i that has 3 procedures, 227 locations, 1 initial locations, 2 loop locations, and 31 error locations. [2025-02-08 05:41:32,805 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:41:32,908 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:41:32,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 233 places, 234 transitions, 482 flow [2025-02-08 05:41:33,049 INFO L124 PetriNetUnfolderBase]: 8/232 cut-off events. [2025-02-08 05:41:33,051 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:41:33,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 232 events. 8/232 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 422 event pairs, 0 based on Foata normal form. 0/197 useless extension candidates. Maximal degree in co-relation 166. Up to 2 conditions per place. [2025-02-08 05:41:33,056 INFO L82 GeneralOperation]: Start removeDead. Operand has 233 places, 234 transitions, 482 flow [2025-02-08 05:41:33,063 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 226 places, 227 transitions, 463 flow [2025-02-08 05:41:33,073 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:41:33,091 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;@35062483, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:41:33,091 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2025-02-08 05:41:33,112 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:41:33,112 INFO L124 PetriNetUnfolderBase]: 0/47 cut-off events. [2025-02-08 05:41:33,112 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:41:33,113 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:33,113 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] [2025-02-08 05:41:33,113 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:41:33,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:33,125 INFO L85 PathProgramCache]: Analyzing trace with hash 214708252, now seen corresponding path program 1 times [2025-02-08 05:41:33,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:33,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101842856] [2025-02-08 05:41:33,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:33,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:33,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 05:41:33,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 05:41:33,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:33,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:33,330 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:41:33,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:33,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101842856] [2025-02-08 05:41:33,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101842856] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:33,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:33,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:33,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313205626] [2025-02-08 05:41:33,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:33,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:33,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:33,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:33,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:33,414 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 234 [2025-02-08 05:41:33,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 227 transitions, 463 flow. Second operand has 3 states, 3 states have (on average 212.33333333333334) internal successors, (637), 3 states have internal predecessors, (637), 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:41:33,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:33,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 234 [2025-02-08 05:41:33,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:33,513 INFO L124 PetriNetUnfolderBase]: 49/540 cut-off events. [2025-02-08 05:41:33,514 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-02-08 05:41:33,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 648 conditions, 540 events. 49/540 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2471 event pairs, 27 based on Foata normal form. 10/449 useless extension candidates. Maximal degree in co-relation 524. Up to 79 conditions per place. [2025-02-08 05:41:33,522 INFO L140 encePairwiseOnDemand]: 229/234 looper letters, 16 selfloop transitions, 2 changer transitions 0/222 dead transitions. [2025-02-08 05:41:33,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 222 transitions, 489 flow [2025-02-08 05:41:33,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:33,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:33,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 654 transitions. [2025-02-08 05:41:33,534 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9316239316239316 [2025-02-08 05:41:33,535 INFO L175 Difference]: Start difference. First operand has 226 places, 227 transitions, 463 flow. Second operand 3 states and 654 transitions. [2025-02-08 05:41:33,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 222 transitions, 489 flow [2025-02-08 05:41:33,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 222 transitions, 484 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 05:41:33,552 INFO L231 Difference]: Finished difference. Result has 222 places, 222 transitions, 452 flow [2025-02-08 05:41:33,554 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=452, PETRI_PLACES=222, PETRI_TRANSITIONS=222} [2025-02-08 05:41:33,561 INFO L279 CegarLoopForPetriNet]: 226 programPoint places, -4 predicate places. [2025-02-08 05:41:33,562 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 222 transitions, 452 flow [2025-02-08 05:41:33,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.33333333333334) internal successors, (637), 3 states have internal predecessors, (637), 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:41:33,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:33,566 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] [2025-02-08 05:41:33,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:41:33,566 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:41:33,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:33,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1087097335, now seen corresponding path program 1 times [2025-02-08 05:41:33,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:33,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042274354] [2025-02-08 05:41:33,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:33,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:33,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 05:41:33,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 05:41:33,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:33,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:33,666 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:41:33,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:33,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042274354] [2025-02-08 05:41:33,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042274354] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:33,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:33,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:33,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021792435] [2025-02-08 05:41:33,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:33,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:33,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:33,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:33,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:33,730 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 234 [2025-02-08 05:41:33,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 222 transitions, 452 flow. Second operand has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 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:41:33,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:33,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 234 [2025-02-08 05:41:33,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:33,824 INFO L124 PetriNetUnfolderBase]: 53/543 cut-off events. [2025-02-08 05:41:33,824 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-08 05:41:33,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 655 conditions, 543 events. 53/543 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2562 event pairs, 31 based on Foata normal form. 0/445 useless extension candidates. Maximal degree in co-relation 601. Up to 89 conditions per place. [2025-02-08 05:41:33,828 INFO L140 encePairwiseOnDemand]: 231/234 looper letters, 18 selfloop transitions, 2 changer transitions 0/221 dead transitions. [2025-02-08 05:41:33,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 221 transitions, 490 flow [2025-02-08 05:41:33,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:33,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:33,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 648 transitions. [2025-02-08 05:41:33,830 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9230769230769231 [2025-02-08 05:41:33,830 INFO L175 Difference]: Start difference. First operand has 222 places, 222 transitions, 452 flow. Second operand 3 states and 648 transitions. [2025-02-08 05:41:33,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 221 transitions, 490 flow [2025-02-08 05:41:33,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 221 transitions, 486 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:41:33,834 INFO L231 Difference]: Finished difference. Result has 221 places, 221 transitions, 450 flow [2025-02-08 05:41:33,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=450, PETRI_PLACES=221, PETRI_TRANSITIONS=221} [2025-02-08 05:41:33,835 INFO L279 CegarLoopForPetriNet]: 226 programPoint places, -5 predicate places. [2025-02-08 05:41:33,835 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 221 transitions, 450 flow [2025-02-08 05:41:33,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 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:41:33,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:33,835 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:33,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:41:33,836 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:41:33,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:33,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1023495764, now seen corresponding path program 1 times [2025-02-08 05:41:33,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:33,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533685110] [2025-02-08 05:41:33,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:33,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:33,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 05:41:33,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 05:41:33,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:33,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:33,889 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:41:33,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:33,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533685110] [2025-02-08 05:41:33,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533685110] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:33,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:33,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:33,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689204249] [2025-02-08 05:41:33,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:33,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:33,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:33,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:33,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:33,937 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 234 [2025-02-08 05:41:33,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 221 transitions, 450 flow. Second operand has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 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:41:33,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:33,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 234 [2025-02-08 05:41:33,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:34,112 INFO L124 PetriNetUnfolderBase]: 98/844 cut-off events. [2025-02-08 05:41:34,113 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-02-08 05:41:34,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1029 conditions, 844 events. 98/844 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4983 event pairs, 54 based on Foata normal form. 0/698 useless extension candidates. Maximal degree in co-relation 969. Up to 144 conditions per place. [2025-02-08 05:41:34,117 INFO L140 encePairwiseOnDemand]: 223/234 looper letters, 23 selfloop transitions, 5 changer transitions 0/222 dead transitions. [2025-02-08 05:41:34,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 222 transitions, 510 flow [2025-02-08 05:41:34,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:34,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:34,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 643 transitions. [2025-02-08 05:41:34,119 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.915954415954416 [2025-02-08 05:41:34,119 INFO L175 Difference]: Start difference. First operand has 221 places, 221 transitions, 450 flow. Second operand 3 states and 643 transitions. [2025-02-08 05:41:34,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 222 transitions, 510 flow [2025-02-08 05:41:34,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 222 transitions, 506 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:41:34,150 INFO L231 Difference]: Finished difference. Result has 218 places, 219 transitions, 470 flow [2025-02-08 05:41:34,151 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=470, PETRI_PLACES=218, PETRI_TRANSITIONS=219} [2025-02-08 05:41:34,151 INFO L279 CegarLoopForPetriNet]: 226 programPoint places, -8 predicate places. [2025-02-08 05:41:34,151 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 219 transitions, 470 flow [2025-02-08 05:41:34,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 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:41:34,152 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:34,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, 1, 1, 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:41:34,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:41:34,152 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:41:34,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:34,153 INFO L85 PathProgramCache]: Analyzing trace with hash 620521145, now seen corresponding path program 1 times [2025-02-08 05:41:34,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:34,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132783237] [2025-02-08 05:41:34,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:34,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:34,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-08 05:41:34,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-08 05:41:34,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:34,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:34,207 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:41:34,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:34,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132783237] [2025-02-08 05:41:34,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132783237] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:34,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:34,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:34,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063668488] [2025-02-08 05:41:34,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:34,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:34,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:34,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:34,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:34,299 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 234 [2025-02-08 05:41:34,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 219 transitions, 470 flow. Second operand has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 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:41:34,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:34,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 234 [2025-02-08 05:41:34,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:34,448 INFO L124 PetriNetUnfolderBase]: 63/789 cut-off events. [2025-02-08 05:41:34,448 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-02-08 05:41:34,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 933 conditions, 789 events. 63/789 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4153 event pairs, 24 based on Foata normal form. 0/657 useless extension candidates. Maximal degree in co-relation 756. Up to 76 conditions per place. [2025-02-08 05:41:34,456 INFO L140 encePairwiseOnDemand]: 231/234 looper letters, 15 selfloop transitions, 2 changer transitions 0/218 dead transitions. [2025-02-08 05:41:34,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 218 transitions, 502 flow [2025-02-08 05:41:34,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:34,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:34,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 654 transitions. [2025-02-08 05:41:34,461 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9316239316239316 [2025-02-08 05:41:34,461 INFO L175 Difference]: Start difference. First operand has 218 places, 219 transitions, 470 flow. Second operand 3 states and 654 transitions. [2025-02-08 05:41:34,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 218 transitions, 502 flow [2025-02-08 05:41:34,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 218 transitions, 492 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:41:34,469 INFO L231 Difference]: Finished difference. Result has 217 places, 218 transitions, 462 flow [2025-02-08 05:41:34,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=462, PETRI_PLACES=217, PETRI_TRANSITIONS=218} [2025-02-08 05:41:34,470 INFO L279 CegarLoopForPetriNet]: 226 programPoint places, -9 predicate places. [2025-02-08 05:41:34,470 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 218 transitions, 462 flow [2025-02-08 05:41:34,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 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:41:34,470 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:34,471 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:34,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:41:34,471 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:41:34,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:34,471 INFO L85 PathProgramCache]: Analyzing trace with hash -230748269, now seen corresponding path program 1 times [2025-02-08 05:41:34,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:34,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106096221] [2025-02-08 05:41:34,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:34,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:34,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-08 05:41:34,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 05:41:34,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:34,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:34,542 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:41:34,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:34,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106096221] [2025-02-08 05:41:34,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106096221] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:34,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:34,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:34,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118332464] [2025-02-08 05:41:34,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:34,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:34,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:34,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:34,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:34,588 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 234 [2025-02-08 05:41:34,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 218 transitions, 462 flow. Second operand has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 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:41:34,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:34,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 234 [2025-02-08 05:41:34,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:34,700 INFO L124 PetriNetUnfolderBase]: 38/528 cut-off events. [2025-02-08 05:41:34,704 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:41:34,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 528 events. 38/528 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2054 event pairs, 13 based on Foata normal form. 0/444 useless extension candidates. Maximal degree in co-relation 540. Up to 40 conditions per place. [2025-02-08 05:41:34,707 INFO L140 encePairwiseOnDemand]: 231/234 looper letters, 11 selfloop transitions, 2 changer transitions 0/217 dead transitions. [2025-02-08 05:41:34,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 217 transitions, 486 flow [2025-02-08 05:41:34,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:34,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:34,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 659 transitions. [2025-02-08 05:41:34,709 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9387464387464387 [2025-02-08 05:41:34,709 INFO L175 Difference]: Start difference. First operand has 217 places, 218 transitions, 462 flow. Second operand 3 states and 659 transitions. [2025-02-08 05:41:34,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 217 transitions, 486 flow [2025-02-08 05:41:34,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 217 transitions, 482 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:41:34,711 INFO L231 Difference]: Finished difference. Result has 216 places, 217 transitions, 460 flow [2025-02-08 05:41:34,712 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=460, PETRI_PLACES=216, PETRI_TRANSITIONS=217} [2025-02-08 05:41:34,712 INFO L279 CegarLoopForPetriNet]: 226 programPoint places, -10 predicate places. [2025-02-08 05:41:34,712 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 217 transitions, 460 flow [2025-02-08 05:41:34,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 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:41:34,716 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:34,716 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] [2025-02-08 05:41:34,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:41:34,716 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:41:34,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:34,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1165834765, now seen corresponding path program 1 times [2025-02-08 05:41:34,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:34,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888151088] [2025-02-08 05:41:34,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:34,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:34,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-08 05:41:34,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 05:41:34,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:34,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:34,793 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:41:34,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:34,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888151088] [2025-02-08 05:41:34,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888151088] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:34,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:34,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:34,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828005834] [2025-02-08 05:41:34,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:34,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:34,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:34,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:34,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:34,842 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 234 [2025-02-08 05:41:34,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 217 transitions, 460 flow. Second operand has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 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:41:34,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:34,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 234 [2025-02-08 05:41:34,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:34,997 INFO L124 PetriNetUnfolderBase]: 42/596 cut-off events. [2025-02-08 05:41:34,997 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-08 05:41:34,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 678 conditions, 596 events. 42/596 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2549 event pairs, 13 based on Foata normal form. 0/501 useless extension candidates. Maximal degree in co-relation 603. Up to 42 conditions per place. [2025-02-08 05:41:35,001 INFO L140 encePairwiseOnDemand]: 231/234 looper letters, 11 selfloop transitions, 2 changer transitions 0/216 dead transitions. [2025-02-08 05:41:35,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 216 transitions, 484 flow [2025-02-08 05:41:35,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:35,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:35,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 659 transitions. [2025-02-08 05:41:35,007 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9387464387464387 [2025-02-08 05:41:35,007 INFO L175 Difference]: Start difference. First operand has 216 places, 217 transitions, 460 flow. Second operand 3 states and 659 transitions. [2025-02-08 05:41:35,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 216 transitions, 484 flow [2025-02-08 05:41:35,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 216 transitions, 480 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:41:35,014 INFO L231 Difference]: Finished difference. Result has 215 places, 216 transitions, 458 flow [2025-02-08 05:41:35,015 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=458, PETRI_PLACES=215, PETRI_TRANSITIONS=216} [2025-02-08 05:41:35,016 INFO L279 CegarLoopForPetriNet]: 226 programPoint places, -11 predicate places. [2025-02-08 05:41:35,019 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 216 transitions, 458 flow [2025-02-08 05:41:35,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 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:41:35,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:35,020 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:35,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:41:35,020 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:41:35,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:35,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1341619732, now seen corresponding path program 1 times [2025-02-08 05:41:35,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:35,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197086812] [2025-02-08 05:41:35,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:35,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:35,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 05:41:35,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 05:41:35,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:35,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:35,122 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:41:35,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:35,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197086812] [2025-02-08 05:41:35,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197086812] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:35,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:35,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:35,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970272275] [2025-02-08 05:41:35,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:35,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:35,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:35,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:35,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:35,147 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 234 [2025-02-08 05:41:35,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 216 transitions, 458 flow. Second operand has 3 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 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:41:35,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:35,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 234 [2025-02-08 05:41:35,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:35,228 INFO L124 PetriNetUnfolderBase]: 43/544 cut-off events. [2025-02-08 05:41:35,229 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:41:35,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 641 conditions, 544 events. 43/544 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2237 event pairs, 7 based on Foata normal form. 0/464 useless extension candidates. Maximal degree in co-relation 561. Up to 37 conditions per place. [2025-02-08 05:41:35,231 INFO L140 encePairwiseOnDemand]: 232/234 looper letters, 15 selfloop transitions, 1 changer transitions 0/221 dead transitions. [2025-02-08 05:41:35,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 221 transitions, 503 flow [2025-02-08 05:41:35,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:35,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:35,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 674 transitions. [2025-02-08 05:41:35,234 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9601139601139601 [2025-02-08 05:41:35,234 INFO L175 Difference]: Start difference. First operand has 215 places, 216 transitions, 458 flow. Second operand 3 states and 674 transitions. [2025-02-08 05:41:35,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 221 transitions, 503 flow [2025-02-08 05:41:35,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 221 transitions, 499 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:41:35,237 INFO L231 Difference]: Finished difference. Result has 215 places, 216 transitions, 459 flow [2025-02-08 05:41:35,237 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=459, PETRI_PLACES=215, PETRI_TRANSITIONS=216} [2025-02-08 05:41:35,239 INFO L279 CegarLoopForPetriNet]: 226 programPoint places, -11 predicate places. [2025-02-08 05:41:35,239 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 216 transitions, 459 flow [2025-02-08 05:41:35,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 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:41:35,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:35,239 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:35,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:41:35,240 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:41:35,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:35,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1472936916, now seen corresponding path program 1 times [2025-02-08 05:41:35,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:35,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128322151] [2025-02-08 05:41:35,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:35,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:35,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-08 05:41:35,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-08 05:41:35,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:35,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:35,286 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:41:35,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:35,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128322151] [2025-02-08 05:41:35,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128322151] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:35,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:35,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:35,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83918319] [2025-02-08 05:41:35,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:35,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:35,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:35,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:35,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:35,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 234 [2025-02-08 05:41:35,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 216 transitions, 459 flow. Second operand has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 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:41:35,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:35,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 234 [2025-02-08 05:41:35,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:35,370 INFO L124 PetriNetUnfolderBase]: 64/764 cut-off events. [2025-02-08 05:41:35,370 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-02-08 05:41:35,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 893 conditions, 764 events. 64/764 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4199 event pairs, 10 based on Foata normal form. 0/641 useless extension candidates. Maximal degree in co-relation 712. Up to 50 conditions per place. [2025-02-08 05:41:35,374 INFO L140 encePairwiseOnDemand]: 232/234 looper letters, 14 selfloop transitions, 1 changer transitions 0/220 dead transitions. [2025-02-08 05:41:35,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 220 transitions, 498 flow [2025-02-08 05:41:35,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:35,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:35,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 673 transitions. [2025-02-08 05:41:35,376 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9586894586894587 [2025-02-08 05:41:35,376 INFO L175 Difference]: Start difference. First operand has 215 places, 216 transitions, 459 flow. Second operand 3 states and 673 transitions. [2025-02-08 05:41:35,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 220 transitions, 498 flow [2025-02-08 05:41:35,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 220 transitions, 498 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:41:35,379 INFO L231 Difference]: Finished difference. Result has 217 places, 216 transitions, 464 flow [2025-02-08 05:41:35,379 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=464, PETRI_PLACES=217, PETRI_TRANSITIONS=216} [2025-02-08 05:41:35,380 INFO L279 CegarLoopForPetriNet]: 226 programPoint places, -9 predicate places. [2025-02-08 05:41:35,380 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 216 transitions, 464 flow [2025-02-08 05:41:35,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 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:41:35,380 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:35,381 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] [2025-02-08 05:41:35,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:41:35,381 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:41:35,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:35,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1432253226, now seen corresponding path program 1 times [2025-02-08 05:41:35,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:35,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814704855] [2025-02-08 05:41:35,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:35,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:35,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 05:41:35,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 05:41:35,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:35,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:35,418 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:41:35,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:35,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814704855] [2025-02-08 05:41:35,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814704855] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:35,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:35,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:35,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513381507] [2025-02-08 05:41:35,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:35,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:35,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:35,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:35,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:35,437 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 234 [2025-02-08 05:41:35,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 216 transitions, 464 flow. Second operand has 3 states, 3 states have (on average 208.66666666666666) internal successors, (626), 3 states have internal predecessors, (626), 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:41:35,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:35,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 234 [2025-02-08 05:41:35,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:35,546 INFO L124 PetriNetUnfolderBase]: 115/988 cut-off events. [2025-02-08 05:41:35,546 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-02-08 05:41:35,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1245 conditions, 988 events. 115/988 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 6245 event pairs, 36 based on Foata normal form. 0/855 useless extension candidates. Maximal degree in co-relation 1027. Up to 132 conditions per place. [2025-02-08 05:41:35,552 INFO L140 encePairwiseOnDemand]: 227/234 looper letters, 24 selfloop transitions, 2 changer transitions 0/219 dead transitions. [2025-02-08 05:41:35,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 219 transitions, 525 flow [2025-02-08 05:41:35,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:35,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:35,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 652 transitions. [2025-02-08 05:41:35,554 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9287749287749287 [2025-02-08 05:41:35,554 INFO L175 Difference]: Start difference. First operand has 217 places, 216 transitions, 464 flow. Second operand 3 states and 652 transitions. [2025-02-08 05:41:35,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 219 transitions, 525 flow [2025-02-08 05:41:35,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 219 transitions, 525 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:41:35,557 INFO L231 Difference]: Finished difference. Result has 215 places, 213 transitions, 468 flow [2025-02-08 05:41:35,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=468, PETRI_PLACES=215, PETRI_TRANSITIONS=213} [2025-02-08 05:41:35,558 INFO L279 CegarLoopForPetriNet]: 226 programPoint places, -11 predicate places. [2025-02-08 05:41:35,558 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 213 transitions, 468 flow [2025-02-08 05:41:35,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.66666666666666) internal successors, (626), 3 states have internal predecessors, (626), 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:41:35,558 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:35,558 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] [2025-02-08 05:41:35,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:41:35,559 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:41:35,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:35,559 INFO L85 PathProgramCache]: Analyzing trace with hash 412044025, now seen corresponding path program 1 times [2025-02-08 05:41:35,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:35,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697783008] [2025-02-08 05:41:35,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:35,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:35,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-08 05:41:35,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 05:41:35,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:35,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:35,620 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:41:35,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:35,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697783008] [2025-02-08 05:41:35,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697783008] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:35,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:35,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:35,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789955574] [2025-02-08 05:41:35,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:35,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:35,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:35,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:35,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:35,638 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 234 [2025-02-08 05:41:35,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 213 transitions, 468 flow. Second operand has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 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:41:35,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:35,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 234 [2025-02-08 05:41:35,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:35,714 INFO L124 PetriNetUnfolderBase]: 116/957 cut-off events. [2025-02-08 05:41:35,714 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-02-08 05:41:35,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1249 conditions, 957 events. 116/957 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 6213 event pairs, 31 based on Foata normal form. 0/862 useless extension candidates. Maximal degree in co-relation 1068. Up to 124 conditions per place. [2025-02-08 05:41:35,719 INFO L140 encePairwiseOnDemand]: 227/234 looper letters, 15 selfloop transitions, 4 changer transitions 0/214 dead transitions. [2025-02-08 05:41:35,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 214 transitions, 509 flow [2025-02-08 05:41:35,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:35,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:35,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 658 transitions. [2025-02-08 05:41:35,721 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9373219373219374 [2025-02-08 05:41:35,721 INFO L175 Difference]: Start difference. First operand has 215 places, 213 transitions, 468 flow. Second operand 3 states and 658 transitions. [2025-02-08 05:41:35,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 214 transitions, 509 flow [2025-02-08 05:41:35,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 214 transitions, 509 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:41:35,724 INFO L231 Difference]: Finished difference. Result has 215 places, 211 transitions, 478 flow [2025-02-08 05:41:35,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=478, PETRI_PLACES=215, PETRI_TRANSITIONS=211} [2025-02-08 05:41:35,725 INFO L279 CegarLoopForPetriNet]: 226 programPoint places, -11 predicate places. [2025-02-08 05:41:35,725 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 211 transitions, 478 flow [2025-02-08 05:41:35,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 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:41:35,725 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:35,726 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] [2025-02-08 05:41:35,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:41:35,726 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:41:35,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:35,726 INFO L85 PathProgramCache]: Analyzing trace with hash 2028623444, now seen corresponding path program 1 times [2025-02-08 05:41:35,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:35,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527769618] [2025-02-08 05:41:35,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:35,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:35,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-08 05:41:35,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-08 05:41:35,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:35,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:35,769 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:41:35,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:35,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527769618] [2025-02-08 05:41:35,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527769618] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:35,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:35,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:41:35,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196647196] [2025-02-08 05:41:35,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:35,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:35,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:35,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:35,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:35,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 234 [2025-02-08 05:41:35,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 211 transitions, 478 flow. Second operand has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 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:41:35,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:35,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 234 [2025-02-08 05:41:35,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:35,838 INFO L124 PetriNetUnfolderBase]: 82/689 cut-off events. [2025-02-08 05:41:35,838 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-02-08 05:41:35,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 946 conditions, 689 events. 82/689 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3499 event pairs, 48 based on Foata normal form. 0/622 useless extension candidates. Maximal degree in co-relation 771. Up to 110 conditions per place. [2025-02-08 05:41:35,842 INFO L140 encePairwiseOnDemand]: 230/234 looper letters, 17 selfloop transitions, 3 changer transitions 0/215 dead transitions. [2025-02-08 05:41:35,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 215 transitions, 528 flow [2025-02-08 05:41:35,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:35,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:35,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 663 transitions. [2025-02-08 05:41:35,843 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9444444444444444 [2025-02-08 05:41:35,843 INFO L175 Difference]: Start difference. First operand has 215 places, 211 transitions, 478 flow. Second operand 3 states and 663 transitions. [2025-02-08 05:41:35,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 215 transitions, 528 flow [2025-02-08 05:41:35,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 215 transitions, 524 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:41:35,846 INFO L231 Difference]: Finished difference. Result has 218 places, 212 transitions, 492 flow [2025-02-08 05:41:35,846 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=492, PETRI_PLACES=218, PETRI_TRANSITIONS=212} [2025-02-08 05:41:35,847 INFO L279 CegarLoopForPetriNet]: 226 programPoint places, -8 predicate places. [2025-02-08 05:41:35,847 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 212 transitions, 492 flow [2025-02-08 05:41:35,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 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:41:35,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:35,848 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] [2025-02-08 05:41:35,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:41:35,848 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:41:35,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:35,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1519641885, now seen corresponding path program 1 times [2025-02-08 05:41:35,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:35,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125919774] [2025-02-08 05:41:35,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:35,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:35,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-08 05:41:35,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-08 05:41:35,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:35,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:35,882 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:41:35,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:35,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125919774] [2025-02-08 05:41:35,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125919774] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:35,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:35,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:41:35,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052364276] [2025-02-08 05:41:35,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:35,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:35,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:35,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:35,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:35,893 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 234 [2025-02-08 05:41:35,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 212 transitions, 492 flow. Second operand has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 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:41:35,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:35,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 234 [2025-02-08 05:41:35,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:35,966 INFO L124 PetriNetUnfolderBase]: 110/973 cut-off events. [2025-02-08 05:41:35,967 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-02-08 05:41:35,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1358 conditions, 973 events. 110/973 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 5977 event pairs, 61 based on Foata normal form. 0/881 useless extension candidates. Maximal degree in co-relation 1265. Up to 153 conditions per place. [2025-02-08 05:41:35,971 INFO L140 encePairwiseOnDemand]: 230/234 looper letters, 16 selfloop transitions, 3 changer transitions 1/215 dead transitions. [2025-02-08 05:41:35,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 215 transitions, 537 flow [2025-02-08 05:41:35,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:35,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:35,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 663 transitions. [2025-02-08 05:41:35,972 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9444444444444444 [2025-02-08 05:41:35,972 INFO L175 Difference]: Start difference. First operand has 218 places, 212 transitions, 492 flow. Second operand 3 states and 663 transitions. [2025-02-08 05:41:35,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 215 transitions, 537 flow [2025-02-08 05:41:35,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 215 transitions, 523 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-02-08 05:41:35,976 INFO L231 Difference]: Finished difference. Result has 218 places, 212 transitions, 492 flow [2025-02-08 05:41:35,976 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=492, PETRI_PLACES=218, PETRI_TRANSITIONS=212} [2025-02-08 05:41:35,977 INFO L279 CegarLoopForPetriNet]: 226 programPoint places, -8 predicate places. [2025-02-08 05:41:35,977 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 212 transitions, 492 flow [2025-02-08 05:41:35,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 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:41:35,977 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:35,977 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] [2025-02-08 05:41:35,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:41:35,977 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:41:35,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:35,978 INFO L85 PathProgramCache]: Analyzing trace with hash -759774396, now seen corresponding path program 1 times [2025-02-08 05:41:35,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:35,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199133680] [2025-02-08 05:41:35,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:35,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:35,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-08 05:41:35,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-08 05:41:35,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:35,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:36,099 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:41:36,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:36,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199133680] [2025-02-08 05:41:36,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199133680] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:36,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:36,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:36,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331460090] [2025-02-08 05:41:36,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:36,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:36,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:36,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:36,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:36,166 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 234 [2025-02-08 05:41:36,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 212 transitions, 492 flow. Second operand has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 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:41:36,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:36,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 234 [2025-02-08 05:41:36,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:36,228 INFO L124 PetriNetUnfolderBase]: 84/706 cut-off events. [2025-02-08 05:41:36,228 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-02-08 05:41:36,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 990 conditions, 706 events. 84/706 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3658 event pairs, 46 based on Foata normal form. 0/645 useless extension candidates. Maximal degree in co-relation 934. Up to 112 conditions per place. [2025-02-08 05:41:36,231 INFO L140 encePairwiseOnDemand]: 229/234 looper letters, 20 selfloop transitions, 4 changer transitions 0/218 dead transitions. [2025-02-08 05:41:36,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 218 transitions, 554 flow [2025-02-08 05:41:36,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:36,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:36,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 661 transitions. [2025-02-08 05:41:36,233 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9415954415954416 [2025-02-08 05:41:36,233 INFO L175 Difference]: Start difference. First operand has 218 places, 212 transitions, 492 flow. Second operand 3 states and 661 transitions. [2025-02-08 05:41:36,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 218 transitions, 554 flow [2025-02-08 05:41:36,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 218 transitions, 548 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:41:36,237 INFO L231 Difference]: Finished difference. Result has 220 places, 215 transitions, 516 flow [2025-02-08 05:41:36,237 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=516, PETRI_PLACES=220, PETRI_TRANSITIONS=215} [2025-02-08 05:41:36,238 INFO L279 CegarLoopForPetriNet]: 226 programPoint places, -6 predicate places. [2025-02-08 05:41:36,238 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 215 transitions, 516 flow [2025-02-08 05:41:36,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 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:41:36,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:36,239 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] [2025-02-08 05:41:36,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:41:36,239 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:41:36,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:36,240 INFO L85 PathProgramCache]: Analyzing trace with hash 2057023479, now seen corresponding path program 1 times [2025-02-08 05:41:36,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:36,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352161627] [2025-02-08 05:41:36,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:36,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:36,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-08 05:41:36,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-08 05:41:36,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:36,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:36,276 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:41:36,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:36,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352161627] [2025-02-08 05:41:36,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352161627] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:36,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:36,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:36,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225302223] [2025-02-08 05:41:36,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:36,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:36,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:36,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:36,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:36,295 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 234 [2025-02-08 05:41:36,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 215 transitions, 516 flow. Second operand has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 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:41:36,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:36,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 234 [2025-02-08 05:41:36,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:36,366 INFO L124 PetriNetUnfolderBase]: 100/920 cut-off events. [2025-02-08 05:41:36,366 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-02-08 05:41:36,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1290 conditions, 920 events. 100/920 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 5440 event pairs, 53 based on Foata normal form. 0/844 useless extension candidates. Maximal degree in co-relation 1095. Up to 128 conditions per place. [2025-02-08 05:41:36,371 INFO L140 encePairwiseOnDemand]: 231/234 looper letters, 17 selfloop transitions, 2 changer transitions 0/217 dead transitions. [2025-02-08 05:41:36,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 217 transitions, 559 flow [2025-02-08 05:41:36,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:36,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:36,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 659 transitions. [2025-02-08 05:41:36,372 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9387464387464387 [2025-02-08 05:41:36,372 INFO L175 Difference]: Start difference. First operand has 220 places, 215 transitions, 516 flow. Second operand 3 states and 659 transitions. [2025-02-08 05:41:36,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 217 transitions, 559 flow [2025-02-08 05:41:36,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 217 transitions, 551 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:41:36,376 INFO L231 Difference]: Finished difference. Result has 219 places, 214 transitions, 510 flow [2025-02-08 05:41:36,377 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=510, PETRI_PLACES=219, PETRI_TRANSITIONS=214} [2025-02-08 05:41:36,378 INFO L279 CegarLoopForPetriNet]: 226 programPoint places, -7 predicate places. [2025-02-08 05:41:36,378 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 214 transitions, 510 flow [2025-02-08 05:41:36,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 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:41:36,378 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:36,378 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] [2025-02-08 05:41:36,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:41:36,379 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:41:36,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:36,379 INFO L85 PathProgramCache]: Analyzing trace with hash 2014927508, now seen corresponding path program 1 times [2025-02-08 05:41:36,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:36,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922454867] [2025-02-08 05:41:36,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:36,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:36,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-08 05:41:36,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-08 05:41:36,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:36,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:36,436 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:41:36,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:36,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922454867] [2025-02-08 05:41:36,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922454867] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:36,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:36,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:36,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298553685] [2025-02-08 05:41:36,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:36,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:36,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:36,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:36,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:36,470 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 234 [2025-02-08 05:41:36,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 214 transitions, 510 flow. Second operand has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 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:41:36,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:36,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 234 [2025-02-08 05:41:36,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:36,544 INFO L124 PetriNetUnfolderBase]: 107/843 cut-off events. [2025-02-08 05:41:36,544 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-02-08 05:41:36,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1253 conditions, 843 events. 107/843 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 4664 event pairs, 60 based on Foata normal form. 0/789 useless extension candidates. Maximal degree in co-relation 1094. Up to 152 conditions per place. [2025-02-08 05:41:36,548 INFO L140 encePairwiseOnDemand]: 229/234 looper letters, 24 selfloop transitions, 4 changer transitions 0/220 dead transitions. [2025-02-08 05:41:36,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 220 transitions, 582 flow [2025-02-08 05:41:36,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:36,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:36,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 657 transitions. [2025-02-08 05:41:36,550 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9358974358974359 [2025-02-08 05:41:36,550 INFO L175 Difference]: Start difference. First operand has 219 places, 214 transitions, 510 flow. Second operand 3 states and 657 transitions. [2025-02-08 05:41:36,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 220 transitions, 582 flow [2025-02-08 05:41:36,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 220 transitions, 578 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:41:36,554 INFO L231 Difference]: Finished difference. Result has 221 places, 217 transitions, 538 flow [2025-02-08 05:41:36,555 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=538, PETRI_PLACES=221, PETRI_TRANSITIONS=217} [2025-02-08 05:41:36,555 INFO L279 CegarLoopForPetriNet]: 226 programPoint places, -5 predicate places. [2025-02-08 05:41:36,555 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 217 transitions, 538 flow [2025-02-08 05:41:36,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 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:41:36,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:36,556 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:36,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:41:36,556 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:41:36,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:36,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1121928941, now seen corresponding path program 1 times [2025-02-08 05:41:36,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:36,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256822199] [2025-02-08 05:41:36,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:36,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:36,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-08 05:41:36,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-08 05:41:36,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:36,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:36,695 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:41:36,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:36,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256822199] [2025-02-08 05:41:36,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256822199] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:36,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:36,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:36,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230915655] [2025-02-08 05:41:36,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:36,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:36,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:36,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:36,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:36,743 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 234 [2025-02-08 05:41:36,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 217 transitions, 538 flow. Second operand has 3 states, 3 states have (on average 218.0) internal successors, (654), 3 states have internal predecessors, (654), 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:41:36,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:36,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 234 [2025-02-08 05:41:36,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:36,814 INFO L124 PetriNetUnfolderBase]: 71/840 cut-off events. [2025-02-08 05:41:36,814 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2025-02-08 05:41:36,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1215 conditions, 840 events. 71/840 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4529 event pairs, 30 based on Foata normal form. 0/789 useless extension candidates. Maximal degree in co-relation 1010. Up to 81 conditions per place. [2025-02-08 05:41:36,817 INFO L140 encePairwiseOnDemand]: 230/234 looper letters, 16 selfloop transitions, 3 changer transitions 2/222 dead transitions. [2025-02-08 05:41:36,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 222 transitions, 593 flow [2025-02-08 05:41:36,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:36,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:36,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 666 transitions. [2025-02-08 05:41:36,819 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9487179487179487 [2025-02-08 05:41:36,819 INFO L175 Difference]: Start difference. First operand has 221 places, 217 transitions, 538 flow. Second operand 3 states and 666 transitions. [2025-02-08 05:41:36,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 222 transitions, 593 flow [2025-02-08 05:41:36,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 222 transitions, 585 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:41:36,823 INFO L231 Difference]: Finished difference. Result has 223 places, 218 transitions, 552 flow [2025-02-08 05:41:36,823 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=552, PETRI_PLACES=223, PETRI_TRANSITIONS=218} [2025-02-08 05:41:36,823 INFO L279 CegarLoopForPetriNet]: 226 programPoint places, -3 predicate places. [2025-02-08 05:41:36,823 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 218 transitions, 552 flow [2025-02-08 05:41:36,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.0) internal successors, (654), 3 states have internal predecessors, (654), 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:41:36,824 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:36,824 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:36,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:41:36,824 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:41:36,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:36,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1671927953, now seen corresponding path program 1 times [2025-02-08 05:41:36,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:36,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125326448] [2025-02-08 05:41:36,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:36,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:36,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-08 05:41:36,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-08 05:41:36,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:36,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:36,949 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:41:36,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:36,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125326448] [2025-02-08 05:41:36,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125326448] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:36,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:36,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:41:36,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773539078] [2025-02-08 05:41:36,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:36,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:36,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:36,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:36,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:36,963 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 234 [2025-02-08 05:41:36,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 218 transitions, 552 flow. Second operand has 3 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 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:41:36,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:36,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 234 [2025-02-08 05:41:36,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:37,000 INFO L124 PetriNetUnfolderBase]: 23/490 cut-off events. [2025-02-08 05:41:37,000 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-02-08 05:41:37,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 673 conditions, 490 events. 23/490 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2079 event pairs, 4 based on Foata normal form. 8/475 useless extension candidates. Maximal degree in co-relation 629. Up to 20 conditions per place. [2025-02-08 05:41:37,001 INFO L140 encePairwiseOnDemand]: 230/234 looper letters, 0 selfloop transitions, 0 changer transitions 204/204 dead transitions. [2025-02-08 05:41:37,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 204 transitions, 505 flow [2025-02-08 05:41:37,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:37,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:37,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 676 transitions. [2025-02-08 05:41:37,002 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9629629629629629 [2025-02-08 05:41:37,003 INFO L175 Difference]: Start difference. First operand has 223 places, 218 transitions, 552 flow. Second operand 3 states and 676 transitions. [2025-02-08 05:41:37,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 204 transitions, 505 flow [2025-02-08 05:41:37,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 204 transitions, 472 flow, removed 7 selfloop flow, removed 10 redundant places. [2025-02-08 05:41:37,004 INFO L231 Difference]: Finished difference. Result has 211 places, 0 transitions, 0 flow [2025-02-08 05:41:37,005 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=211, PETRI_TRANSITIONS=0} [2025-02-08 05:41:37,005 INFO L279 CegarLoopForPetriNet]: 226 programPoint places, -15 predicate places. [2025-02-08 05:41:37,005 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 0 transitions, 0 flow [2025-02-08 05:41:37,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 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:41:37,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (45 of 46 remaining) [2025-02-08 05:41:37,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (44 of 46 remaining) [2025-02-08 05:41:37,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (43 of 46 remaining) [2025-02-08 05:41:37,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (42 of 46 remaining) [2025-02-08 05:41:37,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (41 of 46 remaining) [2025-02-08 05:41:37,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (40 of 46 remaining) [2025-02-08 05:41:37,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 46 remaining) [2025-02-08 05:41:37,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 46 remaining) [2025-02-08 05:41:37,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err13ASSERT_VIOLATIONDATA_RACE (37 of 46 remaining) [2025-02-08 05:41:37,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err12ASSERT_VIOLATIONDATA_RACE (36 of 46 remaining) [2025-02-08 05:41:37,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err11ASSERT_VIOLATIONDATA_RACE (35 of 46 remaining) [2025-02-08 05:41:37,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err10ASSERT_VIOLATIONDATA_RACE (34 of 46 remaining) [2025-02-08 05:41:37,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err9ASSERT_VIOLATIONDATA_RACE (33 of 46 remaining) [2025-02-08 05:41:37,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err8ASSERT_VIOLATIONDATA_RACE (32 of 46 remaining) [2025-02-08 05:41:37,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err7ASSERT_VIOLATIONDATA_RACE (31 of 46 remaining) [2025-02-08 05:41:37,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err6ASSERT_VIOLATIONDATA_RACE (30 of 46 remaining) [2025-02-08 05:41:37,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err5ASSERT_VIOLATIONDATA_RACE (29 of 46 remaining) [2025-02-08 05:41:37,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (28 of 46 remaining) [2025-02-08 05:41:37,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONDATA_RACE (27 of 46 remaining) [2025-02-08 05:41:37,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err10ASSERT_VIOLATIONDATA_RACE (26 of 46 remaining) [2025-02-08 05:41:37,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err9ASSERT_VIOLATIONDATA_RACE (25 of 46 remaining) [2025-02-08 05:41:37,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err8ASSERT_VIOLATIONDATA_RACE (24 of 46 remaining) [2025-02-08 05:41:37,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err7ASSERT_VIOLATIONDATA_RACE (23 of 46 remaining) [2025-02-08 05:41:37,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err6ASSERT_VIOLATIONDATA_RACE (22 of 46 remaining) [2025-02-08 05:41:37,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (21 of 46 remaining) [2025-02-08 05:41:37,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (20 of 46 remaining) [2025-02-08 05:41:37,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONDATA_RACE (19 of 46 remaining) [2025-02-08 05:41:37,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err13ASSERT_VIOLATIONDATA_RACE (18 of 46 remaining) [2025-02-08 05:41:37,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err12ASSERT_VIOLATIONDATA_RACE (17 of 46 remaining) [2025-02-08 05:41:37,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err11ASSERT_VIOLATIONDATA_RACE (16 of 46 remaining) [2025-02-08 05:41:37,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err10ASSERT_VIOLATIONDATA_RACE (15 of 46 remaining) [2025-02-08 05:41:37,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err9ASSERT_VIOLATIONDATA_RACE (14 of 46 remaining) [2025-02-08 05:41:37,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err8ASSERT_VIOLATIONDATA_RACE (13 of 46 remaining) [2025-02-08 05:41:37,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err7ASSERT_VIOLATIONDATA_RACE (12 of 46 remaining) [2025-02-08 05:41:37,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err6ASSERT_VIOLATIONDATA_RACE (11 of 46 remaining) [2025-02-08 05:41:37,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err5ASSERT_VIOLATIONDATA_RACE (10 of 46 remaining) [2025-02-08 05:41:37,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (9 of 46 remaining) [2025-02-08 05:41:37,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONDATA_RACE (8 of 46 remaining) [2025-02-08 05:41:37,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err10ASSERT_VIOLATIONDATA_RACE (7 of 46 remaining) [2025-02-08 05:41:37,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err9ASSERT_VIOLATIONDATA_RACE (6 of 46 remaining) [2025-02-08 05:41:37,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err8ASSERT_VIOLATIONDATA_RACE (5 of 46 remaining) [2025-02-08 05:41:37,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err7ASSERT_VIOLATIONDATA_RACE (4 of 46 remaining) [2025-02-08 05:41:37,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err6ASSERT_VIOLATIONDATA_RACE (3 of 46 remaining) [2025-02-08 05:41:37,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (2 of 46 remaining) [2025-02-08 05:41:37,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (1 of 46 remaining) [2025-02-08 05:41:37,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONDATA_RACE (0 of 46 remaining) [2025-02-08 05:41:37,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:41:37,011 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:37,015 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:41:37,015 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:41:37,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:41:37 BasicIcfg [2025-02-08 05:41:37,021 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:41:37,021 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:41:37,021 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:41:37,022 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:41:37,022 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:41:32" (3/4) ... [2025-02-08 05:41:37,023 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:41:37,025 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t1 [2025-02-08 05:41:37,026 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t2 [2025-02-08 05:41:37,028 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-02-08 05:41:37,029 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:41:37,029 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:41:37,029 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:41:37,079 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:41:37,079 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:41:37,079 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:41:37,080 INFO L158 Benchmark]: Toolchain (without parser) took 5306.80ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 103.5MB in the beginning and 192.8MB in the end (delta: -89.4MB). Peak memory consumption was 130.4MB. Max. memory is 16.1GB. [2025-02-08 05:41:37,080 INFO L158 Benchmark]: CDTParser took 0.75ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:41:37,080 INFO L158 Benchmark]: CACSL2BoogieTranslator took 374.41ms. Allocated memory is still 142.6MB. Free memory was 103.5MB in the beginning and 82.5MB in the end (delta: 20.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 05:41:37,080 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.76ms. Allocated memory is still 142.6MB. Free memory was 82.5MB in the beginning and 80.1MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:41:37,080 INFO L158 Benchmark]: Boogie Preprocessor took 27.04ms. Allocated memory is still 142.6MB. Free memory was 80.1MB in the beginning and 78.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:41:37,081 INFO L158 Benchmark]: IcfgBuilder took 538.13ms. Allocated memory is still 142.6MB. Free memory was 78.8MB in the beginning and 52.8MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 05:41:37,081 INFO L158 Benchmark]: TraceAbstraction took 4255.42ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 52.1MB in the beginning and 197.4MB in the end (delta: -145.3MB). Peak memory consumption was 71.7MB. Max. memory is 16.1GB. [2025-02-08 05:41:37,081 INFO L158 Benchmark]: Witness Printer took 57.88ms. Allocated memory is still 360.7MB. Free memory was 197.4MB in the beginning and 192.8MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:41:37,082 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.75ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 374.41ms. Allocated memory is still 142.6MB. Free memory was 103.5MB in the beginning and 82.5MB in the end (delta: 20.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.76ms. Allocated memory is still 142.6MB. Free memory was 82.5MB in the beginning and 80.1MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.04ms. Allocated memory is still 142.6MB. Free memory was 80.1MB in the beginning and 78.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 538.13ms. Allocated memory is still 142.6MB. Free memory was 78.8MB in the beginning and 52.8MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4255.42ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 52.1MB in the beginning and 197.4MB in the end (delta: -145.3MB). Peak memory consumption was 71.7MB. Max. memory is 16.1GB. * Witness Printer took 57.88ms. Allocated memory is still 360.7MB. Free memory was 197.4MB in the beginning and 192.8MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 691]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 692]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 692]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 692]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 761]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 762]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 728]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 708]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 708]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 708]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 710]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 710]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 711]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 711]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 711]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 713]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 713]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 746]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 696]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 696]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 696]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 698]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 698]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 699]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 699]: 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, 359 locations, 46 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: 4.1s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 553 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 185 mSDsluCounter, 133 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 685 IncrementalHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 133 mSDtfsCounter, 685 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=552occurred in iteration=16, InterpolantAutomatonStates: 51, 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.9s InterpolantComputationTime, 1506 NumberOfCodeBlocks, 1506 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1489 ConstructedInterpolants, 0 QuantifiedInterpolants, 1678 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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 31 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:41:37,095 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