./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_81-list_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_81-list_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 3de6ec2acea23c0ab47fbc2e02ad0931145060ca78b80531ef692b3505f9553b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:28:41,707 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:28:41,764 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:28:41,769 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:28:41,769 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:28:41,788 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:28:41,788 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:28:41,788 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:28:41,789 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:28:41,789 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:28:41,789 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:28:41,789 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:28:41,789 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:28:41,789 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:28:41,789 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:28:41,790 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:28:41,790 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:28:41,790 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:28:41,790 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:28:41,790 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:28:41,790 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:28:41,790 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:28:41,790 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:28:41,790 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:28:41,790 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:28:41,790 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:28:41,791 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:28:41,791 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:28:41,791 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:28:41,791 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:28:41,791 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:28:41,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:28:41,791 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:28:41,791 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:28:41,791 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:28:41,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:28:41,792 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:28:41,792 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:28:41,792 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:28:41,792 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:28:41,792 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:28:41,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:28:41,792 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:28:41,792 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:28:41,792 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:28:41,792 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:28:41,792 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 -> 3de6ec2acea23c0ab47fbc2e02ad0931145060ca78b80531ef692b3505f9553b [2025-01-09 21:28:41,984 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:28:41,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:28:41,994 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:28:41,995 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:28:41,996 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:28:41,997 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_81-list_racing.i [2025-01-09 21:28:43,288 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/75d5c156b/ffcbb5d38052464a83c377c4414aa59f/FLAG853fe5824 [2025-01-09 21:28:43,615 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:28:43,625 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_81-list_racing.i [2025-01-09 21:28:43,641 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/75d5c156b/ffcbb5d38052464a83c377c4414aa59f/FLAG853fe5824 [2025-01-09 21:28:43,847 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/75d5c156b/ffcbb5d38052464a83c377c4414aa59f [2025-01-09 21:28:43,849 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:28:43,851 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:28:43,852 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:28:43,853 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:28:43,856 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:28:43,856 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:28:43" (1/1) ... [2025-01-09 21:28:43,857 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@569bfbbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:43, skipping insertion in model container [2025-01-09 21:28:43,857 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:28:43" (1/1) ... [2025-01-09 21:28:43,889 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:28:44,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:28:44,193 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:28:44,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:28:44,268 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:28:44,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:44 WrapperNode [2025-01-09 21:28:44,269 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:28:44,270 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:28:44,270 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:28:44,270 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:28:44,275 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:28:44" (1/1) ... [2025-01-09 21:28:44,286 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:28:44" (1/1) ... [2025-01-09 21:28:44,307 INFO L138 Inliner]: procedures = 279, calls = 60, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 366 [2025-01-09 21:28:44,308 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:28:44,308 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:28:44,308 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:28:44,309 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:28:44,314 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:44" (1/1) ... [2025-01-09 21:28:44,314 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:44" (1/1) ... [2025-01-09 21:28:44,319 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:44" (1/1) ... [2025-01-09 21:28:44,319 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:44" (1/1) ... [2025-01-09 21:28:44,331 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:44" (1/1) ... [2025-01-09 21:28:44,332 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:44" (1/1) ... [2025-01-09 21:28:44,334 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:44" (1/1) ... [2025-01-09 21:28:44,336 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:44" (1/1) ... [2025-01-09 21:28:44,337 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:44" (1/1) ... [2025-01-09 21:28:44,339 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:28:44,340 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:28:44,340 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:28:44,340 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:28:44,341 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:44" (1/1) ... [2025-01-09 21:28:44,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:28:44,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:28:44,379 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:28:44,386 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:28:44,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 21:28:44,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-01-09 21:28:44,401 INFO L130 BoogieDeclarations]: Found specification of procedure t1_fun [2025-01-09 21:28:44,401 INFO L138 BoogieDeclarations]: Found implementation of procedure t1_fun [2025-01-09 21:28:44,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:28:44,401 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:28:44,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:28:44,401 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2025-01-09 21:28:44,401 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2025-01-09 21:28:44,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:28:44,402 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:28:44,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:28:44,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:28:44,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-09 21:28:44,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:28:44,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:28:44,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:28:44,403 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:28:44,542 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:28:44,545 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:28:44,926 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:28:44,926 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:28:44,945 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:28:44,946 INFO L312 CfgBuilder]: Removed 6 assume(true) statements. [2025-01-09 21:28:44,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:28:44 BoogieIcfgContainer [2025-01-09 21:28:44,946 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:28:44,948 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:28:44,948 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:28:44,951 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:28:44,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:28:43" (1/3) ... [2025-01-09 21:28:44,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@477ee646 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:28:44, skipping insertion in model container [2025-01-09 21:28:44,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:44" (2/3) ... [2025-01-09 21:28:44,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@477ee646 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:28:44, skipping insertion in model container [2025-01-09 21:28:44,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:28:44" (3/3) ... [2025-01-09 21:28:44,953 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_81-list_racing.i [2025-01-09 21:28:44,962 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:28:44,963 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_81-list_racing.i that has 3 procedures, 386 locations, 1 initial locations, 10 loop locations, and 22 error locations. [2025-01-09 21:28:44,963 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:28:45,042 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-09 21:28:45,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 392 places, 407 transitions, 834 flow [2025-01-09 21:28:45,232 INFO L124 PetriNetUnfolderBase]: 40/716 cut-off events. [2025-01-09 21:28:45,233 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-01-09 21:28:45,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 733 conditions, 716 events. 40/716 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3032 event pairs, 0 based on Foata normal form. 0/628 useless extension candidates. Maximal degree in co-relation 378. Up to 8 conditions per place. [2025-01-09 21:28:45,241 INFO L82 GeneralOperation]: Start removeDead. Operand has 392 places, 407 transitions, 834 flow [2025-01-09 21:28:45,246 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 392 places, 407 transitions, 834 flow [2025-01-09 21:28:45,251 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:28:45,257 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;@20e053bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:28:45,258 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-01-09 21:28:45,265 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:28:45,265 INFO L124 PetriNetUnfolderBase]: 0/84 cut-off events. [2025-01-09 21:28:45,265 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:28:45,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:45,266 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:28:45,266 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE, t2_funErr7ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:28:45,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:45,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1129234654, now seen corresponding path program 1 times [2025-01-09 21:28:45,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:45,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961413784] [2025-01-09 21:28:45,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:45,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:45,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 21:28:45,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 21:28:45,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:45,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:45,493 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:28:45,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:45,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961413784] [2025-01-09 21:28:45,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961413784] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:28:45,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:28:45,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:28:45,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228678513] [2025-01-09 21:28:45,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:28:45,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:28:45,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:45,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:28:45,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:28:45,576 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 407 [2025-01-09 21:28:45,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 407 transitions, 834 flow. Second operand has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 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:28:45,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:45,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 407 [2025-01-09 21:28:45,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:46,057 INFO L124 PetriNetUnfolderBase]: 184/2360 cut-off events. [2025-01-09 21:28:46,058 INFO L125 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES. [2025-01-09 21:28:46,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2694 conditions, 2360 events. 184/2360 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 17459 event pairs, 132 based on Foata normal form. 120/2249 useless extension candidates. Maximal degree in co-relation 1796. Up to 283 conditions per place. [2025-01-09 21:28:46,077 INFO L140 encePairwiseOnDemand]: 391/407 looper letters, 23 selfloop transitions, 2 changer transitions 0/391 dead transitions. [2025-01-09 21:28:46,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 391 transitions, 852 flow [2025-01-09 21:28:46,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:28:46,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:28:46,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1140 transitions. [2025-01-09 21:28:46,089 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9336609336609336 [2025-01-09 21:28:46,090 INFO L175 Difference]: Start difference. First operand has 392 places, 407 transitions, 834 flow. Second operand 3 states and 1140 transitions. [2025-01-09 21:28:46,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 391 transitions, 852 flow [2025-01-09 21:28:46,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 391 transitions, 852 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:28:46,101 INFO L231 Difference]: Finished difference. Result has 391 places, 391 transitions, 806 flow [2025-01-09 21:28:46,103 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=407, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=389, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=806, PETRI_PLACES=391, PETRI_TRANSITIONS=391} [2025-01-09 21:28:46,105 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -1 predicate places. [2025-01-09 21:28:46,105 INFO L471 AbstractCegarLoop]: Abstraction has has 391 places, 391 transitions, 806 flow [2025-01-09 21:28:46,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 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:28:46,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:46,106 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] [2025-01-09 21:28:46,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:28:46,106 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE, t2_funErr7ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:28:46,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:46,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1958500408, now seen corresponding path program 1 times [2025-01-09 21:28:46,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:46,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877252995] [2025-01-09 21:28:46,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:46,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:46,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 21:28:46,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 21:28:46,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:46,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:46,205 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:28:46,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:46,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877252995] [2025-01-09 21:28:46,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877252995] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:28:46,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:28:46,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:28:46,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740618125] [2025-01-09 21:28:46,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:28:46,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:28:46,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:46,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:28:46,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:28:46,232 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 407 [2025-01-09 21:28:46,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 391 transitions, 806 flow. Second operand has 3 states, 3 states have (on average 368.0) internal successors, (1104), 3 states have internal predecessors, (1104), 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:28:46,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:46,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 407 [2025-01-09 21:28:46,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:46,546 INFO L124 PetriNetUnfolderBase]: 104/1860 cut-off events. [2025-01-09 21:28:46,546 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2025-01-09 21:28:46,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2107 conditions, 1860 events. 104/1860 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 11364 event pairs, 72 based on Foata normal form. 0/1684 useless extension candidates. Maximal degree in co-relation 2012. Up to 185 conditions per place. [2025-01-09 21:28:46,558 INFO L140 encePairwiseOnDemand]: 403/407 looper letters, 22 selfloop transitions, 1 changer transitions 0/388 dead transitions. [2025-01-09 21:28:46,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 388 transitions, 846 flow [2025-01-09 21:28:46,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:28:46,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:28:46,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1127 transitions. [2025-01-09 21:28:46,560 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.923013923013923 [2025-01-09 21:28:46,560 INFO L175 Difference]: Start difference. First operand has 391 places, 391 transitions, 806 flow. Second operand 3 states and 1127 transitions. [2025-01-09 21:28:46,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 388 transitions, 846 flow [2025-01-09 21:28:46,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 388 transitions, 842 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:28:46,570 INFO L231 Difference]: Finished difference. Result has 388 places, 388 transitions, 798 flow [2025-01-09 21:28:46,571 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=407, PETRI_DIFFERENCE_MINUEND_FLOW=796, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=798, PETRI_PLACES=388, PETRI_TRANSITIONS=388} [2025-01-09 21:28:46,571 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -4 predicate places. [2025-01-09 21:28:46,572 INFO L471 AbstractCegarLoop]: Abstraction has has 388 places, 388 transitions, 798 flow [2025-01-09 21:28:46,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.0) internal successors, (1104), 3 states have internal predecessors, (1104), 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:28:46,572 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:46,572 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:28:46,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:28:46,573 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE, t2_funErr7ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:28:46,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:46,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1411786073, now seen corresponding path program 1 times [2025-01-09 21:28:46,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:46,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222394966] [2025-01-09 21:28:46,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:46,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:46,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 21:28:46,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 21:28:46,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:46,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:47,127 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:28:47,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:47,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222394966] [2025-01-09 21:28:47,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222394966] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:28:47,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:28:47,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:28:47,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620931592] [2025-01-09 21:28:47,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:28:47,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:28:47,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:47,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:28:47,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:28:47,487 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 407 [2025-01-09 21:28:47,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 388 transitions, 798 flow. Second operand has 6 states, 6 states have (on average 303.3333333333333) internal successors, (1820), 6 states have internal predecessors, (1820), 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:28:47,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:47,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 407 [2025-01-09 21:28:47,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:54,718 INFO L124 PetriNetUnfolderBase]: 22238/59988 cut-off events. [2025-01-09 21:28:54,720 INFO L125 PetriNetUnfolderBase]: For 439/439 co-relation queries the response was YES. [2025-01-09 21:28:54,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94067 conditions, 59988 events. 22238/59988 cut-off events. For 439/439 co-relation queries the response was YES. Maximal size of possible extension queue 1119. Compared 702849 event pairs, 21418 based on Foata normal form. 0/55847 useless extension candidates. Maximal degree in co-relation 93973. Up to 33881 conditions per place. [2025-01-09 21:28:55,197 INFO L140 encePairwiseOnDemand]: 401/407 looper letters, 85 selfloop transitions, 5 changer transitions 0/387 dead transitions. [2025-01-09 21:28:55,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 387 transitions, 976 flow [2025-01-09 21:28:55,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:28:55,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:28:55,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1903 transitions. [2025-01-09 21:28:55,201 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7792792792792793 [2025-01-09 21:28:55,201 INFO L175 Difference]: Start difference. First operand has 388 places, 388 transitions, 798 flow. Second operand 6 states and 1903 transitions. [2025-01-09 21:28:55,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 387 transitions, 976 flow [2025-01-09 21:28:55,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 387 transitions, 975 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:28:55,217 INFO L231 Difference]: Finished difference. Result has 391 places, 387 transitions, 805 flow [2025-01-09 21:28:55,217 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=407, PETRI_DIFFERENCE_MINUEND_FLOW=795, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=805, PETRI_PLACES=391, PETRI_TRANSITIONS=387} [2025-01-09 21:28:55,219 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -1 predicate places. [2025-01-09 21:28:55,219 INFO L471 AbstractCegarLoop]: Abstraction has has 391 places, 387 transitions, 805 flow [2025-01-09 21:28:55,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 303.3333333333333) internal successors, (1820), 6 states have internal predecessors, (1820), 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:28:55,220 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:55,220 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] [2025-01-09 21:28:55,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:28:55,221 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE, t2_funErr7ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:28:55,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:55,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1530163286, now seen corresponding path program 1 times [2025-01-09 21:28:55,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:55,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218747290] [2025-01-09 21:28:55,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:55,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:55,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 21:28:55,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 21:28:55,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:55,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:55,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:55,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:55,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218747290] [2025-01-09 21:28:55,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218747290] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:28:55,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:28:55,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:28:55,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324308078] [2025-01-09 21:28:55,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:28:55,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:28:55,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:55,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:28:55,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:28:56,154 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 407 [2025-01-09 21:28:56,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 387 transitions, 805 flow. Second operand has 6 states, 6 states have (on average 303.3333333333333) internal successors, (1820), 6 states have internal predecessors, (1820), 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:28:56,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:56,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 407 [2025-01-09 21:28:56,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:02,360 INFO L124 PetriNetUnfolderBase]: 22238/59987 cut-off events. [2025-01-09 21:29:02,361 INFO L125 PetriNetUnfolderBase]: For 439/439 co-relation queries the response was YES. [2025-01-09 21:29:02,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94071 conditions, 59987 events. 22238/59987 cut-off events. For 439/439 co-relation queries the response was YES. Maximal size of possible extension queue 1119. Compared 702285 event pairs, 21418 based on Foata normal form. 0/55847 useless extension candidates. Maximal degree in co-relation 93977. Up to 33881 conditions per place. [2025-01-09 21:29:02,718 INFO L140 encePairwiseOnDemand]: 401/407 looper letters, 85 selfloop transitions, 5 changer transitions 0/386 dead transitions. [2025-01-09 21:29:02,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 386 transitions, 983 flow [2025-01-09 21:29:02,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:29:02,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:29:02,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1903 transitions. [2025-01-09 21:29:02,724 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7792792792792793 [2025-01-09 21:29:02,724 INFO L175 Difference]: Start difference. First operand has 391 places, 387 transitions, 805 flow. Second operand 6 states and 1903 transitions. [2025-01-09 21:29:02,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 386 transitions, 983 flow [2025-01-09 21:29:02,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 386 transitions, 973 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:29:02,733 INFO L231 Difference]: Finished difference. Result has 390 places, 386 transitions, 803 flow [2025-01-09 21:29:02,734 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=407, PETRI_DIFFERENCE_MINUEND_FLOW=793, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=803, PETRI_PLACES=390, PETRI_TRANSITIONS=386} [2025-01-09 21:29:02,736 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -2 predicate places. [2025-01-09 21:29:02,736 INFO L471 AbstractCegarLoop]: Abstraction has has 390 places, 386 transitions, 803 flow [2025-01-09 21:29:02,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 303.3333333333333) internal successors, (1820), 6 states have internal predecessors, (1820), 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:02,737 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:02,737 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] [2025-01-09 21:29:02,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:29:02,738 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE, t2_funErr7ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:29:02,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:02,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1362814089, now seen corresponding path program 1 times [2025-01-09 21:29:02,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:02,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177561716] [2025-01-09 21:29:02,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:02,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:02,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 21:29:02,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 21:29:02,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:02,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:03,323 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:03,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:03,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177561716] [2025-01-09 21:29:03,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177561716] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:03,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:03,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:29:03,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239013960] [2025-01-09 21:29:03,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:03,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:29:03,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:03,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:29:03,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:29:03,603 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 407 [2025-01-09 21:29:03,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 386 transitions, 803 flow. Second operand has 6 states, 6 states have (on average 297.8333333333333) internal successors, (1787), 6 states have internal predecessors, (1787), 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:03,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:03,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 407 [2025-01-09 21:29:03,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:11,096 INFO L124 PetriNetUnfolderBase]: 25984/69481 cut-off events. [2025-01-09 21:29:11,096 INFO L125 PetriNetUnfolderBase]: For 439/439 co-relation queries the response was YES. [2025-01-09 21:29:11,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109301 conditions, 69481 events. 25984/69481 cut-off events. For 439/439 co-relation queries the response was YES. Maximal size of possible extension queue 1389. Compared 842391 event pairs, 24795 based on Foata normal form. 0/64613 useless extension candidates. Maximal degree in co-relation 109206. Up to 39469 conditions per place. [2025-01-09 21:29:11,577 INFO L140 encePairwiseOnDemand]: 380/407 looper letters, 105 selfloop transitions, 86 changer transitions 0/479 dead transitions. [2025-01-09 21:29:11,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 479 transitions, 1371 flow [2025-01-09 21:29:11,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:29:11,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:29:11,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1962 transitions. [2025-01-09 21:29:11,581 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8034398034398035 [2025-01-09 21:29:11,581 INFO L175 Difference]: Start difference. First operand has 390 places, 386 transitions, 803 flow. Second operand 6 states and 1962 transitions. [2025-01-09 21:29:11,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 479 transitions, 1371 flow [2025-01-09 21:29:11,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 479 transitions, 1361 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:29:11,596 INFO L231 Difference]: Finished difference. Result has 395 places, 471 transitions, 1359 flow [2025-01-09 21:29:11,597 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=407, PETRI_DIFFERENCE_MINUEND_FLOW=793, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1359, PETRI_PLACES=395, PETRI_TRANSITIONS=471} [2025-01-09 21:29:11,597 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, 3 predicate places. [2025-01-09 21:29:11,597 INFO L471 AbstractCegarLoop]: Abstraction has has 395 places, 471 transitions, 1359 flow [2025-01-09 21:29:11,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 297.8333333333333) internal successors, (1787), 6 states have internal predecessors, (1787), 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:11,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:11,598 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:11,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:29:11,598 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE, t2_funErr7ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:29:11,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:11,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1928961530, now seen corresponding path program 1 times [2025-01-09 21:29:11,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:11,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663355375] [2025-01-09 21:29:11,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:11,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:11,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 21:29:11,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 21:29:11,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:11,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:11,663 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:11,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:11,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663355375] [2025-01-09 21:29:11,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663355375] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:11,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:11,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:29:11,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242008214] [2025-01-09 21:29:11,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:11,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:11,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:11,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:11,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:11,683 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 371 out of 407 [2025-01-09 21:29:11,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 471 transitions, 1359 flow. Second operand has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 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:11,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:11,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 407 [2025-01-09 21:29:11,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:11,978 INFO L124 PetriNetUnfolderBase]: 309/2447 cut-off events. [2025-01-09 21:29:11,978 INFO L125 PetriNetUnfolderBase]: For 218/241 co-relation queries the response was YES. [2025-01-09 21:29:11,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3349 conditions, 2447 events. 309/2447 cut-off events. For 218/241 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 16759 event pairs, 94 based on Foata normal form. 1/2253 useless extension candidates. Maximal degree in co-relation 3250. Up to 237 conditions per place. [2025-01-09 21:29:11,994 INFO L140 encePairwiseOnDemand]: 404/407 looper letters, 22 selfloop transitions, 3 changer transitions 0/473 dead transitions. [2025-01-09 21:29:11,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 473 transitions, 1413 flow [2025-01-09 21:29:11,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:11,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:11,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1138 transitions. [2025-01-09 21:29:11,997 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9320229320229321 [2025-01-09 21:29:11,997 INFO L175 Difference]: Start difference. First operand has 395 places, 471 transitions, 1359 flow. Second operand 3 states and 1138 transitions. [2025-01-09 21:29:11,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 473 transitions, 1413 flow [2025-01-09 21:29:12,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 473 transitions, 1413 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:29:12,004 INFO L231 Difference]: Finished difference. Result has 398 places, 471 transitions, 1370 flow [2025-01-09 21:29:12,005 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=407, PETRI_DIFFERENCE_MINUEND_FLOW=1359, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1370, PETRI_PLACES=398, PETRI_TRANSITIONS=471} [2025-01-09 21:29:12,005 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, 6 predicate places. [2025-01-09 21:29:12,005 INFO L471 AbstractCegarLoop]: Abstraction has has 398 places, 471 transitions, 1370 flow [2025-01-09 21:29:12,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 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:12,006 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:12,006 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:29:12,006 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE, t2_funErr7ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:29:12,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:12,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1245896070, now seen corresponding path program 1 times [2025-01-09 21:29:12,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:12,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734296856] [2025-01-09 21:29:12,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:12,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:12,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 21:29:12,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 21:29:12,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:12,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:29:12,043 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:29:12,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 21:29:12,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 21:29:12,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:12,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:29:13,424 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:29:13,427 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:29:13,429 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 38 remaining) [2025-01-09 21:29:13,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr0ASSERT_VIOLATIONDATA_RACE (36 of 38 remaining) [2025-01-09 21:29:13,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr1ASSERT_VIOLATIONDATA_RACE (35 of 38 remaining) [2025-01-09 21:29:13,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr2ASSERT_VIOLATIONDATA_RACE (34 of 38 remaining) [2025-01-09 21:29:13,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr7ASSERT_VIOLATIONDATA_RACE (33 of 38 remaining) [2025-01-09 21:29:13,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr3ASSERT_VIOLATIONDATA_RACE (32 of 38 remaining) [2025-01-09 21:29:13,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr5ASSERT_VIOLATIONDATA_RACE (31 of 38 remaining) [2025-01-09 21:29:13,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr4ASSERT_VIOLATIONDATA_RACE (30 of 38 remaining) [2025-01-09 21:29:13,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr6ASSERT_VIOLATIONDATA_RACE (29 of 38 remaining) [2025-01-09 21:29:13,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (28 of 38 remaining) [2025-01-09 21:29:13,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (27 of 38 remaining) [2025-01-09 21:29:13,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (26 of 38 remaining) [2025-01-09 21:29:13,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (25 of 38 remaining) [2025-01-09 21:29:13,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (24 of 38 remaining) [2025-01-09 21:29:13,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (23 of 38 remaining) [2025-01-09 21:29:13,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (22 of 38 remaining) [2025-01-09 21:29:13,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (21 of 38 remaining) [2025-01-09 21:29:13,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 38 remaining) [2025-01-09 21:29:13,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr0ASSERT_VIOLATIONDATA_RACE (19 of 38 remaining) [2025-01-09 21:29:13,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr1ASSERT_VIOLATIONDATA_RACE (18 of 38 remaining) [2025-01-09 21:29:13,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr2ASSERT_VIOLATIONDATA_RACE (17 of 38 remaining) [2025-01-09 21:29:13,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr3ASSERT_VIOLATIONDATA_RACE (16 of 38 remaining) [2025-01-09 21:29:13,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr4ASSERT_VIOLATIONDATA_RACE (15 of 38 remaining) [2025-01-09 21:29:13,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr5ASSERT_VIOLATIONDATA_RACE (14 of 38 remaining) [2025-01-09 21:29:13,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr0ASSERT_VIOLATIONDATA_RACE (13 of 38 remaining) [2025-01-09 21:29:13,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr1ASSERT_VIOLATIONDATA_RACE (12 of 38 remaining) [2025-01-09 21:29:13,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr2ASSERT_VIOLATIONDATA_RACE (11 of 38 remaining) [2025-01-09 21:29:13,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr7ASSERT_VIOLATIONDATA_RACE (10 of 38 remaining) [2025-01-09 21:29:13,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr3ASSERT_VIOLATIONDATA_RACE (9 of 38 remaining) [2025-01-09 21:29:13,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr5ASSERT_VIOLATIONDATA_RACE (8 of 38 remaining) [2025-01-09 21:29:13,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr4ASSERT_VIOLATIONDATA_RACE (7 of 38 remaining) [2025-01-09 21:29:13,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr6ASSERT_VIOLATIONDATA_RACE (6 of 38 remaining) [2025-01-09 21:29:13,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 38 remaining) [2025-01-09 21:29:13,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr1ASSERT_VIOLATIONDATA_RACE (4 of 38 remaining) [2025-01-09 21:29:13,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr2ASSERT_VIOLATIONDATA_RACE (3 of 38 remaining) [2025-01-09 21:29:13,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr3ASSERT_VIOLATIONDATA_RACE (2 of 38 remaining) [2025-01-09 21:29:13,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr4ASSERT_VIOLATIONDATA_RACE (1 of 38 remaining) [2025-01-09 21:29:13,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr5ASSERT_VIOLATIONDATA_RACE (0 of 38 remaining) [2025-01-09 21:29:13,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:29:13,437 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:13,442 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:29:13,442 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 21:29:13,643 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-01-09 21:29:13,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 595 places, 626 transitions, 1296 flow [2025-01-09 21:29:14,363 INFO L124 PetriNetUnfolderBase]: 153/1943 cut-off events. [2025-01-09 21:29:14,364 INFO L125 PetriNetUnfolderBase]: For 72/90 co-relation queries the response was YES. [2025-01-09 21:29:14,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2032 conditions, 1943 events. 153/1943 cut-off events. For 72/90 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 13101 event pairs, 2 based on Foata normal form. 0/1681 useless extension candidates. Maximal degree in co-relation 1231. Up to 32 conditions per place. [2025-01-09 21:29:14,447 INFO L82 GeneralOperation]: Start removeDead. Operand has 595 places, 626 transitions, 1296 flow [2025-01-09 21:29:14,483 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 595 places, 626 transitions, 1296 flow [2025-01-09 21:29:14,486 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:29:14,487 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;@20e053bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:29:14,489 INFO L334 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2025-01-09 21:29:14,492 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:29:14,500 INFO L124 PetriNetUnfolderBase]: 0/84 cut-off events. [2025-01-09 21:29:14,500 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:29:14,501 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:14,501 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:14,501 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE, t2_funErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-01-09 21:29:14,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:14,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1201080498, now seen corresponding path program 1 times [2025-01-09 21:29:14,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:14,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517398490] [2025-01-09 21:29:14,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:14,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:14,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 21:29:14,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 21:29:14,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:14,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:14,564 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:14,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:14,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517398490] [2025-01-09 21:29:14,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517398490] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:14,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:14,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:14,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432960872] [2025-01-09 21:29:14,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:14,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:14,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:14,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:14,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:14,605 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 554 out of 626 [2025-01-09 21:29:14,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 595 places, 626 transitions, 1296 flow. Second operand has 3 states, 3 states have (on average 555.3333333333334) internal successors, (1666), 3 states have internal predecessors, (1666), 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:14,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:14,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 554 of 626 [2025-01-09 21:29:14,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:39,284 INFO L124 PetriNetUnfolderBase]: 23531/136988 cut-off events. [2025-01-09 21:29:39,284 INFO L125 PetriNetUnfolderBase]: For 11336/11336 co-relation queries the response was YES. [2025-01-09 21:29:40,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170242 conditions, 136988 events. 23531/136988 cut-off events. For 11336/11336 co-relation queries the response was YES. Maximal size of possible extension queue 2135. Compared 2269581 event pairs, 20092 based on Foata normal form. 13913/138378 useless extension candidates. Maximal degree in co-relation 51865. Up to 29012 conditions per place. [2025-01-09 21:29:41,414 INFO L140 encePairwiseOnDemand]: 597/626 looper letters, 41 selfloop transitions, 2 changer transitions 0/595 dead transitions. [2025-01-09 21:29:41,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 592 places, 595 transitions, 1320 flow [2025-01-09 21:29:41,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:41,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:41,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1732 transitions. [2025-01-09 21:29:41,417 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9222577209797657 [2025-01-09 21:29:41,418 INFO L175 Difference]: Start difference. First operand has 595 places, 626 transitions, 1296 flow. Second operand 3 states and 1732 transitions. [2025-01-09 21:29:41,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 592 places, 595 transitions, 1320 flow [2025-01-09 21:29:41,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 592 places, 595 transitions, 1320 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:29:41,425 INFO L231 Difference]: Finished difference. Result has 592 places, 595 transitions, 1238 flow [2025-01-09 21:29:41,426 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=626, PETRI_DIFFERENCE_MINUEND_FLOW=1234, PETRI_DIFFERENCE_MINUEND_PLACES=590, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=595, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=593, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1238, PETRI_PLACES=592, PETRI_TRANSITIONS=595} [2025-01-09 21:29:41,427 INFO L279 CegarLoopForPetriNet]: 595 programPoint places, -3 predicate places. [2025-01-09 21:29:41,428 INFO L471 AbstractCegarLoop]: Abstraction has has 592 places, 595 transitions, 1238 flow [2025-01-09 21:29:41,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 555.3333333333334) internal successors, (1666), 3 states have internal predecessors, (1666), 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,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:41,429 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] [2025-01-09 21:29:41,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:29:41,429 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE, t2_funErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-01-09 21:29:41,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:41,429 INFO L85 PathProgramCache]: Analyzing trace with hash -475905480, now seen corresponding path program 1 times [2025-01-09 21:29:41,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:41,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291807208] [2025-01-09 21:29:41,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:41,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:41,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 21:29:41,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 21:29:41,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:41,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:41,462 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,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:41,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291807208] [2025-01-09 21:29:41,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291807208] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:41,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:41,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:41,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152537365] [2025-01-09 21:29:41,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:41,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:41,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:41,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:41,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:41,478 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 626 [2025-01-09 21:29:41,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 592 places, 595 transitions, 1238 flow. Second operand has 3 states, 3 states have (on average 551.0) internal successors, (1653), 3 states have internal predecessors, (1653), 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,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:41,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 626 [2025-01-09 21:29:41,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand