./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-array-int-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-array-int-symm.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8a0558934008acf79b7e5b205fa256c568a1b783af274566f36b253458639325 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:37:06,170 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:37:06,229 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:37:06,232 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:37:06,232 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:37:06,246 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:37:06,247 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:37:06,247 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:37:06,248 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:37:06,248 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:37:06,248 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:37:06,248 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:37:06,248 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:37:06,248 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:37:06,248 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:37:06,248 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:37:06,249 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:37:06,249 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:37:06,249 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:37:06,249 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:37:06,249 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:37:06,249 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:37:06,249 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:37:06,249 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:37:06,249 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:37:06,249 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:37:06,249 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:37:06,249 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:37:06,249 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:37:06,250 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:37:06,250 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:37:06,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:37:06,250 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:37:06,250 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:37:06,250 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:37:06,250 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:37:06,250 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:37:06,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:37:06,250 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:37:06,250 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:37:06,250 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:37:06,251 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:37:06,251 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 -> 8a0558934008acf79b7e5b205fa256c568a1b783af274566f36b253458639325 [2025-02-08 05:37:06,485 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:37:06,492 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:37:06,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:37:06,496 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:37:06,496 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:37:06,497 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-array-int-symm.wvr.c [2025-02-08 05:37:07,725 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2eba5fed4/5c25848a7aaa4ef1884bb8289b6671a5/FLAG9ea2fef07 [2025-02-08 05:37:07,966 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:37:07,967 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-symm.wvr.c [2025-02-08 05:37:07,987 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2eba5fed4/5c25848a7aaa4ef1884bb8289b6671a5/FLAG9ea2fef07 [2025-02-08 05:37:08,296 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2eba5fed4/5c25848a7aaa4ef1884bb8289b6671a5 [2025-02-08 05:37:08,297 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:37:08,298 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:37:08,299 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:08,299 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:37:08,302 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:37:08,303 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:08" (1/1) ... [2025-02-08 05:37:08,305 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51a1e95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:08, skipping insertion in model container [2025-02-08 05:37:08,305 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:08" (1/1) ... [2025-02-08 05:37:08,319 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:37:08,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:08,468 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:37:08,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:08,510 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:37:08,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:08 WrapperNode [2025-02-08 05:37:08,511 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:08,511 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:08,512 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:37:08,512 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:37:08,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:08" (1/1) ... [2025-02-08 05:37:08,527 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:08" (1/1) ... [2025-02-08 05:37:08,553 INFO L138 Inliner]: procedures = 24, calls = 30, calls flagged for inlining = 14, calls inlined = 18, statements flattened = 343 [2025-02-08 05:37:08,557 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:08,557 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:37:08,557 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:37:08,557 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:37:08,566 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:08" (1/1) ... [2025-02-08 05:37:08,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:08" (1/1) ... [2025-02-08 05:37:08,569 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:08" (1/1) ... [2025-02-08 05:37:08,570 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:08" (1/1) ... [2025-02-08 05:37:08,579 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:08" (1/1) ... [2025-02-08 05:37:08,581 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:08" (1/1) ... [2025-02-08 05:37:08,582 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:08" (1/1) ... [2025-02-08 05:37:08,583 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:08" (1/1) ... [2025-02-08 05:37:08,585 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:37:08,586 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:37:08,586 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:37:08,586 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:37:08,587 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:08" (1/1) ... [2025-02-08 05:37:08,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:37:08,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:37:08,619 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:37:08,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:37:08,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:37:08,643 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:37:08,643 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:37:08,643 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:37:08,643 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:37:08,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:37:08,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:37:08,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:37:08,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:37:08,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:37:08,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:37:08,644 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:37:08,718 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:37:08,720 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:37:08,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52: havoc #t~nondet8#1; [2025-02-08 05:37:08,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-1: havoc #t~ret7#1; [2025-02-08 05:37:08,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-2: havoc #t~mem6#1; [2025-02-08 05:37:08,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-3: assume #race~res1~0 == #t~nondet8#1; [2025-02-08 05:37:08,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-3: assume !(#race~res1~0 == #t~nondet8#1); [2025-02-08 05:37:08,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-4: havoc #t~mem5#1; [2025-02-08 05:37:08,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-5: #race~res1~0 := #t~nondet8#1; [2025-02-08 05:37:08,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-6: havoc #t~nondet8#1; [2025-02-08 05:37:08,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-7: ~res1~0 := #t~ret7#1; [2025-02-08 05:37:08,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-8: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret7#1 && #t~ret7#1 <= 2147483647; [2025-02-08 05:37:08,971 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-9: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:08,971 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-10: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:08,971 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-11: #t~ret7#1 := minus_#res#1; [2025-02-08 05:37:09,062 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66: havoc #t~nondet17#1; [2025-02-08 05:37:09,062 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-1: havoc #t~ret16#1; [2025-02-08 05:37:09,062 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-2: havoc #t~mem15#1; [2025-02-08 05:37:09,062 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-3: assume #race~res2~0 == #t~nondet17#1; [2025-02-08 05:37:09,062 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-3: assume !(#race~res2~0 == #t~nondet17#1); [2025-02-08 05:37:09,062 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-4: havoc #t~mem14#1; [2025-02-08 05:37:09,062 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-5: #race~res2~0 := #t~nondet17#1; [2025-02-08 05:37:09,062 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-6: havoc #t~nondet17#1; [2025-02-08 05:37:09,062 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-7: ~res2~0 := #t~ret16#1; [2025-02-08 05:37:09,062 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-8: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret16#1 && #t~ret16#1 <= 2147483647; [2025-02-08 05:37:09,062 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-9: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:09,063 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-10: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:09,063 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-11: #t~ret16#1 := minus_#res#1; [2025-02-08 05:37:09,205 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:37:09,205 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:37:09,219 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:37:09,219 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:37:09,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:09 BoogieIcfgContainer [2025-02-08 05:37:09,220 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:37:09,221 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:37:09,221 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:37:09,225 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:37:09,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:37:08" (1/3) ... [2025-02-08 05:37:09,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1612a3e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:09, skipping insertion in model container [2025-02-08 05:37:09,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:08" (2/3) ... [2025-02-08 05:37:09,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1612a3e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:09, skipping insertion in model container [2025-02-08 05:37:09,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:09" (3/3) ... [2025-02-08 05:37:09,226 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-array-int-symm.wvr.c [2025-02-08 05:37:09,236 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:37:09,237 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-array-int-symm.wvr.c that has 3 procedures, 410 locations, 1 initial locations, 4 loop locations, and 42 error locations. [2025-02-08 05:37:09,237 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:37:09,370 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:37:09,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 416 places, 431 transitions, 876 flow [2025-02-08 05:37:09,496 INFO L124 PetriNetUnfolderBase]: 22/429 cut-off events. [2025-02-08 05:37:09,497 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:37:09,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 429 events. 22/429 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 858 event pairs, 0 based on Foata normal form. 0/365 useless extension candidates. Maximal degree in co-relation 259. Up to 2 conditions per place. [2025-02-08 05:37:09,503 INFO L82 GeneralOperation]: Start removeDead. Operand has 416 places, 431 transitions, 876 flow [2025-02-08 05:37:09,508 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 396 places, 409 transitions, 830 flow [2025-02-08 05:37:09,513 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:37:09,527 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;@5b3d7033, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:37:09,527 INFO L334 AbstractCegarLoop]: Starting to check reachability of 68 error locations. [2025-02-08 05:37:09,531 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:37:09,531 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-02-08 05:37:09,531 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:37:09,531 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:09,532 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:09,532 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:37:09,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:09,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1671404235, now seen corresponding path program 1 times [2025-02-08 05:37:09,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:09,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811040220] [2025-02-08 05:37:09,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:09,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:09,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 05:37:09,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 05:37:09,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:09,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:09,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:09,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:09,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811040220] [2025-02-08 05:37:09,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811040220] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:09,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:09,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:09,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802202934] [2025-02-08 05:37:09,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:09,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:09,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:09,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:09,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:09,734 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 401 out of 431 [2025-02-08 05:37:09,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 409 transitions, 830 flow. Second operand has 3 states, 3 states have (on average 402.3333333333333) internal successors, (1207), 3 states have internal predecessors, (1207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:09,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:09,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 401 of 431 [2025-02-08 05:37:09,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:09,851 INFO L124 PetriNetUnfolderBase]: 22/697 cut-off events. [2025-02-08 05:37:09,851 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-02-08 05:37:09,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 743 conditions, 697 events. 22/697 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2674 event pairs, 8 based on Foata normal form. 16/598 useless extension candidates. Maximal degree in co-relation 526. Up to 29 conditions per place. [2025-02-08 05:37:09,856 INFO L140 encePairwiseOnDemand]: 416/431 looper letters, 12 selfloop transitions, 2 changer transitions 6/396 dead transitions. [2025-02-08 05:37:09,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 396 transitions, 832 flow [2025-02-08 05:37:09,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:09,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:09,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1230 transitions. [2025-02-08 05:37:09,868 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.951276102088167 [2025-02-08 05:37:09,869 INFO L175 Difference]: Start difference. First operand has 396 places, 409 transitions, 830 flow. Second operand 3 states and 1230 transitions. [2025-02-08 05:37:09,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 396 transitions, 832 flow [2025-02-08 05:37:09,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 396 transitions, 824 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:37:09,879 INFO L231 Difference]: Finished difference. Result has 393 places, 390 transitions, 788 flow [2025-02-08 05:37:09,881 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=796, PETRI_DIFFERENCE_MINUEND_PLACES=391, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=788, PETRI_PLACES=393, PETRI_TRANSITIONS=390} [2025-02-08 05:37:09,884 INFO L279 CegarLoopForPetriNet]: 396 programPoint places, -3 predicate places. [2025-02-08 05:37:09,884 INFO L471 AbstractCegarLoop]: Abstraction has has 393 places, 390 transitions, 788 flow [2025-02-08 05:37:09,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 402.3333333333333) internal successors, (1207), 3 states have internal predecessors, (1207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:09,885 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:09,885 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:09,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:37:09,885 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:37:09,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:09,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1177997293, now seen corresponding path program 1 times [2025-02-08 05:37:09,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:09,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372580332] [2025-02-08 05:37:09,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:09,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:09,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 05:37:09,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 05:37:09,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:09,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:09,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:09,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:09,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372580332] [2025-02-08 05:37:09,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372580332] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:09,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:09,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:09,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318990766] [2025-02-08 05:37:09,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:09,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:09,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:09,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:09,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:09,944 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 401 out of 431 [2025-02-08 05:37:09,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 390 transitions, 788 flow. Second operand has 3 states, 3 states have (on average 402.3333333333333) internal successors, (1207), 3 states have internal predecessors, (1207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:09,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:09,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 401 of 431 [2025-02-08 05:37:09,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:10,016 INFO L124 PetriNetUnfolderBase]: 22/681 cut-off events. [2025-02-08 05:37:10,016 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:37:10,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 720 conditions, 681 events. 22/681 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2644 event pairs, 8 based on Foata normal form. 0/577 useless extension candidates. Maximal degree in co-relation 690. Up to 29 conditions per place. [2025-02-08 05:37:10,022 INFO L140 encePairwiseOnDemand]: 428/431 looper letters, 12 selfloop transitions, 2 changer transitions 0/389 dead transitions. [2025-02-08 05:37:10,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 389 transitions, 814 flow [2025-02-08 05:37:10,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:10,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:10,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1218 transitions. [2025-02-08 05:37:10,025 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9419953596287703 [2025-02-08 05:37:10,025 INFO L175 Difference]: Start difference. First operand has 393 places, 390 transitions, 788 flow. Second operand 3 states and 1218 transitions. [2025-02-08 05:37:10,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 389 transitions, 814 flow [2025-02-08 05:37:10,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 389 transitions, 810 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:10,032 INFO L231 Difference]: Finished difference. Result has 386 places, 389 transitions, 786 flow [2025-02-08 05:37:10,033 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=384, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=786, PETRI_PLACES=386, PETRI_TRANSITIONS=389} [2025-02-08 05:37:10,033 INFO L279 CegarLoopForPetriNet]: 396 programPoint places, -10 predicate places. [2025-02-08 05:37:10,033 INFO L471 AbstractCegarLoop]: Abstraction has has 386 places, 389 transitions, 786 flow [2025-02-08 05:37:10,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 402.3333333333333) internal successors, (1207), 3 states have internal predecessors, (1207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:10,034 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:10,034 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:10,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:37:10,035 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:37:10,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:10,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1405303657, now seen corresponding path program 1 times [2025-02-08 05:37:10,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:10,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626693519] [2025-02-08 05:37:10,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:10,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:10,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 05:37:10,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 05:37:10,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:10,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:10,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:10,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:10,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626693519] [2025-02-08 05:37:10,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626693519] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:10,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:10,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:10,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213798278] [2025-02-08 05:37:10,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:10,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:10,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:10,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:10,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:10,115 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 431 [2025-02-08 05:37:10,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 389 transitions, 786 flow. Second operand has 3 states, 3 states have (on average 398.0) internal successors, (1194), 3 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:10,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:10,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 431 [2025-02-08 05:37:10,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:10,260 INFO L124 PetriNetUnfolderBase]: 51/1211 cut-off events. [2025-02-08 05:37:10,261 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:37:10,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1290 conditions, 1211 events. 51/1211 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 6936 event pairs, 24 based on Foata normal form. 0/1024 useless extension candidates. Maximal degree in co-relation 1252. Up to 67 conditions per place. [2025-02-08 05:37:10,267 INFO L140 encePairwiseOnDemand]: 425/431 looper letters, 14 selfloop transitions, 1 changer transitions 0/384 dead transitions. [2025-02-08 05:37:10,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 384 transitions, 806 flow [2025-02-08 05:37:10,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:10,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:10,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1211 transitions. [2025-02-08 05:37:10,270 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9365815931941222 [2025-02-08 05:37:10,270 INFO L175 Difference]: Start difference. First operand has 386 places, 389 transitions, 786 flow. Second operand 3 states and 1211 transitions. [2025-02-08 05:37:10,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 384 transitions, 806 flow [2025-02-08 05:37:10,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 384 transitions, 802 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:10,275 INFO L231 Difference]: Finished difference. Result has 381 places, 384 transitions, 774 flow [2025-02-08 05:37:10,276 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=774, PETRI_PLACES=381, PETRI_TRANSITIONS=384} [2025-02-08 05:37:10,276 INFO L279 CegarLoopForPetriNet]: 396 programPoint places, -15 predicate places. [2025-02-08 05:37:10,276 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 384 transitions, 774 flow [2025-02-08 05:37:10,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 398.0) internal successors, (1194), 3 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:10,277 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:10,277 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:10,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:37:10,277 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:37:10,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:10,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1666555470, now seen corresponding path program 1 times [2025-02-08 05:37:10,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:10,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163287665] [2025-02-08 05:37:10,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:10,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:10,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-08 05:37:10,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-08 05:37:10,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:10,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:10,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:10,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:10,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163287665] [2025-02-08 05:37:10,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163287665] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:10,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:10,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:10,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939547468] [2025-02-08 05:37:10,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:10,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:10,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:10,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:10,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:11,119 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 353 out of 431 [2025-02-08 05:37:11,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 384 transitions, 774 flow. Second operand has 6 states, 6 states have (on average 354.5) internal successors, (2127), 6 states have internal predecessors, (2127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:11,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:11,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 353 of 431 [2025-02-08 05:37:11,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:11,570 INFO L124 PetriNetUnfolderBase]: 364/2454 cut-off events. [2025-02-08 05:37:11,570 INFO L125 PetriNetUnfolderBase]: For 35/36 co-relation queries the response was YES. [2025-02-08 05:37:11,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3165 conditions, 2454 events. 364/2454 cut-off events. For 35/36 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 18418 event pairs, 288 based on Foata normal form. 0/2089 useless extension candidates. Maximal degree in co-relation 3128. Up to 680 conditions per place. [2025-02-08 05:37:11,583 INFO L140 encePairwiseOnDemand]: 419/431 looper letters, 52 selfloop transitions, 10 changer transitions 0/382 dead transitions. [2025-02-08 05:37:11,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 382 transitions, 894 flow [2025-02-08 05:37:11,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:11,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:11,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2182 transitions. [2025-02-08 05:37:11,588 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8437741686001546 [2025-02-08 05:37:11,588 INFO L175 Difference]: Start difference. First operand has 381 places, 384 transitions, 774 flow. Second operand 6 states and 2182 transitions. [2025-02-08 05:37:11,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 382 transitions, 894 flow [2025-02-08 05:37:11,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 382 transitions, 893 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:11,592 INFO L231 Difference]: Finished difference. Result has 383 places, 382 transitions, 789 flow [2025-02-08 05:37:11,593 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=789, PETRI_PLACES=383, PETRI_TRANSITIONS=382} [2025-02-08 05:37:11,594 INFO L279 CegarLoopForPetriNet]: 396 programPoint places, -13 predicate places. [2025-02-08 05:37:11,594 INFO L471 AbstractCegarLoop]: Abstraction has has 383 places, 382 transitions, 789 flow [2025-02-08 05:37:11,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 354.5) internal successors, (2127), 6 states have internal predecessors, (2127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:11,595 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:11,595 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:11,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:37:11,595 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:37:11,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:11,596 INFO L85 PathProgramCache]: Analyzing trace with hash 799330098, now seen corresponding path program 1 times [2025-02-08 05:37:11,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:11,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043521846] [2025-02-08 05:37:11,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:11,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:11,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-08 05:37:11,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-08 05:37:11,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:11,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:11,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:11,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:11,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043521846] [2025-02-08 05:37:11,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043521846] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:11,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:11,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:11,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762385937] [2025-02-08 05:37:11,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:11,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:11,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:11,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:11,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:11,670 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 431 [2025-02-08 05:37:11,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 382 transitions, 789 flow. Second operand has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:11,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:11,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 431 [2025-02-08 05:37:11,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:11,720 INFO L124 PetriNetUnfolderBase]: 20/591 cut-off events. [2025-02-08 05:37:11,720 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-02-08 05:37:11,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 638 conditions, 591 events. 20/591 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1973 event pairs, 8 based on Foata normal form. 0/513 useless extension candidates. Maximal degree in co-relation 605. Up to 28 conditions per place. [2025-02-08 05:37:11,723 INFO L140 encePairwiseOnDemand]: 428/431 looper letters, 11 selfloop transitions, 2 changer transitions 0/381 dead transitions. [2025-02-08 05:37:11,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 381 transitions, 813 flow [2025-02-08 05:37:11,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:11,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:11,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1220 transitions. [2025-02-08 05:37:11,726 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9435421500386698 [2025-02-08 05:37:11,726 INFO L175 Difference]: Start difference. First operand has 383 places, 382 transitions, 789 flow. Second operand 3 states and 1220 transitions. [2025-02-08 05:37:11,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 381 transitions, 813 flow [2025-02-08 05:37:11,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 381 transitions, 793 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:37:11,730 INFO L231 Difference]: Finished difference. Result has 379 places, 381 transitions, 771 flow [2025-02-08 05:37:11,730 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=767, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=771, PETRI_PLACES=379, PETRI_TRANSITIONS=381} [2025-02-08 05:37:11,731 INFO L279 CegarLoopForPetriNet]: 396 programPoint places, -17 predicate places. [2025-02-08 05:37:11,732 INFO L471 AbstractCegarLoop]: Abstraction has has 379 places, 381 transitions, 771 flow [2025-02-08 05:37:11,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:11,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:11,732 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] [2025-02-08 05:37:11,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:37:11,733 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:37:11,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:11,734 INFO L85 PathProgramCache]: Analyzing trace with hash 647074961, now seen corresponding path program 1 times [2025-02-08 05:37:11,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:11,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244375491] [2025-02-08 05:37:11,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:11,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:11,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-08 05:37:11,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-08 05:37:11,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:11,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:11,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:11,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:11,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244375491] [2025-02-08 05:37:11,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244375491] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:11,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:11,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:11,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893042526] [2025-02-08 05:37:11,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:11,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:11,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:11,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:11,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:11,802 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 431 [2025-02-08 05:37:11,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 381 transitions, 771 flow. Second operand has 3 states, 3 states have (on average 398.0) internal successors, (1194), 3 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:11,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:11,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 431 [2025-02-08 05:37:11,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:11,897 INFO L124 PetriNetUnfolderBase]: 54/1204 cut-off events. [2025-02-08 05:37:11,897 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-02-08 05:37:11,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1286 conditions, 1204 events. 54/1204 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 6796 event pairs, 24 based on Foata normal form. 0/1037 useless extension candidates. Maximal degree in co-relation 1248. Up to 69 conditions per place. [2025-02-08 05:37:11,904 INFO L140 encePairwiseOnDemand]: 425/431 looper letters, 14 selfloop transitions, 1 changer transitions 0/376 dead transitions. [2025-02-08 05:37:11,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 376 transitions, 791 flow [2025-02-08 05:37:11,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:11,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:11,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1211 transitions. [2025-02-08 05:37:11,906 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9365815931941222 [2025-02-08 05:37:11,906 INFO L175 Difference]: Start difference. First operand has 379 places, 381 transitions, 771 flow. Second operand 3 states and 1211 transitions. [2025-02-08 05:37:11,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 376 transitions, 791 flow [2025-02-08 05:37:11,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 376 transitions, 787 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:11,911 INFO L231 Difference]: Finished difference. Result has 374 places, 376 transitions, 759 flow [2025-02-08 05:37:11,912 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=757, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=759, PETRI_PLACES=374, PETRI_TRANSITIONS=376} [2025-02-08 05:37:11,912 INFO L279 CegarLoopForPetriNet]: 396 programPoint places, -22 predicate places. [2025-02-08 05:37:11,912 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 376 transitions, 759 flow [2025-02-08 05:37:11,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 398.0) internal successors, (1194), 3 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:11,913 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:11,913 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:11,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:37:11,913 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:37:11,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:11,914 INFO L85 PathProgramCache]: Analyzing trace with hash -161946241, now seen corresponding path program 1 times [2025-02-08 05:37:11,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:11,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823615219] [2025-02-08 05:37:11,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:11,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:11,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 05:37:11,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 05:37:11,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:11,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:11,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:11,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:11,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823615219] [2025-02-08 05:37:11,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823615219] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:11,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:11,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:11,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195904430] [2025-02-08 05:37:11,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:11,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:11,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:11,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:11,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:11,995 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 431 [2025-02-08 05:37:11,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 376 transitions, 759 flow. Second operand has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:11,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:11,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 431 [2025-02-08 05:37:11,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:12,043 INFO L124 PetriNetUnfolderBase]: 20/581 cut-off events. [2025-02-08 05:37:12,043 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-02-08 05:37:12,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 619 conditions, 581 events. 20/581 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1851 event pairs, 8 based on Foata normal form. 0/513 useless extension candidates. Maximal degree in co-relation 581. Up to 28 conditions per place. [2025-02-08 05:37:12,045 INFO L140 encePairwiseOnDemand]: 428/431 looper letters, 11 selfloop transitions, 2 changer transitions 0/375 dead transitions. [2025-02-08 05:37:12,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 375 transitions, 783 flow [2025-02-08 05:37:12,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:12,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:12,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1220 transitions. [2025-02-08 05:37:12,048 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9435421500386698 [2025-02-08 05:37:12,048 INFO L175 Difference]: Start difference. First operand has 374 places, 376 transitions, 759 flow. Second operand 3 states and 1220 transitions. [2025-02-08 05:37:12,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 375 transitions, 783 flow [2025-02-08 05:37:12,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 375 transitions, 782 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:12,052 INFO L231 Difference]: Finished difference. Result has 374 places, 375 transitions, 760 flow [2025-02-08 05:37:12,052 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=756, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=760, PETRI_PLACES=374, PETRI_TRANSITIONS=375} [2025-02-08 05:37:12,052 INFO L279 CegarLoopForPetriNet]: 396 programPoint places, -22 predicate places. [2025-02-08 05:37:12,052 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 375 transitions, 760 flow [2025-02-08 05:37:12,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:12,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:12,053 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] [2025-02-08 05:37:12,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:37:12,053 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:37:12,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:12,054 INFO L85 PathProgramCache]: Analyzing trace with hash -279895778, now seen corresponding path program 1 times [2025-02-08 05:37:12,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:12,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501195719] [2025-02-08 05:37:12,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:12,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:12,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-08 05:37:12,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-08 05:37:12,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:12,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:12,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:12,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:12,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501195719] [2025-02-08 05:37:12,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501195719] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:12,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:12,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:12,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292457372] [2025-02-08 05:37:12,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:12,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:12,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:12,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:12,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:12,115 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 405 out of 431 [2025-02-08 05:37:12,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 375 transitions, 760 flow. Second operand has 3 states, 3 states have (on average 406.3333333333333) internal successors, (1219), 3 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:12,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:12,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 405 of 431 [2025-02-08 05:37:12,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:12,160 INFO L124 PetriNetUnfolderBase]: 16/562 cut-off events. [2025-02-08 05:37:12,161 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2025-02-08 05:37:12,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 594 conditions, 562 events. 16/562 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1811 event pairs, 2 based on Foata normal form. 1/499 useless extension candidates. Maximal degree in co-relation 557. Up to 14 conditions per place. [2025-02-08 05:37:12,164 INFO L140 encePairwiseOnDemand]: 428/431 looper letters, 10 selfloop transitions, 2 changer transitions 0/375 dead transitions. [2025-02-08 05:37:12,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 375 transitions, 785 flow [2025-02-08 05:37:12,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:12,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:12,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1228 transitions. [2025-02-08 05:37:12,167 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9497293116782676 [2025-02-08 05:37:12,167 INFO L175 Difference]: Start difference. First operand has 374 places, 375 transitions, 760 flow. Second operand 3 states and 1228 transitions. [2025-02-08 05:37:12,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 375 transitions, 785 flow [2025-02-08 05:37:12,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 375 transitions, 781 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:12,172 INFO L231 Difference]: Finished difference. Result has 373 places, 374 transitions, 758 flow [2025-02-08 05:37:12,173 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=758, PETRI_PLACES=373, PETRI_TRANSITIONS=374} [2025-02-08 05:37:12,173 INFO L279 CegarLoopForPetriNet]: 396 programPoint places, -23 predicate places. [2025-02-08 05:37:12,173 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 374 transitions, 758 flow [2025-02-08 05:37:12,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 406.3333333333333) internal successors, (1219), 3 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:12,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:12,174 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:12,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:37:12,174 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:37:12,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:12,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1130977947, now seen corresponding path program 1 times [2025-02-08 05:37:12,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:12,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414860496] [2025-02-08 05:37:12,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:12,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:12,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-08 05:37:12,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-08 05:37:12,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:12,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:12,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:12,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:12,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414860496] [2025-02-08 05:37:12,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414860496] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:12,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:12,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:12,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58482978] [2025-02-08 05:37:12,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:12,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:12,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:12,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:12,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:12,229 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 405 out of 431 [2025-02-08 05:37:12,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 374 transitions, 758 flow. Second operand has 3 states, 3 states have (on average 406.6666666666667) internal successors, (1220), 3 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:12,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:12,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 405 of 431 [2025-02-08 05:37:12,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:12,280 INFO L124 PetriNetUnfolderBase]: 14/464 cut-off events. [2025-02-08 05:37:12,280 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-02-08 05:37:12,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 492 conditions, 464 events. 14/464 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1148 event pairs, 2 based on Foata normal form. 0/413 useless extension candidates. Maximal degree in co-relation 455. Up to 14 conditions per place. [2025-02-08 05:37:12,282 INFO L140 encePairwiseOnDemand]: 428/431 looper letters, 10 selfloop transitions, 2 changer transitions 0/374 dead transitions. [2025-02-08 05:37:12,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 374 transitions, 783 flow [2025-02-08 05:37:12,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:12,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:12,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1228 transitions. [2025-02-08 05:37:12,284 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9497293116782676 [2025-02-08 05:37:12,284 INFO L175 Difference]: Start difference. First operand has 373 places, 374 transitions, 758 flow. Second operand 3 states and 1228 transitions. [2025-02-08 05:37:12,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 374 transitions, 783 flow [2025-02-08 05:37:12,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 374 transitions, 779 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:12,288 INFO L231 Difference]: Finished difference. Result has 372 places, 373 transitions, 756 flow [2025-02-08 05:37:12,288 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=372, PETRI_TRANSITIONS=373} [2025-02-08 05:37:12,289 INFO L279 CegarLoopForPetriNet]: 396 programPoint places, -24 predicate places. [2025-02-08 05:37:12,289 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 373 transitions, 756 flow [2025-02-08 05:37:12,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 406.6666666666667) internal successors, (1220), 3 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:12,290 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:12,290 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] [2025-02-08 05:37:12,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:37:12,290 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:37:12,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:12,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1591136785, now seen corresponding path program 1 times [2025-02-08 05:37:12,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:12,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806957618] [2025-02-08 05:37:12,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:12,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:12,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-08 05:37:12,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-08 05:37:12,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:12,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:12,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:12,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:12,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806957618] [2025-02-08 05:37:12,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806957618] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:12,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:12,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:37:12,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423682701] [2025-02-08 05:37:12,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:12,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:12,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:12,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:12,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:12,363 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 405 out of 431 [2025-02-08 05:37:12,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 373 transitions, 756 flow. Second operand has 3 states, 3 states have (on average 406.6666666666667) internal successors, (1220), 3 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:12,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:12,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 405 of 431 [2025-02-08 05:37:12,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:12,411 INFO L124 PetriNetUnfolderBase]: 20/563 cut-off events. [2025-02-08 05:37:12,411 INFO L125 PetriNetUnfolderBase]: For 2/10 co-relation queries the response was YES. [2025-02-08 05:37:12,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 563 events. 20/563 cut-off events. For 2/10 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1784 event pairs, 6 based on Foata normal form. 1/502 useless extension candidates. Maximal degree in co-relation 576. Up to 24 conditions per place. [2025-02-08 05:37:12,414 INFO L140 encePairwiseOnDemand]: 427/431 looper letters, 11 selfloop transitions, 3 changer transitions 0/375 dead transitions. [2025-02-08 05:37:12,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 375 transitions, 789 flow [2025-02-08 05:37:12,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:12,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:12,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1230 transitions. [2025-02-08 05:37:12,416 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.951276102088167 [2025-02-08 05:37:12,416 INFO L175 Difference]: Start difference. First operand has 372 places, 373 transitions, 756 flow. Second operand 3 states and 1230 transitions. [2025-02-08 05:37:12,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 375 transitions, 789 flow [2025-02-08 05:37:12,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 375 transitions, 785 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:12,422 INFO L231 Difference]: Finished difference. Result has 374 places, 374 transitions, 770 flow [2025-02-08 05:37:12,422 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=770, PETRI_PLACES=374, PETRI_TRANSITIONS=374} [2025-02-08 05:37:12,423 INFO L279 CegarLoopForPetriNet]: 396 programPoint places, -22 predicate places. [2025-02-08 05:37:12,423 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 374 transitions, 770 flow [2025-02-08 05:37:12,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 406.6666666666667) internal successors, (1220), 3 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:12,424 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:12,424 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] [2025-02-08 05:37:12,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:37:12,424 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:37:12,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:12,424 INFO L85 PathProgramCache]: Analyzing trace with hash -390972979, now seen corresponding path program 1 times [2025-02-08 05:37:12,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:12,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298373828] [2025-02-08 05:37:12,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:12,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:12,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-08 05:37:12,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-08 05:37:12,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:12,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:12,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:12,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:12,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298373828] [2025-02-08 05:37:12,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298373828] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:12,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:12,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:12,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128325923] [2025-02-08 05:37:12,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:12,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:12,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:12,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:12,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:12,489 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 431 [2025-02-08 05:37:12,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 374 transitions, 770 flow. Second operand has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:12,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:12,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 431 [2025-02-08 05:37:12,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:12,589 INFO L124 PetriNetUnfolderBase]: 58/1073 cut-off events. [2025-02-08 05:37:12,589 INFO L125 PetriNetUnfolderBase]: For 19/20 co-relation queries the response was YES. [2025-02-08 05:37:12,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1198 conditions, 1073 events. 58/1073 cut-off events. For 19/20 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5708 event pairs, 12 based on Foata normal form. 0/951 useless extension candidates. Maximal degree in co-relation 1160. Up to 76 conditions per place. [2025-02-08 05:37:12,593 INFO L140 encePairwiseOnDemand]: 425/431 looper letters, 16 selfloop transitions, 2 changer transitions 0/375 dead transitions. [2025-02-08 05:37:12,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 375 transitions, 811 flow [2025-02-08 05:37:12,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:12,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:12,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1222 transitions. [2025-02-08 05:37:12,595 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9450889404485692 [2025-02-08 05:37:12,595 INFO L175 Difference]: Start difference. First operand has 374 places, 374 transitions, 770 flow. Second operand 3 states and 1222 transitions. [2025-02-08 05:37:12,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 375 transitions, 811 flow [2025-02-08 05:37:12,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 375 transitions, 805 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:12,599 INFO L231 Difference]: Finished difference. Result has 371 places, 372 transitions, 770 flow [2025-02-08 05:37:12,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=756, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=770, PETRI_PLACES=371, PETRI_TRANSITIONS=372} [2025-02-08 05:37:12,599 INFO L279 CegarLoopForPetriNet]: 396 programPoint places, -25 predicate places. [2025-02-08 05:37:12,600 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 372 transitions, 770 flow [2025-02-08 05:37:12,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:12,600 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:12,600 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:12,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:37:12,600 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:37:12,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:12,601 INFO L85 PathProgramCache]: Analyzing trace with hash -601303600, now seen corresponding path program 1 times [2025-02-08 05:37:12,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:12,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236261675] [2025-02-08 05:37:12,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:12,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:12,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-08 05:37:12,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-08 05:37:12,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:12,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:12,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:12,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:12,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236261675] [2025-02-08 05:37:12,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236261675] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:12,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:12,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:37:12,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491314067] [2025-02-08 05:37:12,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:12,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:37:12,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:12,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:37:12,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:37:13,036 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 383 out of 431 [2025-02-08 05:37:13,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 372 transitions, 770 flow. Second operand has 8 states, 8 states have (on average 386.125) internal successors, (3089), 8 states have internal predecessors, (3089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:13,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:13,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 383 of 431 [2025-02-08 05:37:13,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:13,193 INFO L124 PetriNetUnfolderBase]: 52/979 cut-off events. [2025-02-08 05:37:13,193 INFO L125 PetriNetUnfolderBase]: For 6/22 co-relation queries the response was YES. [2025-02-08 05:37:13,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1191 conditions, 979 events. 52/979 cut-off events. For 6/22 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4355 event pairs, 14 based on Foata normal form. 5/896 useless extension candidates. Maximal degree in co-relation 1151. Up to 70 conditions per place. [2025-02-08 05:37:13,199 INFO L140 encePairwiseOnDemand]: 415/431 looper letters, 43 selfloop transitions, 18 changer transitions 0/398 dead transitions. [2025-02-08 05:37:13,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 398 transitions, 957 flow [2025-02-08 05:37:13,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 05:37:13,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 05:37:13,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 4658 transitions. [2025-02-08 05:37:13,207 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9006187161639598 [2025-02-08 05:37:13,207 INFO L175 Difference]: Start difference. First operand has 371 places, 372 transitions, 770 flow. Second operand 12 states and 4658 transitions. [2025-02-08 05:37:13,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 398 transitions, 957 flow [2025-02-08 05:37:13,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 398 transitions, 957 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:13,214 INFO L231 Difference]: Finished difference. Result has 388 places, 381 transitions, 863 flow [2025-02-08 05:37:13,214 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=863, PETRI_PLACES=388, PETRI_TRANSITIONS=381} [2025-02-08 05:37:13,215 INFO L279 CegarLoopForPetriNet]: 396 programPoint places, -8 predicate places. [2025-02-08 05:37:13,215 INFO L471 AbstractCegarLoop]: Abstraction has has 388 places, 381 transitions, 863 flow [2025-02-08 05:37:13,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 386.125) internal successors, (3089), 8 states have internal predecessors, (3089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:13,217 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:13,217 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:13,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:37:13,217 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:37:13,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:13,217 INFO L85 PathProgramCache]: Analyzing trace with hash -648646893, now seen corresponding path program 1 times [2025-02-08 05:37:13,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:13,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787900724] [2025-02-08 05:37:13,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:13,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:13,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-08 05:37:13,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-08 05:37:13,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:13,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:13,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:13,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:13,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787900724] [2025-02-08 05:37:13,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787900724] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:13,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:13,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:37:13,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384745675] [2025-02-08 05:37:13,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:13,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:13,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:13,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:13,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:13,273 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 405 out of 431 [2025-02-08 05:37:13,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 381 transitions, 863 flow. Second operand has 3 states, 3 states have (on average 407.0) internal successors, (1221), 3 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:13,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:13,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 405 of 431 [2025-02-08 05:37:13,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:13,366 INFO L124 PetriNetUnfolderBase]: 80/1073 cut-off events. [2025-02-08 05:37:13,366 INFO L125 PetriNetUnfolderBase]: For 72/75 co-relation queries the response was YES. [2025-02-08 05:37:13,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1310 conditions, 1073 events. 80/1073 cut-off events. For 72/75 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 5719 event pairs, 24 based on Foata normal form. 0/958 useless extension candidates. Maximal degree in co-relation 1262. Up to 98 conditions per place. [2025-02-08 05:37:13,371 INFO L140 encePairwiseOnDemand]: 427/431 looper letters, 11 selfloop transitions, 3 changer transitions 0/383 dead transitions. [2025-02-08 05:37:13,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 383 transitions, 896 flow [2025-02-08 05:37:13,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:13,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:13,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1230 transitions. [2025-02-08 05:37:13,374 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.951276102088167 [2025-02-08 05:37:13,374 INFO L175 Difference]: Start difference. First operand has 388 places, 381 transitions, 863 flow. Second operand 3 states and 1230 transitions. [2025-02-08 05:37:13,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 383 transitions, 896 flow [2025-02-08 05:37:13,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 383 transitions, 896 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:13,378 INFO L231 Difference]: Finished difference. Result has 392 places, 382 transitions, 881 flow [2025-02-08 05:37:13,379 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=863, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=881, PETRI_PLACES=392, PETRI_TRANSITIONS=382} [2025-02-08 05:37:13,379 INFO L279 CegarLoopForPetriNet]: 396 programPoint places, -4 predicate places. [2025-02-08 05:37:13,379 INFO L471 AbstractCegarLoop]: Abstraction has has 392 places, 382 transitions, 881 flow [2025-02-08 05:37:13,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 407.0) internal successors, (1221), 3 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:13,380 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:13,380 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:13,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:37:13,380 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:37:13,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:13,381 INFO L85 PathProgramCache]: Analyzing trace with hash -931124969, now seen corresponding path program 1 times [2025-02-08 05:37:13,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:13,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355455420] [2025-02-08 05:37:13,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:13,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:13,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-08 05:37:13,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-08 05:37:13,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:13,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:13,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:13,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:13,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355455420] [2025-02-08 05:37:13,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355455420] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:13,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:13,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:37:13,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100263427] [2025-02-08 05:37:13,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:13,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:37:13,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:13,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:37:13,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:37:13,947 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 383 out of 431 [2025-02-08 05:37:13,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 382 transitions, 881 flow. Second operand has 8 states, 8 states have (on average 386.25) internal successors, (3090), 8 states have internal predecessors, (3090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:13,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:13,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 383 of 431 [2025-02-08 05:37:13,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:14,106 INFO L124 PetriNetUnfolderBase]: 64/865 cut-off events. [2025-02-08 05:37:14,106 INFO L125 PetriNetUnfolderBase]: For 84/87 co-relation queries the response was YES. [2025-02-08 05:37:14,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1149 conditions, 865 events. 64/865 cut-off events. For 84/87 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3856 event pairs, 20 based on Foata normal form. 2/799 useless extension candidates. Maximal degree in co-relation 1097. Up to 105 conditions per place. [2025-02-08 05:37:14,114 INFO L140 encePairwiseOnDemand]: 417/431 looper letters, 45 selfloop transitions, 15 changer transitions 0/402 dead transitions. [2025-02-08 05:37:14,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 402 transitions, 1057 flow [2025-02-08 05:37:14,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 05:37:14,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 05:37:14,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4273 transitions. [2025-02-08 05:37:14,121 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9012866483864164 [2025-02-08 05:37:14,121 INFO L175 Difference]: Start difference. First operand has 392 places, 382 transitions, 881 flow. Second operand 11 states and 4273 transitions. [2025-02-08 05:37:14,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 402 transitions, 1057 flow [2025-02-08 05:37:14,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 402 transitions, 1047 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:14,128 INFO L231 Difference]: Finished difference. Result has 403 places, 385 transitions, 930 flow [2025-02-08 05:37:14,129 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=875, PETRI_DIFFERENCE_MINUEND_PLACES=390, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=930, PETRI_PLACES=403, PETRI_TRANSITIONS=385} [2025-02-08 05:37:14,129 INFO L279 CegarLoopForPetriNet]: 396 programPoint places, 7 predicate places. [2025-02-08 05:37:14,129 INFO L471 AbstractCegarLoop]: Abstraction has has 403 places, 385 transitions, 930 flow [2025-02-08 05:37:14,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 386.25) internal successors, (3090), 8 states have internal predecessors, (3090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:14,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:14,131 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:14,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:37:14,131 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:37:14,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:14,132 INFO L85 PathProgramCache]: Analyzing trace with hash 842672062, now seen corresponding path program 1 times [2025-02-08 05:37:14,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:14,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193739186] [2025-02-08 05:37:14,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:14,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:14,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-08 05:37:14,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-08 05:37:14,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:14,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:14,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:37:14,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:14,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193739186] [2025-02-08 05:37:14,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193739186] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:14,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:14,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:37:14,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549196635] [2025-02-08 05:37:14,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:14,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:37:14,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:14,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:37:14,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:37:14,641 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 383 out of 431 [2025-02-08 05:37:14,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 385 transitions, 930 flow. Second operand has 8 states, 8 states have (on average 386.25) internal successors, (3090), 8 states have internal predecessors, (3090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:14,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:14,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 383 of 431 [2025-02-08 05:37:14,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:14,865 INFO L124 PetriNetUnfolderBase]: 76/1521 cut-off events. [2025-02-08 05:37:14,865 INFO L125 PetriNetUnfolderBase]: For 122/148 co-relation queries the response was YES. [2025-02-08 05:37:14,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2055 conditions, 1521 events. 76/1521 cut-off events. For 122/148 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 8460 event pairs, 28 based on Foata normal form. 5/1408 useless extension candidates. Maximal degree in co-relation 1997. Up to 114 conditions per place. [2025-02-08 05:37:14,876 INFO L140 encePairwiseOnDemand]: 416/431 looper letters, 48 selfloop transitions, 19 changer transitions 0/408 dead transitions. [2025-02-08 05:37:14,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 408 transitions, 1157 flow [2025-02-08 05:37:14,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 05:37:14,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 05:37:14,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4266 transitions. [2025-02-08 05:37:14,883 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8998101666315124 [2025-02-08 05:37:14,883 INFO L175 Difference]: Start difference. First operand has 403 places, 385 transitions, 930 flow. Second operand 11 states and 4266 transitions. [2025-02-08 05:37:14,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 408 transitions, 1157 flow [2025-02-08 05:37:14,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 408 transitions, 1136 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-02-08 05:37:14,888 INFO L231 Difference]: Finished difference. Result has 411 places, 397 transitions, 1041 flow [2025-02-08 05:37:14,889 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=909, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1041, PETRI_PLACES=411, PETRI_TRANSITIONS=397} [2025-02-08 05:37:14,889 INFO L279 CegarLoopForPetriNet]: 396 programPoint places, 15 predicate places. [2025-02-08 05:37:14,889 INFO L471 AbstractCegarLoop]: Abstraction has has 411 places, 397 transitions, 1041 flow [2025-02-08 05:37:14,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 386.25) internal successors, (3090), 8 states have internal predecessors, (3090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:14,891 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:14,891 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:14,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:37:14,891 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:37:14,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:14,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1801727867, now seen corresponding path program 1 times [2025-02-08 05:37:14,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:14,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12299512] [2025-02-08 05:37:14,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:14,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:14,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-08 05:37:14,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-08 05:37:14,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:14,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:15,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:37:15,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:15,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12299512] [2025-02-08 05:37:15,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12299512] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:15,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:15,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:37:15,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864076067] [2025-02-08 05:37:15,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:15,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:37:15,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:15,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:37:15,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:37:15,362 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 383 out of 431 [2025-02-08 05:37:15,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 397 transitions, 1041 flow. Second operand has 8 states, 8 states have (on average 386.375) internal successors, (3091), 8 states have internal predecessors, (3091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:15,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:15,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 383 of 431 [2025-02-08 05:37:15,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:15,551 INFO L124 PetriNetUnfolderBase]: 83/1155 cut-off events. [2025-02-08 05:37:15,551 INFO L125 PetriNetUnfolderBase]: For 204/209 co-relation queries the response was YES. [2025-02-08 05:37:15,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1638 conditions, 1155 events. 83/1155 cut-off events. For 204/209 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 6034 event pairs, 23 based on Foata normal form. 0/1068 useless extension candidates. Maximal degree in co-relation 1573. Up to 101 conditions per place. [2025-02-08 05:37:15,558 INFO L140 encePairwiseOnDemand]: 415/431 looper letters, 44 selfloop transitions, 22 changer transitions 0/415 dead transitions. [2025-02-08 05:37:15,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 415 transitions, 1246 flow [2025-02-08 05:37:15,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 05:37:15,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 05:37:15,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 4651 transitions. [2025-02-08 05:37:15,564 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8992652745552978 [2025-02-08 05:37:15,564 INFO L175 Difference]: Start difference. First operand has 411 places, 397 transitions, 1041 flow. Second operand 12 states and 4651 transitions. [2025-02-08 05:37:15,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 422 places, 415 transitions, 1246 flow [2025-02-08 05:37:15,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 421 places, 415 transitions, 1242 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:15,571 INFO L231 Difference]: Finished difference. Result has 425 places, 404 transitions, 1148 flow [2025-02-08 05:37:15,572 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=1037, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1148, PETRI_PLACES=425, PETRI_TRANSITIONS=404} [2025-02-08 05:37:15,572 INFO L279 CegarLoopForPetriNet]: 396 programPoint places, 29 predicate places. [2025-02-08 05:37:15,572 INFO L471 AbstractCegarLoop]: Abstraction has has 425 places, 404 transitions, 1148 flow [2025-02-08 05:37:15,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 386.375) internal successors, (3091), 8 states have internal predecessors, (3091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:15,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:15,574 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:15,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:37:15,574 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:37:15,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:15,574 INFO L85 PathProgramCache]: Analyzing trace with hash 671317946, now seen corresponding path program 1 times [2025-02-08 05:37:15,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:15,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705754572] [2025-02-08 05:37:15,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:15,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:15,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-08 05:37:15,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-08 05:37:15,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:15,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:15,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:15,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:15,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705754572] [2025-02-08 05:37:15,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705754572] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:15,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:15,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:15,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474414004] [2025-02-08 05:37:15,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:15,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:15,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:15,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:15,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:15,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 403 out of 431 [2025-02-08 05:37:15,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 404 transitions, 1148 flow. Second operand has 3 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:15,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:15,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 403 of 431 [2025-02-08 05:37:15,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:15,728 INFO L124 PetriNetUnfolderBase]: 35/1121 cut-off events. [2025-02-08 05:37:15,728 INFO L125 PetriNetUnfolderBase]: For 212/223 co-relation queries the response was YES. [2025-02-08 05:37:15,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1568 conditions, 1121 events. 35/1121 cut-off events. For 212/223 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4989 event pairs, 4 based on Foata normal form. 0/1060 useless extension candidates. Maximal degree in co-relation 1499. Up to 33 conditions per place. [2025-02-08 05:37:15,764 INFO L140 encePairwiseOnDemand]: 427/431 looper letters, 10 selfloop transitions, 1 changer transitions 0/401 dead transitions. [2025-02-08 05:37:15,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 424 places, 401 transitions, 1164 flow [2025-02-08 05:37:15,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:15,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:15,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1223 transitions. [2025-02-08 05:37:15,767 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.945862335653519 [2025-02-08 05:37:15,767 INFO L175 Difference]: Start difference. First operand has 425 places, 404 transitions, 1148 flow. Second operand 3 states and 1223 transitions. [2025-02-08 05:37:15,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 424 places, 401 transitions, 1164 flow [2025-02-08 05:37:15,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 418 places, 401 transitions, 1147 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 05:37:15,773 INFO L231 Difference]: Finished difference. Result has 418 places, 401 transitions, 1127 flow [2025-02-08 05:37:15,774 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=1125, PETRI_DIFFERENCE_MINUEND_PLACES=416, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1127, PETRI_PLACES=418, PETRI_TRANSITIONS=401} [2025-02-08 05:37:15,774 INFO L279 CegarLoopForPetriNet]: 396 programPoint places, 22 predicate places. [2025-02-08 05:37:15,774 INFO L471 AbstractCegarLoop]: Abstraction has has 418 places, 401 transitions, 1127 flow [2025-02-08 05:37:15,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:15,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:15,775 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:15,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:37:15,775 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:37:15,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:15,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1016482858, now seen corresponding path program 1 times [2025-02-08 05:37:15,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:15,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156303764] [2025-02-08 05:37:15,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:15,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:15,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-08 05:37:15,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-08 05:37:15,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:15,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:15,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:15,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:15,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156303764] [2025-02-08 05:37:15,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156303764] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:15,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:15,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:15,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536731833] [2025-02-08 05:37:15,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:15,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:15,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:15,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:15,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:15,820 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 403 out of 431 [2025-02-08 05:37:15,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 418 places, 401 transitions, 1127 flow. Second operand has 3 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:15,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:15,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 403 of 431 [2025-02-08 05:37:15,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:15,922 INFO L124 PetriNetUnfolderBase]: 40/1189 cut-off events. [2025-02-08 05:37:15,922 INFO L125 PetriNetUnfolderBase]: For 191/196 co-relation queries the response was YES. [2025-02-08 05:37:15,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1615 conditions, 1189 events. 40/1189 cut-off events. For 191/196 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 5443 event pairs, 5 based on Foata normal form. 5/1137 useless extension candidates. Maximal degree in co-relation 1545. Up to 35 conditions per place. [2025-02-08 05:37:15,930 INFO L140 encePairwiseOnDemand]: 425/431 looper letters, 4 selfloop transitions, 0 changer transitions 67/400 dead transitions. [2025-02-08 05:37:15,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 400 transitions, 1149 flow [2025-02-08 05:37:15,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:15,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:15,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1224 transitions. [2025-02-08 05:37:15,933 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9466357308584686 [2025-02-08 05:37:15,933 INFO L175 Difference]: Start difference. First operand has 418 places, 401 transitions, 1127 flow. Second operand 3 states and 1224 transitions. [2025-02-08 05:37:15,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 400 transitions, 1149 flow [2025-02-08 05:37:15,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 416 places, 400 transitions, 1148 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:15,941 INFO L231 Difference]: Finished difference. Result has 416 places, 333 transitions, 817 flow [2025-02-08 05:37:15,942 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=1120, PETRI_DIFFERENCE_MINUEND_PLACES=414, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=817, PETRI_PLACES=416, PETRI_TRANSITIONS=333} [2025-02-08 05:37:15,943 INFO L279 CegarLoopForPetriNet]: 396 programPoint places, 20 predicate places. [2025-02-08 05:37:15,943 INFO L471 AbstractCegarLoop]: Abstraction has has 416 places, 333 transitions, 817 flow [2025-02-08 05:37:15,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:15,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:15,944 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:15,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:37:15,944 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:37:15,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:15,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1425367367, now seen corresponding path program 1 times [2025-02-08 05:37:15,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:15,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254015622] [2025-02-08 05:37:15,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:15,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:15,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-08 05:37:15,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-08 05:37:15,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:15,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:16,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:37:16,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:16,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254015622] [2025-02-08 05:37:16,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254015622] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:16,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:16,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:16,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233046550] [2025-02-08 05:37:16,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:16,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:16,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:16,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:16,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:16,630 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 389 out of 431 [2025-02-08 05:37:16,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 333 transitions, 817 flow. Second operand has 6 states, 6 states have (on average 391.8333333333333) internal successors, (2351), 6 states have internal predecessors, (2351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:16,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:16,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 389 of 431 [2025-02-08 05:37:16,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:16,737 INFO L124 PetriNetUnfolderBase]: 27/591 cut-off events. [2025-02-08 05:37:16,738 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2025-02-08 05:37:16,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 851 conditions, 591 events. 27/591 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1719 event pairs, 2 based on Foata normal form. 0/557 useless extension candidates. Maximal degree in co-relation 827. Up to 29 conditions per place. [2025-02-08 05:37:16,743 INFO L140 encePairwiseOnDemand]: 424/431 looper letters, 24 selfloop transitions, 5 changer transitions 0/335 dead transitions. [2025-02-08 05:37:16,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 335 transitions, 883 flow [2025-02-08 05:37:16,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:16,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:16,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2365 transitions. [2025-02-08 05:37:16,747 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9145398298530549 [2025-02-08 05:37:16,747 INFO L175 Difference]: Start difference. First operand has 416 places, 333 transitions, 817 flow. Second operand 6 states and 2365 transitions. [2025-02-08 05:37:16,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 335 transitions, 883 flow [2025-02-08 05:37:16,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 335 transitions, 797 flow, removed 17 selfloop flow, removed 26 redundant places. [2025-02-08 05:37:16,752 INFO L231 Difference]: Finished difference. Result has 343 places, 331 transitions, 737 flow [2025-02-08 05:37:16,752 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=727, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=737, PETRI_PLACES=343, PETRI_TRANSITIONS=331} [2025-02-08 05:37:16,753 INFO L279 CegarLoopForPetriNet]: 396 programPoint places, -53 predicate places. [2025-02-08 05:37:16,753 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 331 transitions, 737 flow [2025-02-08 05:37:16,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 391.8333333333333) internal successors, (2351), 6 states have internal predecessors, (2351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:16,754 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:16,754 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:16,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:37:16,755 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:37:16,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:16,755 INFO L85 PathProgramCache]: Analyzing trace with hash 316556442, now seen corresponding path program 1 times [2025-02-08 05:37:16,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:16,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240577109] [2025-02-08 05:37:16,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:16,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:16,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-08 05:37:16,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-08 05:37:16,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:16,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:16,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:37:16,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:16,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240577109] [2025-02-08 05:37:16,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240577109] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:16,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:16,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:16,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684139309] [2025-02-08 05:37:16,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:16,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:16,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:16,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:16,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:16,831 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 431 [2025-02-08 05:37:16,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 331 transitions, 737 flow. Second operand has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:16,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:16,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 431 [2025-02-08 05:37:16,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:16,918 INFO L124 PetriNetUnfolderBase]: 57/1081 cut-off events. [2025-02-08 05:37:16,918 INFO L125 PetriNetUnfolderBase]: For 32/33 co-relation queries the response was YES. [2025-02-08 05:37:16,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1291 conditions, 1081 events. 57/1081 cut-off events. For 32/33 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 5351 event pairs, 13 based on Foata normal form. 0/1000 useless extension candidates. Maximal degree in co-relation 1280. Up to 75 conditions per place. [2025-02-08 05:37:16,926 INFO L140 encePairwiseOnDemand]: 425/431 looper letters, 14 selfloop transitions, 2 changer transitions 0/331 dead transitions. [2025-02-08 05:37:16,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 331 transitions, 771 flow [2025-02-08 05:37:16,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:16,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:16,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1220 transitions. [2025-02-08 05:37:16,928 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9435421500386698 [2025-02-08 05:37:16,928 INFO L175 Difference]: Start difference. First operand has 343 places, 331 transitions, 737 flow. Second operand 3 states and 1220 transitions. [2025-02-08 05:37:16,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 331 transitions, 771 flow [2025-02-08 05:37:16,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 331 transitions, 761 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:37:16,932 INFO L231 Difference]: Finished difference. Result has 337 places, 329 transitions, 733 flow [2025-02-08 05:37:16,933 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=719, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=733, PETRI_PLACES=337, PETRI_TRANSITIONS=329} [2025-02-08 05:37:16,933 INFO L279 CegarLoopForPetriNet]: 396 programPoint places, -59 predicate places. [2025-02-08 05:37:16,933 INFO L471 AbstractCegarLoop]: Abstraction has has 337 places, 329 transitions, 733 flow [2025-02-08 05:37:16,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:16,934 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:16,934 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:16,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 05:37:16,934 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:37:16,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:16,935 INFO L85 PathProgramCache]: Analyzing trace with hash 779607872, now seen corresponding path program 1 times [2025-02-08 05:37:16,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:16,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873779622] [2025-02-08 05:37:16,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:16,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:16,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-08 05:37:16,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-08 05:37:16,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:16,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:17,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:37:17,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:17,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873779622] [2025-02-08 05:37:17,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873779622] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:17,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:17,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:17,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333666677] [2025-02-08 05:37:17,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:17,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:17,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:17,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:17,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:17,644 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 389 out of 431 [2025-02-08 05:37:17,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 329 transitions, 733 flow. Second operand has 6 states, 6 states have (on average 392.0) internal successors, (2352), 6 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:17,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:17,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 389 of 431 [2025-02-08 05:37:17,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:17,712 INFO L124 PetriNetUnfolderBase]: 56/726 cut-off events. [2025-02-08 05:37:17,712 INFO L125 PetriNetUnfolderBase]: For 52/54 co-relation queries the response was YES. [2025-02-08 05:37:17,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 951 conditions, 726 events. 56/726 cut-off events. For 52/54 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3024 event pairs, 4 based on Foata normal form. 0/698 useless extension candidates. Maximal degree in co-relation 940. Up to 52 conditions per place. [2025-02-08 05:37:17,715 INFO L140 encePairwiseOnDemand]: 424/431 looper letters, 24 selfloop transitions, 5 changer transitions 0/331 dead transitions. [2025-02-08 05:37:17,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 331 transitions, 799 flow [2025-02-08 05:37:17,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:17,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:17,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2365 transitions. [2025-02-08 05:37:17,718 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9145398298530549 [2025-02-08 05:37:17,718 INFO L175 Difference]: Start difference. First operand has 337 places, 329 transitions, 733 flow. Second operand 6 states and 2365 transitions. [2025-02-08 05:37:17,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 331 transitions, 799 flow [2025-02-08 05:37:17,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 331 transitions, 799 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:17,721 INFO L231 Difference]: Finished difference. Result has 340 places, 327 transitions, 739 flow [2025-02-08 05:37:17,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=729, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=739, PETRI_PLACES=340, PETRI_TRANSITIONS=327} [2025-02-08 05:37:17,722 INFO L279 CegarLoopForPetriNet]: 396 programPoint places, -56 predicate places. [2025-02-08 05:37:17,722 INFO L471 AbstractCegarLoop]: Abstraction has has 340 places, 327 transitions, 739 flow [2025-02-08 05:37:17,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 392.0) internal successors, (2352), 6 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:17,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:17,723 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:17,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 05:37:17,723 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:37:17,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:17,723 INFO L85 PathProgramCache]: Analyzing trace with hash 564455069, now seen corresponding path program 1 times [2025-02-08 05:37:17,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:17,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177898138] [2025-02-08 05:37:17,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:17,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:17,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-08 05:37:17,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-08 05:37:17,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:17,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:18,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:37:18,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:18,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177898138] [2025-02-08 05:37:18,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177898138] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:18,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:18,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:18,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618044129] [2025-02-08 05:37:18,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:18,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:18,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:18,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:18,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:18,348 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 389 out of 431 [2025-02-08 05:37:18,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 327 transitions, 739 flow. Second operand has 6 states, 6 states have (on average 391.8333333333333) internal successors, (2351), 6 states have internal predecessors, (2351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:18,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:18,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 389 of 431 [2025-02-08 05:37:18,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:18,439 INFO L124 PetriNetUnfolderBase]: 33/690 cut-off events. [2025-02-08 05:37:18,439 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:37:18,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 891 conditions, 690 events. 33/690 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2254 event pairs, 3 based on Foata normal form. 0/667 useless extension candidates. Maximal degree in co-relation 879. Up to 29 conditions per place. [2025-02-08 05:37:18,443 INFO L140 encePairwiseOnDemand]: 424/431 looper letters, 24 selfloop transitions, 5 changer transitions 0/329 dead transitions. [2025-02-08 05:37:18,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 329 transitions, 805 flow [2025-02-08 05:37:18,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:18,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:18,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2365 transitions. [2025-02-08 05:37:18,444 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9145398298530549 [2025-02-08 05:37:18,445 INFO L175 Difference]: Start difference. First operand has 340 places, 327 transitions, 739 flow. Second operand 6 states and 2365 transitions. [2025-02-08 05:37:18,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 329 transitions, 805 flow [2025-02-08 05:37:18,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 329 transitions, 795 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:37:18,448 INFO L231 Difference]: Finished difference. Result has 338 places, 325 transitions, 735 flow [2025-02-08 05:37:18,448 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=725, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=735, PETRI_PLACES=338, PETRI_TRANSITIONS=325} [2025-02-08 05:37:18,448 INFO L279 CegarLoopForPetriNet]: 396 programPoint places, -58 predicate places. [2025-02-08 05:37:18,449 INFO L471 AbstractCegarLoop]: Abstraction has has 338 places, 325 transitions, 735 flow [2025-02-08 05:37:18,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 391.8333333333333) internal successors, (2351), 6 states have internal predecessors, (2351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:18,449 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:18,449 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:18,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 05:37:18,449 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:37:18,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:18,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1597489956, now seen corresponding path program 1 times [2025-02-08 05:37:18,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:18,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512207529] [2025-02-08 05:37:18,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:18,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:18,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-08 05:37:18,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-08 05:37:18,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:18,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:18,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:37:18,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:18,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512207529] [2025-02-08 05:37:18,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512207529] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:18,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:18,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:18,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376301034] [2025-02-08 05:37:18,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:18,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:18,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:18,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:18,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:19,025 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 389 out of 431 [2025-02-08 05:37:19,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 325 transitions, 735 flow. Second operand has 6 states, 6 states have (on average 392.0) internal successors, (2352), 6 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:19,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:19,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 389 of 431 [2025-02-08 05:37:19,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:19,105 INFO L124 PetriNetUnfolderBase]: 46/706 cut-off events. [2025-02-08 05:37:19,105 INFO L125 PetriNetUnfolderBase]: For 42/44 co-relation queries the response was YES. [2025-02-08 05:37:19,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 912 conditions, 706 events. 46/706 cut-off events. For 42/44 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2641 event pairs, 4 based on Foata normal form. 0/688 useless extension candidates. Maximal degree in co-relation 900. Up to 42 conditions per place. [2025-02-08 05:37:19,108 INFO L140 encePairwiseOnDemand]: 424/431 looper letters, 0 selfloop transitions, 0 changer transitions 327/327 dead transitions. [2025-02-08 05:37:19,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 327 transitions, 801 flow [2025-02-08 05:37:19,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:19,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:19,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2365 transitions. [2025-02-08 05:37:19,110 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9145398298530549 [2025-02-08 05:37:19,110 INFO L175 Difference]: Start difference. First operand has 338 places, 325 transitions, 735 flow. Second operand 6 states and 2365 transitions. [2025-02-08 05:37:19,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 327 transitions, 801 flow [2025-02-08 05:37:19,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 327 transitions, 791 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:37:19,113 INFO L231 Difference]: Finished difference. Result has 336 places, 0 transitions, 0 flow [2025-02-08 05:37:19,113 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=721, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=336, PETRI_TRANSITIONS=0} [2025-02-08 05:37:19,114 INFO L279 CegarLoopForPetriNet]: 396 programPoint places, -60 predicate places. [2025-02-08 05:37:19,114 INFO L471 AbstractCegarLoop]: Abstraction has has 336 places, 0 transitions, 0 flow [2025-02-08 05:37:19,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 392.0) internal successors, (2352), 6 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:19,116 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (67 of 68 remaining) [2025-02-08 05:37:19,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (66 of 68 remaining) [2025-02-08 05:37:19,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (65 of 68 remaining) [2025-02-08 05:37:19,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (64 of 68 remaining) [2025-02-08 05:37:19,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (63 of 68 remaining) [2025-02-08 05:37:19,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (62 of 68 remaining) [2025-02-08 05:37:19,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (61 of 68 remaining) [2025-02-08 05:37:19,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (60 of 68 remaining) [2025-02-08 05:37:19,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (59 of 68 remaining) [2025-02-08 05:37:19,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (58 of 68 remaining) [2025-02-08 05:37:19,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (57 of 68 remaining) [2025-02-08 05:37:19,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (56 of 68 remaining) [2025-02-08 05:37:19,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (55 of 68 remaining) [2025-02-08 05:37:19,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (54 of 68 remaining) [2025-02-08 05:37:19,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (53 of 68 remaining) [2025-02-08 05:37:19,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (52 of 68 remaining) [2025-02-08 05:37:19,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (51 of 68 remaining) [2025-02-08 05:37:19,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (50 of 68 remaining) [2025-02-08 05:37:19,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (49 of 68 remaining) [2025-02-08 05:37:19,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (48 of 68 remaining) [2025-02-08 05:37:19,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (47 of 68 remaining) [2025-02-08 05:37:19,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (46 of 68 remaining) [2025-02-08 05:37:19,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (45 of 68 remaining) [2025-02-08 05:37:19,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (44 of 68 remaining) [2025-02-08 05:37:19,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (43 of 68 remaining) [2025-02-08 05:37:19,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (42 of 68 remaining) [2025-02-08 05:37:19,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (41 of 68 remaining) [2025-02-08 05:37:19,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (40 of 68 remaining) [2025-02-08 05:37:19,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (39 of 68 remaining) [2025-02-08 05:37:19,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (38 of 68 remaining) [2025-02-08 05:37:19,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (37 of 68 remaining) [2025-02-08 05:37:19,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (36 of 68 remaining) [2025-02-08 05:37:19,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (35 of 68 remaining) [2025-02-08 05:37:19,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (34 of 68 remaining) [2025-02-08 05:37:19,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (33 of 68 remaining) [2025-02-08 05:37:19,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (32 of 68 remaining) [2025-02-08 05:37:19,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (31 of 68 remaining) [2025-02-08 05:37:19,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (30 of 68 remaining) [2025-02-08 05:37:19,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (29 of 68 remaining) [2025-02-08 05:37:19,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (28 of 68 remaining) [2025-02-08 05:37:19,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 68 remaining) [2025-02-08 05:37:19,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 68 remaining) [2025-02-08 05:37:19,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (25 of 68 remaining) [2025-02-08 05:37:19,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (24 of 68 remaining) [2025-02-08 05:37:19,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (23 of 68 remaining) [2025-02-08 05:37:19,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (22 of 68 remaining) [2025-02-08 05:37:19,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (21 of 68 remaining) [2025-02-08 05:37:19,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (20 of 68 remaining) [2025-02-08 05:37:19,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (19 of 68 remaining) [2025-02-08 05:37:19,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (18 of 68 remaining) [2025-02-08 05:37:19,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (17 of 68 remaining) [2025-02-08 05:37:19,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (16 of 68 remaining) [2025-02-08 05:37:19,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (15 of 68 remaining) [2025-02-08 05:37:19,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (14 of 68 remaining) [2025-02-08 05:37:19,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (13 of 68 remaining) [2025-02-08 05:37:19,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (12 of 68 remaining) [2025-02-08 05:37:19,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (11 of 68 remaining) [2025-02-08 05:37:19,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (10 of 68 remaining) [2025-02-08 05:37:19,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (9 of 68 remaining) [2025-02-08 05:37:19,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (8 of 68 remaining) [2025-02-08 05:37:19,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (7 of 68 remaining) [2025-02-08 05:37:19,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (6 of 68 remaining) [2025-02-08 05:37:19,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (5 of 68 remaining) [2025-02-08 05:37:19,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (4 of 68 remaining) [2025-02-08 05:37:19,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (3 of 68 remaining) [2025-02-08 05:37:19,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (2 of 68 remaining) [2025-02-08 05:37:19,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (1 of 68 remaining) [2025-02-08 05:37:19,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (0 of 68 remaining) [2025-02-08 05:37:19,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 05:37:19,119 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:19,123 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:37:19,123 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:37:19,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:37:19 BasicIcfg [2025-02-08 05:37:19,127 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:37:19,127 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:37:19,127 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:37:19,128 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:37:19,128 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:09" (3/4) ... [2025-02-08 05:37:19,134 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:37:19,137 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:37:19,137 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:37:19,141 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2025-02-08 05:37:19,141 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:37:19,141 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:37:19,141 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:37:19,209 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:37:19,209 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:37:19,209 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:37:19,210 INFO L158 Benchmark]: Toolchain (without parser) took 10911.71ms. Allocated memory was 142.6MB in the beginning and 411.0MB in the end (delta: 268.4MB). Free memory was 111.5MB in the beginning and 244.8MB in the end (delta: -133.3MB). Peak memory consumption was 134.0MB. Max. memory is 16.1GB. [2025-02-08 05:37:19,210 INFO L158 Benchmark]: CDTParser took 0.57ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:37:19,211 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.70ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 98.0MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:19,211 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.18ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 95.3MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:19,211 INFO L158 Benchmark]: Boogie Preprocessor took 28.27ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 92.9MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:37:19,211 INFO L158 Benchmark]: IcfgBuilder took 633.77ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 58.5MB in the end (delta: 34.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 05:37:19,211 INFO L158 Benchmark]: TraceAbstraction took 9905.54ms. Allocated memory was 142.6MB in the beginning and 411.0MB in the end (delta: 268.4MB). Free memory was 57.5MB in the beginning and 253.1MB in the end (delta: -195.6MB). Peak memory consumption was 83.6MB. Max. memory is 16.1GB. [2025-02-08 05:37:19,211 INFO L158 Benchmark]: Witness Printer took 82.08ms. Allocated memory is still 411.0MB. Free memory was 253.1MB in the beginning and 244.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:19,212 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.57ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 211.70ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 98.0MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.18ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 95.3MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.27ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 92.9MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 633.77ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 58.5MB in the end (delta: 34.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9905.54ms. Allocated memory was 142.6MB in the beginning and 411.0MB in the end (delta: 268.4MB). Free memory was 57.5MB in the beginning and 253.1MB in the end (delta: -195.6MB). Peak memory consumption was 83.6MB. Max. memory is 16.1GB. * Witness Printer took 82.08ms. Allocated memory is still 411.0MB. Free memory was 253.1MB in the beginning and 244.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: 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, 608 locations, 68 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: 9.7s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3443 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2268 mSDsluCounter, 3605 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3497 mSDsCounter, 610 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5316 IncrementalHoareTripleChecker+Invalid, 5926 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 610 mSolverCounterUnsat, 108 mSDtfsCounter, 5316 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1148occurred in iteration=16, InterpolantAutomatonStates: 118, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 2720 NumberOfCodeBlocks, 2720 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2697 ConstructedInterpolants, 0 QuantifiedInterpolants, 4118 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 12/12 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 42 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:37:19,229 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