./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_94-alloc_region_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 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_94-alloc_region_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 7faac9952fd378b53dcd8f21391daa9cc75834f7be2a5ad0c70d96fc8524bd08 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:29:24,758 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:29:24,823 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:29:24,830 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:29:24,835 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:29:24,856 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:29:24,856 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:29:24,857 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:29:24,857 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:29:24,857 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:29:24,857 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:29:24,858 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:29:24,858 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:29:24,858 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:29:24,858 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:29:24,858 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:29:24,858 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:29:24,858 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:29:24,859 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:29:24,859 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:29:24,859 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:29:24,859 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:29:24,859 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:29:24,859 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:29:24,859 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:29:24,860 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:29:24,860 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:29:24,860 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:29:24,860 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:29:24,860 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:29:24,860 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:29:24,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:29:24,860 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:29:24,861 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:29:24,861 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:29:24,861 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:29:24,861 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:29:24,861 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:29:24,861 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:29:24,861 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:29:24,862 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:29:24,862 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:29:24,862 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:29:24,862 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:29:24,862 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:29:24,862 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:29:24,862 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 -> 7faac9952fd378b53dcd8f21391daa9cc75834f7be2a5ad0c70d96fc8524bd08 [2025-01-09 21:29:25,213 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:29:25,223 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:29:25,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:29:25,227 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:29:25,228 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:29:25,229 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_94-alloc_region_racing.i [2025-01-09 21:29:26,562 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2d2ec8788/9a20cccd3245491489bb5c870eaaa69b/FLAG6c12d94e0 [2025-01-09 21:29:26,914 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:29:26,914 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_94-alloc_region_racing.i [2025-01-09 21:29:26,934 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2d2ec8788/9a20cccd3245491489bb5c870eaaa69b/FLAG6c12d94e0 [2025-01-09 21:29:26,951 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2d2ec8788/9a20cccd3245491489bb5c870eaaa69b [2025-01-09 21:29:26,953 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:29:26,954 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:29:26,957 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:29:26,957 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:29:26,961 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:29:26,962 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:29:26" (1/1) ... [2025-01-09 21:29:26,963 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c60e3a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:26, skipping insertion in model container [2025-01-09 21:29:26,963 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:29:26" (1/1) ... [2025-01-09 21:29:27,009 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:29:27,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:29:27,472 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:29:27,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:29:27,615 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:29:27,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:27 WrapperNode [2025-01-09 21:29:27,616 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:29:27,617 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:29:27,617 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:29:27,617 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:29:27,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:27" (1/1) ... [2025-01-09 21:29:27,645 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:27" (1/1) ... [2025-01-09 21:29:27,688 INFO L138 Inliner]: procedures = 378, calls = 83, calls flagged for inlining = 10, calls inlined = 11, statements flattened = 429 [2025-01-09 21:29:27,689 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:29:27,689 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:29:27,689 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:29:27,689 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:29:27,697 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:27" (1/1) ... [2025-01-09 21:29:27,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:27" (1/1) ... [2025-01-09 21:29:27,707 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:27" (1/1) ... [2025-01-09 21:29:27,707 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:27" (1/1) ... [2025-01-09 21:29:27,731 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:27" (1/1) ... [2025-01-09 21:29:27,734 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:27" (1/1) ... [2025-01-09 21:29:27,738 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:27" (1/1) ... [2025-01-09 21:29:27,740 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:27" (1/1) ... [2025-01-09 21:29:27,742 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:27" (1/1) ... [2025-01-09 21:29:27,746 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:29:27,751 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:29:27,751 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:29:27,751 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:29:27,752 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:27" (1/1) ... [2025-01-09 21:29:27,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:29:27,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:29:27,789 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-01-09 21:29:27,793 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-01-09 21:29:27,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 21:29:27,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-01-09 21:29:27,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:29:27,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-01-09 21:29:27,817 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:29:27,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:29:27,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:29:27,817 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:29:27,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:29:27,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:29:27,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-09 21:29:27,818 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-09 21:29:27,818 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-09 21:29:27,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:29:27,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:29:27,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:29:27,820 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:29:27,991 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:29:27,993 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:29:28,750 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:29:28,751 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:29:28,790 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:29:28,790 INFO L312 CfgBuilder]: Removed 11 assume(true) statements. [2025-01-09 21:29:28,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:29:28 BoogieIcfgContainer [2025-01-09 21:29:28,791 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:29:28,793 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:29:28,793 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:29:28,798 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:29:28,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:29:26" (1/3) ... [2025-01-09 21:29:28,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e2183ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:29:28, skipping insertion in model container [2025-01-09 21:29:28,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:27" (2/3) ... [2025-01-09 21:29:28,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e2183ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:29:28, skipping insertion in model container [2025-01-09 21:29:28,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:29:28" (3/3) ... [2025-01-09 21:29:28,800 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_94-alloc_region_racing.i [2025-01-09 21:29:28,815 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:29:28,816 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_94-alloc_region_racing.i that has 2 procedures, 441 locations, 1 initial locations, 13 loop locations, and 29 error locations. [2025-01-09 21:29:28,816 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:29:28,947 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-09 21:29:28,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 444 places, 470 transitions, 947 flow [2025-01-09 21:29:29,280 INFO L124 PetriNetUnfolderBase]: 44/690 cut-off events. [2025-01-09 21:29:29,282 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:29:29,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 695 conditions, 690 events. 44/690 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2335 event pairs, 0 based on Foata normal form. 0/599 useless extension candidates. Maximal degree in co-relation 386. Up to 8 conditions per place. [2025-01-09 21:29:29,301 INFO L82 GeneralOperation]: Start removeDead. Operand has 444 places, 470 transitions, 947 flow [2025-01-09 21:29:29,313 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 444 places, 470 transitions, 947 flow [2025-01-09 21:29:29,325 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:29:29,341 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;@7191a746, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:29:29,342 INFO L334 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2025-01-09 21:29:29,350 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:29:29,350 INFO L124 PetriNetUnfolderBase]: 0/40 cut-off events. [2025-01-09 21:29:29,350 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:29:29,351 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:29,351 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] [2025-01-09 21:29:29,352 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2025-01-09 21:29:29,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:29,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1649755205, now seen corresponding path program 1 times [2025-01-09 21:29:29,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:29,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766999092] [2025-01-09 21:29:29,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:29,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:29,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 21:29:29,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 21:29:29,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:29,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:30,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:30,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:30,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766999092] [2025-01-09 21:29:30,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766999092] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:30,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:30,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:29:30,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316728988] [2025-01-09 21:29:30,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:30,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:29:30,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:30,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:29:30,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:29:30,928 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 470 [2025-01-09 21:29:30,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 470 transitions, 947 flow. Second operand has 6 states, 6 states have (on average 297.3333333333333) internal successors, (1784), 6 states have internal predecessors, (1784), 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-01-09 21:29:30,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:30,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 470 [2025-01-09 21:29:30,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:33,767 INFO L124 PetriNetUnfolderBase]: 3778/14423 cut-off events. [2025-01-09 21:29:33,768 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:29:33,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21913 conditions, 14423 events. 3778/14423 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 135239 event pairs, 3600 based on Foata normal form. 1182/14472 useless extension candidates. Maximal degree in co-relation 21522. Up to 7480 conditions per place. [2025-01-09 21:29:33,898 INFO L140 encePairwiseOnDemand]: 439/470 looper letters, 141 selfloop transitions, 5 changer transitions 0/440 dead transitions. [2025-01-09 21:29:33,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 440 transitions, 1179 flow [2025-01-09 21:29:33,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:29:33,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:29:33,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1948 transitions. [2025-01-09 21:29:33,940 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6907801418439716 [2025-01-09 21:29:33,944 INFO L175 Difference]: Start difference. First operand has 444 places, 470 transitions, 947 flow. Second operand 6 states and 1948 transitions. [2025-01-09 21:29:33,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 440 transitions, 1179 flow [2025-01-09 21:29:33,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 440 transitions, 1179 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:29:33,980 INFO L231 Difference]: Finished difference. Result has 444 places, 440 transitions, 897 flow [2025-01-09 21:29:33,988 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=887, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=435, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=897, PETRI_PLACES=444, PETRI_TRANSITIONS=440} [2025-01-09 21:29:33,995 INFO L279 CegarLoopForPetriNet]: 444 programPoint places, 0 predicate places. [2025-01-09 21:29:34,001 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 440 transitions, 897 flow [2025-01-09 21:29:34,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 297.3333333333333) internal successors, (1784), 6 states have internal predecessors, (1784), 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-01-09 21:29:34,002 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:34,002 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] [2025-01-09 21:29:34,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:29:34,003 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2025-01-09 21:29:34,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:34,004 INFO L85 PathProgramCache]: Analyzing trace with hash 978449599, now seen corresponding path program 1 times [2025-01-09 21:29:34,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:34,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554299244] [2025-01-09 21:29:34,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:34,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:34,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 21:29:34,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 21:29:34,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:34,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:34,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:34,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:34,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554299244] [2025-01-09 21:29:34,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554299244] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:34,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:34,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:29:34,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611809758] [2025-01-09 21:29:34,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:34,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:29:34,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:34,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:29:34,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:29:35,427 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 343 out of 470 [2025-01-09 21:29:35,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 440 transitions, 897 flow. Second operand has 6 states, 6 states have (on average 344.8333333333333) internal successors, (2069), 6 states have internal predecessors, (2069), 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-01-09 21:29:35,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:35,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 343 of 470 [2025-01-09 21:29:35,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:37,576 INFO L124 PetriNetUnfolderBase]: 1984/12419 cut-off events. [2025-01-09 21:29:37,577 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-01-09 21:29:37,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16294 conditions, 12419 events. 1984/12419 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 123003 event pairs, 1166 based on Foata normal form. 0/11250 useless extension candidates. Maximal degree in co-relation 16236. Up to 3409 conditions per place. [2025-01-09 21:29:37,636 INFO L140 encePairwiseOnDemand]: 433/470 looper letters, 138 selfloop transitions, 107 changer transitions 0/585 dead transitions. [2025-01-09 21:29:37,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 585 transitions, 1680 flow [2025-01-09 21:29:37,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:29:37,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:29:37,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2305 transitions. [2025-01-09 21:29:37,643 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8173758865248227 [2025-01-09 21:29:37,643 INFO L175 Difference]: Start difference. First operand has 444 places, 440 transitions, 897 flow. Second operand 6 states and 2305 transitions. [2025-01-09 21:29:37,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 585 transitions, 1680 flow [2025-01-09 21:29:37,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 585 transitions, 1670 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:29:37,656 INFO L231 Difference]: Finished difference. Result has 448 places, 540 transitions, 1575 flow [2025-01-09 21:29:37,656 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=885, PETRI_DIFFERENCE_MINUEND_PLACES=438, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1575, PETRI_PLACES=448, PETRI_TRANSITIONS=540} [2025-01-09 21:29:37,657 INFO L279 CegarLoopForPetriNet]: 444 programPoint places, 4 predicate places. [2025-01-09 21:29:37,657 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 540 transitions, 1575 flow [2025-01-09 21:29:37,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 344.8333333333333) internal successors, (2069), 6 states have internal predecessors, (2069), 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-01-09 21:29:37,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:37,659 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:37,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:29:37,659 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2025-01-09 21:29:37,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:37,660 INFO L85 PathProgramCache]: Analyzing trace with hash 22833872, now seen corresponding path program 1 times [2025-01-09 21:29:37,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:37,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019812890] [2025-01-09 21:29:37,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:37,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:37,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 21:29:37,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 21:29:37,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:37,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:37,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:37,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:37,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019812890] [2025-01-09 21:29:37,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019812890] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:37,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:37,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:29:37,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988601586] [2025-01-09 21:29:37,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:37,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:29:37,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:37,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:29:37,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:29:38,495 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 470 [2025-01-09 21:29:38,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 540 transitions, 1575 flow. Second operand has 6 states, 6 states have (on average 301.6666666666667) internal successors, (1810), 6 states have internal predecessors, (1810), 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-01-09 21:29:38,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:38,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 470 [2025-01-09 21:29:38,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:41,242 INFO L124 PetriNetUnfolderBase]: 5534/21166 cut-off events. [2025-01-09 21:29:41,242 INFO L125 PetriNetUnfolderBase]: For 3362/3412 co-relation queries the response was YES. [2025-01-09 21:29:41,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36340 conditions, 21166 events. 5534/21166 cut-off events. For 3362/3412 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 216192 event pairs, 3888 based on Foata normal form. 0/19303 useless extension candidates. Maximal degree in co-relation 35817. Up to 10652 conditions per place. [2025-01-09 21:29:41,463 INFO L140 encePairwiseOnDemand]: 417/470 looper letters, 277 selfloop transitions, 171 changer transitions 0/744 dead transitions. [2025-01-09 21:29:41,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 744 transitions, 3071 flow [2025-01-09 21:29:41,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:29:41,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:29:41,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2144 transitions. [2025-01-09 21:29:41,469 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7602836879432624 [2025-01-09 21:29:41,469 INFO L175 Difference]: Start difference. First operand has 448 places, 540 transitions, 1575 flow. Second operand 6 states and 2144 transitions. [2025-01-09 21:29:41,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 744 transitions, 3071 flow [2025-01-09 21:29:41,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 744 transitions, 3071 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:29:41,497 INFO L231 Difference]: Finished difference. Result has 457 places, 704 transitions, 2871 flow [2025-01-09 21:29:41,500 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=1573, PETRI_DIFFERENCE_MINUEND_PLACES=447, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=488, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2871, PETRI_PLACES=457, PETRI_TRANSITIONS=704} [2025-01-09 21:29:41,501 INFO L279 CegarLoopForPetriNet]: 444 programPoint places, 13 predicate places. [2025-01-09 21:29:41,501 INFO L471 AbstractCegarLoop]: Abstraction has has 457 places, 704 transitions, 2871 flow [2025-01-09 21:29:41,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 301.6666666666667) internal successors, (1810), 6 states have internal predecessors, (1810), 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-01-09 21:29:41,503 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:41,503 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-01-09 21:29:41,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:29:41,503 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2025-01-09 21:29:41,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:41,505 INFO L85 PathProgramCache]: Analyzing trace with hash 408889211, now seen corresponding path program 1 times [2025-01-09 21:29:41,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:41,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685125287] [2025-01-09 21:29:41,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:41,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:41,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 21:29:41,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 21:29:41,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:41,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:41,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:41,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:41,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685125287] [2025-01-09 21:29:41,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685125287] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:41,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:41,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:29:41,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204070257] [2025-01-09 21:29:41,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:41,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:29:41,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:41,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:29:41,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:29:42,328 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 470 [2025-01-09 21:29:42,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 704 transitions, 2871 flow. Second operand has 6 states, 6 states have (on average 301.6666666666667) internal successors, (1810), 6 states have internal predecessors, (1810), 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-01-09 21:29:42,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:42,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 470 [2025-01-09 21:29:42,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:45,715 INFO L124 PetriNetUnfolderBase]: 5975/22678 cut-off events. [2025-01-09 21:29:45,715 INFO L125 PetriNetUnfolderBase]: For 7258/7320 co-relation queries the response was YES. [2025-01-09 21:29:45,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43635 conditions, 22678 events. 5975/22678 cut-off events. For 7258/7320 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 231774 event pairs, 3928 based on Foata normal form. 0/20750 useless extension candidates. Maximal degree in co-relation 43088. Up to 11147 conditions per place. [2025-01-09 21:29:45,831 INFO L140 encePairwiseOnDemand]: 417/470 looper letters, 437 selfloop transitions, 171 changer transitions 0/908 dead transitions. [2025-01-09 21:29:45,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 908 transitions, 5007 flow [2025-01-09 21:29:45,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:29:45,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:29:45,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2144 transitions. [2025-01-09 21:29:45,836 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7602836879432624 [2025-01-09 21:29:45,837 INFO L175 Difference]: Start difference. First operand has 457 places, 704 transitions, 2871 flow. Second operand 6 states and 2144 transitions. [2025-01-09 21:29:45,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 461 places, 908 transitions, 5007 flow [2025-01-09 21:29:45,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 461 places, 908 transitions, 4815 flow, removed 96 selfloop flow, removed 0 redundant places. [2025-01-09 21:29:45,870 INFO L231 Difference]: Finished difference. Result has 466 places, 868 transitions, 4295 flow [2025-01-09 21:29:45,871 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=2677, PETRI_DIFFERENCE_MINUEND_PLACES=456, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=703, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=652, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4295, PETRI_PLACES=466, PETRI_TRANSITIONS=868} [2025-01-09 21:29:45,871 INFO L279 CegarLoopForPetriNet]: 444 programPoint places, 22 predicate places. [2025-01-09 21:29:45,872 INFO L471 AbstractCegarLoop]: Abstraction has has 466 places, 868 transitions, 4295 flow [2025-01-09 21:29:45,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 301.6666666666667) internal successors, (1810), 6 states have internal predecessors, (1810), 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-01-09 21:29:45,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:45,873 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:45,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:29:45,873 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2025-01-09 21:29:45,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:45,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1548790379, now seen corresponding path program 1 times [2025-01-09 21:29:45,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:45,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846181539] [2025-01-09 21:29:45,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:45,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:45,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 21:29:45,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 21:29:45,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:45,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:46,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:46,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:46,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846181539] [2025-01-09 21:29:46,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846181539] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:46,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:46,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:29:46,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736095611] [2025-01-09 21:29:46,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:46,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:29:46,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:46,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:29:46,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:29:47,141 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 470 [2025-01-09 21:29:47,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 466 places, 868 transitions, 4295 flow. Second operand has 6 states, 6 states have (on average 299.1666666666667) internal successors, (1795), 6 states have internal predecessors, (1795), 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-01-09 21:29:47,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:47,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 470 [2025-01-09 21:29:47,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:50,601 INFO L124 PetriNetUnfolderBase]: 6422/23859 cut-off events. [2025-01-09 21:29:50,601 INFO L125 PetriNetUnfolderBase]: For 13628/13752 co-relation queries the response was YES. [2025-01-09 21:29:50,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51715 conditions, 23859 events. 6422/23859 cut-off events. For 13628/13752 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 244530 event pairs, 3870 based on Foata normal form. 0/21844 useless extension candidates. Maximal degree in co-relation 51088. Up to 12188 conditions per place. [2025-01-09 21:29:50,771 INFO L140 encePairwiseOnDemand]: 423/470 looper letters, 613 selfloop transitions, 166 changer transitions 0/1073 dead transitions. [2025-01-09 21:29:50,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 471 places, 1073 transitions, 7095 flow [2025-01-09 21:29:50,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:29:50,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:29:50,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2124 transitions. [2025-01-09 21:29:50,777 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7531914893617021 [2025-01-09 21:29:50,778 INFO L175 Difference]: Start difference. First operand has 466 places, 868 transitions, 4295 flow. Second operand 6 states and 2124 transitions. [2025-01-09 21:29:50,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 471 places, 1073 transitions, 7095 flow [2025-01-09 21:29:50,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 1073 transitions, 6583 flow, removed 256 selfloop flow, removed 0 redundant places. [2025-01-09 21:29:50,831 INFO L231 Difference]: Finished difference. Result has 476 places, 1033 transitions, 5701 flow [2025-01-09 21:29:50,833 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=3783, PETRI_DIFFERENCE_MINUEND_PLACES=466, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=868, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=822, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5701, PETRI_PLACES=476, PETRI_TRANSITIONS=1033} [2025-01-09 21:29:50,833 INFO L279 CegarLoopForPetriNet]: 444 programPoint places, 32 predicate places. [2025-01-09 21:29:50,834 INFO L471 AbstractCegarLoop]: Abstraction has has 476 places, 1033 transitions, 5701 flow [2025-01-09 21:29:50,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 299.1666666666667) internal successors, (1795), 6 states have internal predecessors, (1795), 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-01-09 21:29:50,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:50,835 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:29:50,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:29:50,836 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2025-01-09 21:29:50,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:50,836 INFO L85 PathProgramCache]: Analyzing trace with hash -639012534, now seen corresponding path program 1 times [2025-01-09 21:29:50,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:50,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553585157] [2025-01-09 21:29:50,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:50,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:50,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 21:29:50,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 21:29:50,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:50,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:29:50,893 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:29:50,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 21:29:50,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 21:29:50,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:50,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:29:50,978 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:29:50,978 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:29:50,979 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 40 remaining) [2025-01-09 21:29:50,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (38 of 40 remaining) [2025-01-09 21:29:50,982 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (37 of 40 remaining) [2025-01-09 21:29:50,982 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (36 of 40 remaining) [2025-01-09 21:29:50,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (35 of 40 remaining) [2025-01-09 21:29:50,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (34 of 40 remaining) [2025-01-09 21:29:50,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (33 of 40 remaining) [2025-01-09 21:29:50,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (32 of 40 remaining) [2025-01-09 21:29:50,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (31 of 40 remaining) [2025-01-09 21:29:50,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (30 of 40 remaining) [2025-01-09 21:29:50,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (29 of 40 remaining) [2025-01-09 21:29:50,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (28 of 40 remaining) [2025-01-09 21:29:50,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (27 of 40 remaining) [2025-01-09 21:29:50,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (26 of 40 remaining) [2025-01-09 21:29:50,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (25 of 40 remaining) [2025-01-09 21:29:50,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (24 of 40 remaining) [2025-01-09 21:29:50,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (23 of 40 remaining) [2025-01-09 21:29:50,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (22 of 40 remaining) [2025-01-09 21:29:50,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (21 of 40 remaining) [2025-01-09 21:29:50,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (20 of 40 remaining) [2025-01-09 21:29:50,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (19 of 40 remaining) [2025-01-09 21:29:50,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (18 of 40 remaining) [2025-01-09 21:29:50,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (17 of 40 remaining) [2025-01-09 21:29:50,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (16 of 40 remaining) [2025-01-09 21:29:50,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (15 of 40 remaining) [2025-01-09 21:29:50,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9ASSERT_VIOLATIONDATA_RACE (14 of 40 remaining) [2025-01-09 21:29:50,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (13 of 40 remaining) [2025-01-09 21:29:50,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONDATA_RACE (12 of 40 remaining) [2025-01-09 21:29:50,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (11 of 40 remaining) [2025-01-09 21:29:50,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONDATA_RACE (10 of 40 remaining) [2025-01-09 21:29:50,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (9 of 40 remaining) [2025-01-09 21:29:50,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (8 of 40 remaining) [2025-01-09 21:29:50,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (7 of 40 remaining) [2025-01-09 21:29:50,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (6 of 40 remaining) [2025-01-09 21:29:50,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (5 of 40 remaining) [2025-01-09 21:29:50,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9ASSERT_VIOLATIONDATA_RACE (4 of 40 remaining) [2025-01-09 21:29:50,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (3 of 40 remaining) [2025-01-09 21:29:50,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONDATA_RACE (2 of 40 remaining) [2025-01-09 21:29:50,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (1 of 40 remaining) [2025-01-09 21:29:50,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONDATA_RACE (0 of 40 remaining) [2025-01-09 21:29:50,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:29:50,987 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-09 21:29:50,990 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:29:50,990 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 21:29:51,087 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:29:51,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 597 places, 635 transitions, 1286 flow [2025-01-09 21:29:51,405 INFO L124 PetriNetUnfolderBase]: 74/1102 cut-off events. [2025-01-09 21:29:51,406 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:29:51,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1114 conditions, 1102 events. 74/1102 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 5050 event pairs, 0 based on Foata normal form. 0/954 useless extension candidates. Maximal degree in co-relation 692. Up to 12 conditions per place. [2025-01-09 21:29:51,432 INFO L82 GeneralOperation]: Start removeDead. Operand has 597 places, 635 transitions, 1286 flow [2025-01-09 21:29:51,448 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 597 places, 635 transitions, 1286 flow [2025-01-09 21:29:51,451 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:29:51,452 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;@7191a746, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:29:51,452 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-01-09 21:29:51,456 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:29:51,456 INFO L124 PetriNetUnfolderBase]: 0/40 cut-off events. [2025-01-09 21:29:51,456 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:29:51,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:51,456 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] [2025-01-09 21:29:51,456 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:29:51,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:51,457 INFO L85 PathProgramCache]: Analyzing trace with hash 696832832, now seen corresponding path program 1 times [2025-01-09 21:29:51,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:51,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662858089] [2025-01-09 21:29:51,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:51,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:51,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 21:29:51,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 21:29:51,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:51,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:51,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:51,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:51,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662858089] [2025-01-09 21:29:51,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662858089] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:51,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:51,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:29:51,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360315896] [2025-01-09 21:29:51,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:51,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:29:51,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:51,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:29:51,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:29:52,444 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 396 out of 635 [2025-01-09 21:29:52,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 597 places, 635 transitions, 1286 flow. Second operand has 6 states, 6 states have (on average 397.3333333333333) internal successors, (2384), 6 states have internal predecessors, (2384), 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-01-09 21:29:52,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:52,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 396 of 635 [2025-01-09 21:29:52,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand