./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_90-arrayloop2_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_90-arrayloop2_racing.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f41f3c018db74ffccd5759d166eb9816a1bf73b1747e3e539ecb5bf51feb56af --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:36:21,311 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:36:21,362 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:36:21,366 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:36:21,366 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:36:21,379 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:36:21,379 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:36:21,380 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:36:21,380 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:36:21,380 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:36:21,380 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:36:21,380 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:36:21,380 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:36:21,381 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:36:21,381 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:36:21,381 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:36:21,381 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:36:21,381 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:36:21,381 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:36:21,381 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:36:21,381 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:36:21,381 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:36:21,381 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:36:21,381 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:36:21,381 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:36:21,382 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:36:21,382 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:36:21,382 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:36:21,382 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:36:21,382 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:36:21,382 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:36:21,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:36:21,382 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:36:21,382 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:36:21,382 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:36:21,383 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:36:21,383 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:36:21,383 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:36:21,383 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:36:21,383 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:36:21,386 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:36:21,386 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:36:21,387 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 -> f41f3c018db74ffccd5759d166eb9816a1bf73b1747e3e539ecb5bf51feb56af [2025-02-08 05:36:21,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:36:21,623 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:36:21,625 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:36:21,628 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:36:21,629 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:36:21,631 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_90-arrayloop2_racing.i [2025-02-08 05:36:22,834 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/19ab89415/3203d4d0448946caa7d6c6f2453f05b9/FLAGb2d9e411c [2025-02-08 05:36:23,156 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:36:23,157 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_90-arrayloop2_racing.i [2025-02-08 05:36:23,175 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/19ab89415/3203d4d0448946caa7d6c6f2453f05b9/FLAGb2d9e411c [2025-02-08 05:36:23,419 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/19ab89415/3203d4d0448946caa7d6c6f2453f05b9 [2025-02-08 05:36:23,421 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:36:23,422 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:36:23,423 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:36:23,423 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:36:23,426 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:36:23,426 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:36:23" (1/1) ... [2025-02-08 05:36:23,427 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66a8798e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:23, skipping insertion in model container [2025-02-08 05:36:23,427 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:36:23" (1/1) ... [2025-02-08 05:36:23,461 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:36:23,761 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-08 05:36:23,762 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-08 05:36:23,763 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-08 05:36:23,763 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-08 05:36:23,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:36:23,814 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:36:23,845 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-08 05:36:23,846 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-08 05:36:23,846 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-08 05:36:23,847 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-08 05:36:23,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:36:23,916 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:36:23,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:23 WrapperNode [2025-02-08 05:36:23,918 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:36:23,919 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:36:23,919 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:36:23,920 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:36:23,924 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:36:23" (1/1) ... [2025-02-08 05:36:23,939 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:36:23" (1/1) ... [2025-02-08 05:36:23,970 INFO L138 Inliner]: procedures = 280, calls = 143, calls flagged for inlining = 11, calls inlined = 12, statements flattened = 526 [2025-02-08 05:36:23,970 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:36:23,971 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:36:23,971 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:36:23,971 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:36:23,976 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:23" (1/1) ... [2025-02-08 05:36:23,976 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:23" (1/1) ... [2025-02-08 05:36:23,982 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:23" (1/1) ... [2025-02-08 05:36:23,983 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:23" (1/1) ... [2025-02-08 05:36:24,006 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:23" (1/1) ... [2025-02-08 05:36:24,009 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:23" (1/1) ... [2025-02-08 05:36:24,011 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:23" (1/1) ... [2025-02-08 05:36:24,013 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:23" (1/1) ... [2025-02-08 05:36:24,021 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:36:24,025 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:36:24,025 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:36:24,026 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:36:24,027 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:23" (1/1) ... [2025-02-08 05:36:24,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:36:24,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:36:24,060 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:36:24,063 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:36:24,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 05:36:24,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 05:36:24,080 INFO L130 BoogieDeclarations]: Found specification of procedure t1_fun [2025-02-08 05:36:24,080 INFO L138 BoogieDeclarations]: Found implementation of procedure t1_fun [2025-02-08 05:36:24,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:36:24,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-08 05:36:24,081 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:36:24,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:36:24,081 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2025-02-08 05:36:24,081 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2025-02-08 05:36:24,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:36:24,081 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:36:24,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:36:24,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:36:24,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 05:36:24,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:36:24,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:36:24,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:36:24,084 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:36:24,214 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:36:24,216 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:36:25,046 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1028: list_add_~head#1.base, list_add_~head#1.offset := list_add_#in~head#1.base, list_add_#in~head#1.offset; [2025-02-08 05:36:25,046 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1028-1: list_add_~new#1.base, list_add_~new#1.offset := list_add_#in~new#1.base, list_add_#in~new#1.offset; [2025-02-08 05:36:25,046 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1029: havoc list_add_#t~mem7#1.base, list_add_#t~mem7#1.offset; [2025-02-08 05:36:25,046 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1029-1: assume ((0 == #race[list_add_~head#1.base,list_add_~head#1.offset] && 0 == #race[list_add_~head#1.base,1 + list_add_~head#1.offset]) && 0 == #race[list_add_~head#1.base,2 + list_add_~head#1.offset]) && 0 == #race[list_add_~head#1.base,3 + list_add_~head#1.offset]; [2025-02-08 05:36:25,046 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1029-1: assume !(((0 == #race[list_add_~head#1.base,list_add_~head#1.offset] && 0 == #race[list_add_~head#1.base,1 + list_add_~head#1.offset]) && 0 == #race[list_add_~head#1.base,2 + list_add_~head#1.offset]) && 0 == #race[list_add_~head#1.base,3 + list_add_~head#1.offset]); [2025-02-08 05:36:25,046 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1029-2: list_add_~next~0#1.base, list_add_~next~0#1.offset := list_add_#t~mem7#1.base, list_add_#t~mem7#1.offset; [2025-02-08 05:36:25,046 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1029-3: #race := #race[list_add_~head#1.base,3 + list_add_~head#1.offset := 0]; [2025-02-08 05:36:25,046 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1029-4: #race := #race[list_add_~head#1.base,2 + list_add_~head#1.offset := 0]; [2025-02-08 05:36:25,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1029-5: #race := #race[list_add_~head#1.base,1 + list_add_~head#1.offset := 0]; [2025-02-08 05:36:25,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1029-6: #race := #race[list_add_~head#1.base,list_add_~head#1.offset := 0]; [2025-02-08 05:36:25,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1029-7: SUMMARY for call list_add_#t~mem7#1.base, list_add_#t~mem7#1.offset := read~$Pointer$(list_add_~head#1.base, list_add_~head#1.offset, 4); srcloc: null [2025-02-08 05:36:25,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1030: assume ((#race[list_add_~next~0#1.base,4 + list_add_~next~0#1.offset] == list_add_#t~nondet8#1 && #race[list_add_~next~0#1.base,5 + list_add_~next~0#1.offset] == list_add_#t~nondet8#1) && #race[list_add_~next~0#1.base,6 + list_add_~next~0#1.offset] == list_add_#t~nondet8#1) && #race[list_add_~next~0#1.base,7 + list_add_~next~0#1.offset] == list_add_#t~nondet8#1; [2025-02-08 05:36:25,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1030: assume !(((#race[list_add_~next~0#1.base,4 + list_add_~next~0#1.offset] == list_add_#t~nondet8#1 && #race[list_add_~next~0#1.base,5 + list_add_~next~0#1.offset] == list_add_#t~nondet8#1) && #race[list_add_~next~0#1.base,6 + list_add_~next~0#1.offset] == list_add_#t~nondet8#1) && #race[list_add_~next~0#1.base,7 + list_add_~next~0#1.offset] == list_add_#t~nondet8#1); [2025-02-08 05:36:25,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1030-1: havoc list_add_#t~nondet8#1; [2025-02-08 05:36:25,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1030-2: #race := #race[list_add_~next~0#1.base,7 + list_add_~next~0#1.offset := list_add_#t~nondet8#1]; [2025-02-08 05:36:25,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1030-3: #race := #race[list_add_~next~0#1.base,6 + list_add_~next~0#1.offset := list_add_#t~nondet8#1]; [2025-02-08 05:36:25,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1030-4: #race := #race[list_add_~next~0#1.base,5 + list_add_~next~0#1.offset := list_add_#t~nondet8#1]; [2025-02-08 05:36:25,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1030-5: #race := #race[list_add_~next~0#1.base,4 + list_add_~next~0#1.offset := list_add_#t~nondet8#1]; [2025-02-08 05:36:25,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1030-6: havoc list_add_#t~nondet8#1; [2025-02-08 05:36:25,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1030-7: SUMMARY for call write~$Pointer$(list_add_~new#1.base, list_add_~new#1.offset, list_add_~next~0#1.base, 4 + list_add_~next~0#1.offset, 4); srcloc: null [2025-02-08 05:36:25,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1080-1: havoc main_#t~post53#1; [2025-02-08 05:36:25,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1080-2: main_~j~2#1 := 1 + main_#t~post53#1; [2025-02-08 05:36:25,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1080-3: assume { :end_inline_list_add } true;main_#t~post53#1 := main_~j~2#1; [2025-02-08 05:36:25,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1080-4: havoc list_add_#in~new#1.base, list_add_#in~new#1.offset, list_add_#in~head#1.base, list_add_#in~head#1.offset; [2025-02-08 05:36:25,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1080-5: havoc list_add_#t~mem7#1.base, list_add_#t~mem7#1.offset, list_add_#t~nondet8#1, list_add_#t~nondet9#1, list_add_#t~nondet10#1, list_add_#t~nondet11#1, list_add_~new#1.base, list_add_~new#1.offset, list_add_~head#1.base, list_add_~head#1.offset, list_add_~next~0#1.base, list_add_~next~0#1.offset; [2025-02-08 05:36:25,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1080-6: havoc list_add_#t~mem7#1.base, list_add_#t~mem7#1.offset, list_add_#t~nondet8#1, list_add_#t~nondet9#1, list_add_#t~nondet10#1, list_add_#t~nondet11#1, list_add_~new#1.base, list_add_~new#1.offset, list_add_~head#1.base, list_add_~head#1.offset, list_add_~next~0#1.base, list_add_~next~0#1.offset; [2025-02-08 05:36:25,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1080-7: assume { :end_inline_new } true;assume { :begin_inline_list_add } true;list_add_#in~new#1.base, list_add_#in~new#1.offset, list_add_#in~head#1.base, list_add_#in~head#1.offset := main_#t~ret52#1.base, 4 + main_#t~ret52#1.offset, ~#c~0.base, ~#c~0.offset + 8 * main_~i~0#1; [2025-02-08 05:36:25,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1080-8: havoc new_#in~x#1; [2025-02-08 05:36:25,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1080-9: havoc new_#t~malloc5#1.base, new_#t~malloc5#1.offset, new_#t~nondet6#1, new_~x#1, new_~p~0#1.base, new_~p~0#1.offset; [2025-02-08 05:36:25,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1080-10: main_#t~ret52#1.base, main_#t~ret52#1.offset := new_#res#1.base, new_#res#1.offset; [2025-02-08 05:36:25,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1031: assume ((#race[list_add_~new#1.base,list_add_~new#1.offset] == list_add_#t~nondet9#1 && #race[list_add_~new#1.base,1 + list_add_~new#1.offset] == list_add_#t~nondet9#1) && #race[list_add_~new#1.base,2 + list_add_~new#1.offset] == list_add_#t~nondet9#1) && #race[list_add_~new#1.base,3 + list_add_~new#1.offset] == list_add_#t~nondet9#1; [2025-02-08 05:36:25,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1031: assume !(((#race[list_add_~new#1.base,list_add_~new#1.offset] == list_add_#t~nondet9#1 && #race[list_add_~new#1.base,1 + list_add_~new#1.offset] == list_add_#t~nondet9#1) && #race[list_add_~new#1.base,2 + list_add_~new#1.offset] == list_add_#t~nondet9#1) && #race[list_add_~new#1.base,3 + list_add_~new#1.offset] == list_add_#t~nondet9#1); [2025-02-08 05:36:25,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1031-1: havoc list_add_#t~nondet9#1; [2025-02-08 05:36:25,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1031-2: #race := #race[list_add_~new#1.base,3 + list_add_~new#1.offset := list_add_#t~nondet9#1]; [2025-02-08 05:36:25,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1031-3: #race := #race[list_add_~new#1.base,2 + list_add_~new#1.offset := list_add_#t~nondet9#1]; [2025-02-08 05:36:25,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1031-4: #race := #race[list_add_~new#1.base,1 + list_add_~new#1.offset := list_add_#t~nondet9#1]; [2025-02-08 05:36:25,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1031-5: #race := #race[list_add_~new#1.base,list_add_~new#1.offset := list_add_#t~nondet9#1]; [2025-02-08 05:36:25,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1031-6: havoc list_add_#t~nondet9#1; [2025-02-08 05:36:25,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1031-7: SUMMARY for call write~$Pointer$(list_add_~next~0#1.base, list_add_~next~0#1.offset, list_add_~new#1.base, list_add_~new#1.offset, 4); srcloc: null [2025-02-08 05:36:25,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1032: assume ((#race[list_add_~new#1.base,4 + list_add_~new#1.offset] == list_add_#t~nondet10#1 && #race[list_add_~new#1.base,5 + list_add_~new#1.offset] == list_add_#t~nondet10#1) && #race[list_add_~new#1.base,6 + list_add_~new#1.offset] == list_add_#t~nondet10#1) && #race[list_add_~new#1.base,7 + list_add_~new#1.offset] == list_add_#t~nondet10#1; [2025-02-08 05:36:25,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1032: assume !(((#race[list_add_~new#1.base,4 + list_add_~new#1.offset] == list_add_#t~nondet10#1 && #race[list_add_~new#1.base,5 + list_add_~new#1.offset] == list_add_#t~nondet10#1) && #race[list_add_~new#1.base,6 + list_add_~new#1.offset] == list_add_#t~nondet10#1) && #race[list_add_~new#1.base,7 + list_add_~new#1.offset] == list_add_#t~nondet10#1); [2025-02-08 05:36:25,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1032-1: havoc list_add_#t~nondet10#1; [2025-02-08 05:36:25,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1032-2: #race := #race[list_add_~new#1.base,7 + list_add_~new#1.offset := list_add_#t~nondet10#1]; [2025-02-08 05:36:25,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1032-3: #race := #race[list_add_~new#1.base,6 + list_add_~new#1.offset := list_add_#t~nondet10#1]; [2025-02-08 05:36:25,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1032-4: #race := #race[list_add_~new#1.base,5 + list_add_~new#1.offset := list_add_#t~nondet10#1]; [2025-02-08 05:36:25,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1032-5: #race := #race[list_add_~new#1.base,4 + list_add_~new#1.offset := list_add_#t~nondet10#1]; [2025-02-08 05:36:25,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1032-6: havoc list_add_#t~nondet10#1; [2025-02-08 05:36:25,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1032-7: SUMMARY for call write~$Pointer$(list_add_~head#1.base, list_add_~head#1.offset, list_add_~new#1.base, 4 + list_add_~new#1.offset, 4); srcloc: null [2025-02-08 05:36:25,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1082: havoc main_~#t2_ids~0#1.base, main_~#t2_ids~0#1.offset; [2025-02-08 05:36:25,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1082-1: SUMMARY for call ULTIMATE.dealloc(main_~#t2_ids~0#1.base, main_~#t2_ids~0#1.offset); srcloc: null [2025-02-08 05:36:25,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1082-2: havoc main_~#t1_ids~0#1.base, main_~#t1_ids~0#1.offset; [2025-02-08 05:36:25,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1082-3: SUMMARY for call ULTIMATE.dealloc(main_~#t1_ids~0#1.base, main_~#t1_ids~0#1.offset); srcloc: null [2025-02-08 05:36:25,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1033: assume ((#race[list_add_~head#1.base,list_add_~head#1.offset] == list_add_#t~nondet11#1 && #race[list_add_~head#1.base,1 + list_add_~head#1.offset] == list_add_#t~nondet11#1) && #race[list_add_~head#1.base,2 + list_add_~head#1.offset] == list_add_#t~nondet11#1) && #race[list_add_~head#1.base,3 + list_add_~head#1.offset] == list_add_#t~nondet11#1; [2025-02-08 05:36:25,049 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1033: assume !(((#race[list_add_~head#1.base,list_add_~head#1.offset] == list_add_#t~nondet11#1 && #race[list_add_~head#1.base,1 + list_add_~head#1.offset] == list_add_#t~nondet11#1) && #race[list_add_~head#1.base,2 + list_add_~head#1.offset] == list_add_#t~nondet11#1) && #race[list_add_~head#1.base,3 + list_add_~head#1.offset] == list_add_#t~nondet11#1); [2025-02-08 05:36:25,049 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1033-1: havoc list_add_#t~nondet11#1; [2025-02-08 05:36:25,049 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1033-2: #race := #race[list_add_~head#1.base,3 + list_add_~head#1.offset := list_add_#t~nondet11#1]; [2025-02-08 05:36:25,049 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1033-3: #race := #race[list_add_~head#1.base,2 + list_add_~head#1.offset := list_add_#t~nondet11#1]; [2025-02-08 05:36:25,049 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1033-4: #race := #race[list_add_~head#1.base,1 + list_add_~head#1.offset := list_add_#t~nondet11#1]; [2025-02-08 05:36:25,049 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1033-5: #race := #race[list_add_~head#1.base,list_add_~head#1.offset := list_add_#t~nondet11#1]; [2025-02-08 05:36:25,049 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1033-6: havoc list_add_#t~nondet11#1; [2025-02-08 05:36:25,049 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1033-7: SUMMARY for call write~$Pointer$(list_add_~new#1.base, list_add_~new#1.offset, list_add_~head#1.base, list_add_~head#1.offset, 4); srcloc: null [2025-02-08 05:36:25,050 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:36:25,050 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:36:25,089 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:36:25,090 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:36:25,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:36:25 BoogieIcfgContainer [2025-02-08 05:36:25,090 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:36:25,091 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:36:25,091 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:36:25,098 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:36:25,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:36:23" (1/3) ... [2025-02-08 05:36:25,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b1da424 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:36:25, skipping insertion in model container [2025-02-08 05:36:25,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:23" (2/3) ... [2025-02-08 05:36:25,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b1da424 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:36:25, skipping insertion in model container [2025-02-08 05:36:25,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:36:25" (3/3) ... [2025-02-08 05:36:25,099 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_90-arrayloop2_racing.i [2025-02-08 05:36:25,111 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:36:25,112 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_90-arrayloop2_racing.i that has 3 procedures, 496 locations, 1 initial locations, 20 loop locations, and 28 error locations. [2025-02-08 05:36:25,112 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:36:25,225 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-08 05:36:25,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 502 places, 534 transitions, 1088 flow [2025-02-08 05:36:25,503 INFO L124 PetriNetUnfolderBase]: 57/844 cut-off events. [2025-02-08 05:36:25,505 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-08 05:36:25,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 861 conditions, 844 events. 57/844 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4072 event pairs, 0 based on Foata normal form. 0/740 useless extension candidates. Maximal degree in co-relation 444. Up to 8 conditions per place. [2025-02-08 05:36:25,520 INFO L82 GeneralOperation]: Start removeDead. Operand has 502 places, 534 transitions, 1088 flow [2025-02-08 05:36:25,528 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 497 places, 529 transitions, 1078 flow [2025-02-08 05:36:25,538 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:36:25,554 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;@7aa26f1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:36:25,554 INFO L334 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2025-02-08 05:36:25,566 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:36:25,566 INFO L124 PetriNetUnfolderBase]: 0/119 cut-off events. [2025-02-08 05:36:25,566 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:36:25,567 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:36:25,567 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] [2025-02-08 05:36:25,568 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE, t2_funErr4ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:36:25,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:36:25,571 INFO L85 PathProgramCache]: Analyzing trace with hash -8571961, now seen corresponding path program 1 times [2025-02-08 05:36:25,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:36:25,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837855561] [2025-02-08 05:36:25,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:36:25,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:36:25,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-08 05:36:25,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-08 05:36:25,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:36:25,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:36:26,549 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:36:26,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:36:26,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837855561] [2025-02-08 05:36:26,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837855561] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:36:26,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:36:26,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:36:26,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327060940] [2025-02-08 05:36:26,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:36:26,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:36:26,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:36:26,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:36:26,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:36:27,094 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 386 out of 534 [2025-02-08 05:36:27,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 497 places, 529 transitions, 1078 flow. Second operand has 6 states, 6 states have (on average 387.3333333333333) internal successors, (2324), 6 states have internal predecessors, (2324), 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:36:27,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:36:27,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 386 of 534 [2025-02-08 05:36:27,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:36:38,487 INFO L124 PetriNetUnfolderBase]: 39309/102292 cut-off events. [2025-02-08 05:36:38,489 INFO L125 PetriNetUnfolderBase]: For 965/1152 co-relation queries the response was YES. [2025-02-08 05:36:38,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160414 conditions, 102292 events. 39309/102292 cut-off events. For 965/1152 co-relation queries the response was YES. Maximal size of possible extension queue 2018. Compared 1290160 event pairs, 34452 based on Foata normal form. 14874/108336 useless extension candidates. Maximal degree in co-relation 156256. Up to 57727 conditions per place. [2025-02-08 05:36:39,279 INFO L140 encePairwiseOnDemand]: 496/534 looper letters, 107 selfloop transitions, 10 changer transitions 0/497 dead transitions. [2025-02-08 05:36:39,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 496 places, 497 transitions, 1248 flow [2025-02-08 05:36:39,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:36:39,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:36:39,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2461 transitions. [2025-02-08 05:36:39,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7681023720349563 [2025-02-08 05:36:39,295 INFO L175 Difference]: Start difference. First operand has 497 places, 529 transitions, 1078 flow. Second operand 6 states and 2461 transitions. [2025-02-08 05:36:39,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 496 places, 497 transitions, 1248 flow [2025-02-08 05:36:39,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 496 places, 497 transitions, 1248 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:36:39,307 INFO L231 Difference]: Finished difference. Result has 496 places, 497 transitions, 1034 flow [2025-02-08 05:36:39,309 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=1014, PETRI_DIFFERENCE_MINUEND_PLACES=491, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=497, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=487, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1034, PETRI_PLACES=496, PETRI_TRANSITIONS=497} [2025-02-08 05:36:39,311 INFO L279 CegarLoopForPetriNet]: 497 programPoint places, -1 predicate places. [2025-02-08 05:36:39,312 INFO L471 AbstractCegarLoop]: Abstraction has has 496 places, 497 transitions, 1034 flow [2025-02-08 05:36:39,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 387.3333333333333) internal successors, (2324), 6 states have internal predecessors, (2324), 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:36:39,313 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:36:39,313 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:36:39,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:36:39,313 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE, t2_funErr4ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:36:39,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:36:39,314 INFO L85 PathProgramCache]: Analyzing trace with hash 334408791, now seen corresponding path program 1 times [2025-02-08 05:36:39,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:36:39,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933531981] [2025-02-08 05:36:39,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:36:39,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:36:39,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-08 05:36:39,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-08 05:36:39,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:36:39,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:36:39,397 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:36:39,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:36:39,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933531981] [2025-02-08 05:36:39,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933531981] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:36:39,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:36:39,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:36:39,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843419762] [2025-02-08 05:36:39,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:36:39,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:36:39,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:36:39,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:36:39,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:36:39,417 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 478 out of 534 [2025-02-08 05:36:39,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 496 places, 497 transitions, 1034 flow. Second operand has 3 states, 3 states have (on average 479.3333333333333) internal successors, (1438), 3 states have internal predecessors, (1438), 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:36:39,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:36:39,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 478 of 534 [2025-02-08 05:36:39,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:36:39,886 INFO L124 PetriNetUnfolderBase]: 388/4186 cut-off events. [2025-02-08 05:36:39,886 INFO L125 PetriNetUnfolderBase]: For 185/186 co-relation queries the response was YES. [2025-02-08 05:36:39,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4858 conditions, 4186 events. 388/4186 cut-off events. For 185/186 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 38038 event pairs, 264 based on Foata normal form. 1/3806 useless extension candidates. Maximal degree in co-relation 4657. Up to 567 conditions per place. [2025-02-08 05:36:39,922 INFO L140 encePairwiseOnDemand]: 531/534 looper letters, 27 selfloop transitions, 2 changer transitions 0/498 dead transitions. [2025-02-08 05:36:39,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 498 places, 498 transitions, 1094 flow [2025-02-08 05:36:39,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:36:39,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:36:39,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1464 transitions. [2025-02-08 05:36:39,926 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9138576779026217 [2025-02-08 05:36:39,926 INFO L175 Difference]: Start difference. First operand has 496 places, 497 transitions, 1034 flow. Second operand 3 states and 1464 transitions. [2025-02-08 05:36:39,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 498 places, 498 transitions, 1094 flow [2025-02-08 05:36:39,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 493 places, 498 transitions, 1074 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:36:39,953 INFO L231 Difference]: Finished difference. Result has 494 places, 498 transitions, 1026 flow [2025-02-08 05:36:39,954 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=1014, PETRI_DIFFERENCE_MINUEND_PLACES=491, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=497, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=495, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1026, PETRI_PLACES=494, PETRI_TRANSITIONS=498} [2025-02-08 05:36:39,959 INFO L279 CegarLoopForPetriNet]: 497 programPoint places, -3 predicate places. [2025-02-08 05:36:39,959 INFO L471 AbstractCegarLoop]: Abstraction has has 494 places, 498 transitions, 1026 flow [2025-02-08 05:36:39,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 479.3333333333333) internal successors, (1438), 3 states have internal predecessors, (1438), 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:36:39,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:36:39,960 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] [2025-02-08 05:36:39,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:36:39,960 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE, t2_funErr4ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:36:39,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:36:39,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1250332101, now seen corresponding path program 1 times [2025-02-08 05:36:39,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:36:39,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099166238] [2025-02-08 05:36:39,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:36:39,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:36:40,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-08 05:36:40,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-08 05:36:40,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:36:40,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:36:40,445 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:36:40,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:36:40,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099166238] [2025-02-08 05:36:40,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099166238] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:36:40,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:36:40,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:36:40,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622418892] [2025-02-08 05:36:40,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:36:40,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:36:40,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:36:40,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:36:40,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:36:40,917 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 386 out of 534 [2025-02-08 05:36:40,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 494 places, 498 transitions, 1026 flow. Second operand has 6 states, 6 states have (on average 387.3333333333333) internal successors, (2324), 6 states have internal predecessors, (2324), 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:36:40,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:36:40,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 386 of 534 [2025-02-08 05:36:40,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:36:54,463 INFO L124 PetriNetUnfolderBase]: 39309/102352 cut-off events. [2025-02-08 05:36:54,463 INFO L125 PetriNetUnfolderBase]: For 952/1139 co-relation queries the response was YES. [2025-02-08 05:36:54,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160500 conditions, 102352 events. 39309/102352 cut-off events. For 952/1139 co-relation queries the response was YES. Maximal size of possible extension queue 2016. Compared 1291620 event pairs, 34452 based on Foata normal form. 2/93524 useless extension candidates. Maximal degree in co-relation 160318. Up to 57738 conditions per place. [2025-02-08 05:36:55,010 INFO L140 encePairwiseOnDemand]: 523/534 looper letters, 103 selfloop transitions, 5 changer transitions 19/496 dead transitions. [2025-02-08 05:36:55,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 497 places, 496 transitions, 1252 flow [2025-02-08 05:36:55,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:36:55,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:36:55,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2433 transitions. [2025-02-08 05:36:55,021 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7593632958801498 [2025-02-08 05:36:55,022 INFO L175 Difference]: Start difference. First operand has 494 places, 498 transitions, 1026 flow. Second operand 6 states and 2433 transitions. [2025-02-08 05:36:55,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 497 places, 496 transitions, 1252 flow [2025-02-08 05:36:55,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 496 places, 496 transitions, 1250 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:36:55,037 INFO L231 Difference]: Finished difference. Result has 496 places, 477 transitions, 992 flow [2025-02-08 05:36:55,037 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=1020, PETRI_DIFFERENCE_MINUEND_PLACES=491, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=496, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=491, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=992, PETRI_PLACES=496, PETRI_TRANSITIONS=477} [2025-02-08 05:36:55,038 INFO L279 CegarLoopForPetriNet]: 497 programPoint places, -1 predicate places. [2025-02-08 05:36:55,038 INFO L471 AbstractCegarLoop]: Abstraction has has 496 places, 477 transitions, 992 flow [2025-02-08 05:36:55,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 387.3333333333333) internal successors, (2324), 6 states have internal predecessors, (2324), 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:36:55,044 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:36:55,044 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] [2025-02-08 05:36:55,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:36:55,044 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE, t2_funErr4ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:36:55,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:36:55,046 INFO L85 PathProgramCache]: Analyzing trace with hash 2066439908, now seen corresponding path program 1 times [2025-02-08 05:36:55,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:36:55,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773354078] [2025-02-08 05:36:55,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:36:55,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:36:55,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-08 05:36:55,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-08 05:36:55,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:36:55,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:36:55,629 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:36:55,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:36:55,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773354078] [2025-02-08 05:36:55,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773354078] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:36:55,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:36:55,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:36:55,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723258155] [2025-02-08 05:36:55,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:36:55,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:36:55,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:36:55,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:36:55,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:36:55,935 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 386 out of 534 [2025-02-08 05:36:55,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 496 places, 477 transitions, 992 flow. Second operand has 6 states, 6 states have (on average 388.6666666666667) internal successors, (2332), 6 states have internal predecessors, (2332), 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:36:55,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:36:55,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 386 of 534 [2025-02-08 05:36:55,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand