./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_27-funptr_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_27-funptr_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 ce37da4bed964b4727d03a98278bc58de76d7006f2d65a8a42fb0f55b5b34a9c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:27:18,353 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:27:18,389 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:27:18,392 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:27:18,392 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:27:18,407 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:27:18,407 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:27:18,407 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:27:18,408 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:27:18,408 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:27:18,408 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:27:18,408 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:27:18,408 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:27:18,408 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:27:18,408 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:27:18,409 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:27:18,409 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:27:18,409 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:27:18,409 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:27:18,409 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:27:18,409 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:27:18,409 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:27:18,409 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:27:18,409 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:27:18,409 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:27:18,409 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:27:18,410 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:27:18,410 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:27:18,410 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:27:18,410 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:27:18,410 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:27:18,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:27:18,410 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:27:18,410 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:27:18,410 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:27:18,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:27:18,410 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:27:18,410 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:27:18,410 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:27:18,410 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:27:18,410 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:27:18,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:27:18,410 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:27:18,410 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:27:18,411 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:27:18,411 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:27:18,411 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 -> ce37da4bed964b4727d03a98278bc58de76d7006f2d65a8a42fb0f55b5b34a9c [2025-01-09 21:27:18,596 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:27:18,602 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:27:18,603 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:27:18,604 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:27:18,604 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:27:18,605 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_27-funptr_racing.i [2025-01-09 21:27:19,799 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/45da9261c/91ff9ab8699e455b97a7ad1557234bc9/FLAG45dddc009 [2025-01-09 21:27:20,046 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:27:20,050 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_27-funptr_racing.i [2025-01-09 21:27:20,065 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/45da9261c/91ff9ab8699e455b97a7ad1557234bc9/FLAG45dddc009 [2025-01-09 21:27:20,351 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/45da9261c/91ff9ab8699e455b97a7ad1557234bc9 [2025-01-09 21:27:20,352 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:27:20,354 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:27:20,355 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:27:20,355 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:27:20,358 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:27:20,358 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:27:20" (1/1) ... [2025-01-09 21:27:20,359 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dd28bc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:20, skipping insertion in model container [2025-01-09 21:27:20,359 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:27:20" (1/1) ... [2025-01-09 21:27:20,379 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:27:20,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:27:20,743 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:27:20,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:27:20,844 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:27:20,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:20 WrapperNode [2025-01-09 21:27:20,844 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:27:20,845 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:27:20,847 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:27:20,847 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:27:20,852 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:27:20" (1/1) ... [2025-01-09 21:27:20,862 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:27:20" (1/1) ... [2025-01-09 21:27:20,877 INFO L138 Inliner]: procedures = 252, calls = 53, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 205 [2025-01-09 21:27:20,877 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:27:20,878 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:27:20,878 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:27:20,878 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:27:20,883 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:20" (1/1) ... [2025-01-09 21:27:20,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:20" (1/1) ... [2025-01-09 21:27:20,888 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:20" (1/1) ... [2025-01-09 21:27:20,889 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:20" (1/1) ... [2025-01-09 21:27:20,898 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:20" (1/1) ... [2025-01-09 21:27:20,902 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:20" (1/1) ... [2025-01-09 21:27:20,904 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:20" (1/1) ... [2025-01-09 21:27:20,910 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:20" (1/1) ... [2025-01-09 21:27:20,911 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:20" (1/1) ... [2025-01-09 21:27:20,917 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:27:20,919 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:27:20,919 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:27:20,919 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:27:20,920 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:20" (1/1) ... [2025-01-09 21:27:20,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:27:20,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:27:20,955 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:27:20,967 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:27:20,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 21:27:20,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:27:20,984 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:27:20,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:27:20,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:27:20,984 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:27:20,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:27:20,984 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-09 21:27:20,985 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-09 21:27:20,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:27:20,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:27:20,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:27:20,986 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:27:21,101 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:27:21,102 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:27:21,379 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:27:21,379 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:27:21,427 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:27:21,429 INFO L312 CfgBuilder]: Removed 7 assume(true) statements. [2025-01-09 21:27:21,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:27:21 BoogieIcfgContainer [2025-01-09 21:27:21,430 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:27:21,432 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:27:21,432 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:27:21,436 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:27:21,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:27:20" (1/3) ... [2025-01-09 21:27:21,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4463f231 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:27:21, skipping insertion in model container [2025-01-09 21:27:21,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:20" (2/3) ... [2025-01-09 21:27:21,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4463f231 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:27:21, skipping insertion in model container [2025-01-09 21:27:21,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:27:21" (3/3) ... [2025-01-09 21:27:21,437 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_27-funptr_racing.i [2025-01-09 21:27:21,449 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:27:21,450 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_27-funptr_racing.i that has 2 procedures, 195 locations, 1 initial locations, 9 loop locations, and 13 error locations. [2025-01-09 21:27:21,450 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:27:21,515 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-09 21:27:21,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 213 transitions, 433 flow [2025-01-09 21:27:21,662 INFO L124 PetriNetUnfolderBase]: 22/280 cut-off events. [2025-01-09 21:27:21,664 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:27:21,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285 conditions, 280 events. 22/280 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 998 event pairs, 0 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 174. Up to 4 conditions per place. [2025-01-09 21:27:21,674 INFO L82 GeneralOperation]: Start removeDead. Operand has 198 places, 213 transitions, 433 flow [2025-01-09 21:27:21,681 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 198 places, 213 transitions, 433 flow [2025-01-09 21:27:21,693 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:27:21,701 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;@f0cf714, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:27:21,701 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-01-09 21:27:21,709 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:27:21,710 INFO L124 PetriNetUnfolderBase]: 0/47 cut-off events. [2025-01-09 21:27:21,710 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:27:21,710 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:21,710 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:27:21,711 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:27:21,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:21,715 INFO L85 PathProgramCache]: Analyzing trace with hash 16952665, now seen corresponding path program 1 times [2025-01-09 21:27:21,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:21,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062056245] [2025-01-09 21:27:21,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:21,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:21,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 21:27:21,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 21:27:21,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:21,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:21,945 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:27:21,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:21,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062056245] [2025-01-09 21:27:21,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062056245] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:21,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:21,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:27:21,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339903538] [2025-01-09 21:27:21,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:21,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:27:21,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:21,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:27:21,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:27:22,015 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 213 [2025-01-09 21:27:22,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 213 transitions, 433 flow. Second operand has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 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:27:22,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:22,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 213 [2025-01-09 21:27:22,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:22,231 INFO L124 PetriNetUnfolderBase]: 122/1040 cut-off events. [2025-01-09 21:27:22,231 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:27:22,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1313 conditions, 1040 events. 122/1040 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 6815 event pairs, 99 based on Foata normal form. 123/1050 useless extension candidates. Maximal degree in co-relation 1235. Up to 254 conditions per place. [2025-01-09 21:27:22,241 INFO L140 encePairwiseOnDemand]: 194/213 looper letters, 36 selfloop transitions, 2 changer transitions 0/207 dead transitions. [2025-01-09 21:27:22,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 207 transitions, 497 flow [2025-01-09 21:27:22,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:27:22,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:27:22,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 577 transitions. [2025-01-09 21:27:22,254 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9029733959311425 [2025-01-09 21:27:22,256 INFO L175 Difference]: Start difference. First operand has 198 places, 213 transitions, 433 flow. Second operand 3 states and 577 transitions. [2025-01-09 21:27:22,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 207 transitions, 497 flow [2025-01-09 21:27:22,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 207 transitions, 497 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:27:22,264 INFO L231 Difference]: Finished difference. Result has 199 places, 195 transitions, 405 flow [2025-01-09 21:27:22,266 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=405, PETRI_PLACES=199, PETRI_TRANSITIONS=195} [2025-01-09 21:27:22,269 INFO L279 CegarLoopForPetriNet]: 198 programPoint places, 1 predicate places. [2025-01-09 21:27:22,269 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 195 transitions, 405 flow [2025-01-09 21:27:22,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 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:27:22,269 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:22,270 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] [2025-01-09 21:27:22,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:27:22,270 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:27:22,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:22,270 INFO L85 PathProgramCache]: Analyzing trace with hash 926953738, now seen corresponding path program 1 times [2025-01-09 21:27:22,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:22,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949215757] [2025-01-09 21:27:22,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:22,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:22,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 21:27:22,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 21:27:22,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:22,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:22,782 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:27:22,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:22,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949215757] [2025-01-09 21:27:22,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949215757] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:22,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:22,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:27:22,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412079488] [2025-01-09 21:27:22,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:22,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:27:22,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:22,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:27:22,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:27:22,871 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 213 [2025-01-09 21:27:22,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 195 transitions, 405 flow. Second operand has 6 states, 6 states have (on average 159.5) internal successors, (957), 6 states have internal predecessors, (957), 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:27:22,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:22,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 213 [2025-01-09 21:27:22,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:23,133 INFO L124 PetriNetUnfolderBase]: 244/1392 cut-off events. [2025-01-09 21:27:23,134 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-01-09 21:27:23,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1958 conditions, 1392 events. 244/1392 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 10465 event pairs, 166 based on Foata normal form. 0/1268 useless extension candidates. Maximal degree in co-relation 1861. Up to 387 conditions per place. [2025-01-09 21:27:23,143 INFO L140 encePairwiseOnDemand]: 207/213 looper letters, 80 selfloop transitions, 5 changer transitions 0/242 dead transitions. [2025-01-09 21:27:23,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 242 transitions, 669 flow [2025-01-09 21:27:23,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:27:23,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:27:23,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1034 transitions. [2025-01-09 21:27:23,146 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.809076682316119 [2025-01-09 21:27:23,146 INFO L175 Difference]: Start difference. First operand has 199 places, 195 transitions, 405 flow. Second operand 6 states and 1034 transitions. [2025-01-09 21:27:23,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 242 transitions, 669 flow [2025-01-09 21:27:23,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 242 transitions, 665 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:27:23,151 INFO L231 Difference]: Finished difference. Result has 201 places, 194 transitions, 409 flow [2025-01-09 21:27:23,153 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=409, PETRI_PLACES=201, PETRI_TRANSITIONS=194} [2025-01-09 21:27:23,153 INFO L279 CegarLoopForPetriNet]: 198 programPoint places, 3 predicate places. [2025-01-09 21:27:23,153 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 194 transitions, 409 flow [2025-01-09 21:27:23,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 159.5) internal successors, (957), 6 states have internal predecessors, (957), 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:27:23,154 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:23,154 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] [2025-01-09 21:27:23,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:27:23,154 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:27:23,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:23,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1003990789, now seen corresponding path program 1 times [2025-01-09 21:27:23,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:23,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644281830] [2025-01-09 21:27:23,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:23,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:23,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:27:23,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:27:23,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:23,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:23,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:27:23,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:23,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644281830] [2025-01-09 21:27:23,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644281830] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:23,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:23,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:27:23,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843830544] [2025-01-09 21:27:23,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:23,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:27:23,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:23,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:27:23,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:27:23,214 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 213 [2025-01-09 21:27:23,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 194 transitions, 409 flow. Second operand has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 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:27:23,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:23,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 213 [2025-01-09 21:27:23,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:23,380 INFO L124 PetriNetUnfolderBase]: 170/1602 cut-off events. [2025-01-09 21:27:23,381 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-09 21:27:23,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1990 conditions, 1602 events. 170/1602 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 12614 event pairs, 12 based on Foata normal form. 0/1433 useless extension candidates. Maximal degree in co-relation 1920. Up to 189 conditions per place. [2025-01-09 21:27:23,387 INFO L140 encePairwiseOnDemand]: 209/213 looper letters, 41 selfloop transitions, 3 changer transitions 0/214 dead transitions. [2025-01-09 21:27:23,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 214 transitions, 540 flow [2025-01-09 21:27:23,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:27:23,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:27:23,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 561 transitions. [2025-01-09 21:27:23,389 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8779342723004695 [2025-01-09 21:27:23,389 INFO L175 Difference]: Start difference. First operand has 201 places, 194 transitions, 409 flow. Second operand 3 states and 561 transitions. [2025-01-09 21:27:23,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 214 transitions, 540 flow [2025-01-09 21:27:23,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 214 transitions, 530 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:27:23,393 INFO L231 Difference]: Finished difference. Result has 200 places, 196 transitions, 421 flow [2025-01-09 21:27:23,393 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=421, PETRI_PLACES=200, PETRI_TRANSITIONS=196} [2025-01-09 21:27:23,394 INFO L279 CegarLoopForPetriNet]: 198 programPoint places, 2 predicate places. [2025-01-09 21:27:23,394 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 196 transitions, 421 flow [2025-01-09 21:27:23,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 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:27:23,394 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:23,394 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] [2025-01-09 21:27:23,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:27:23,395 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:27:23,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:23,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1120712946, now seen corresponding path program 1 times [2025-01-09 21:27:23,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:23,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264326297] [2025-01-09 21:27:23,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:23,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:23,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 21:27:23,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 21:27:23,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:23,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:23,471 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:27:23,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:23,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264326297] [2025-01-09 21:27:23,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264326297] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:23,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:23,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:27:23,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092539276] [2025-01-09 21:27:23,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:23,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:27:23,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:23,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:27:23,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:27:23,518 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 213 [2025-01-09 21:27:23,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 196 transitions, 421 flow. Second operand has 5 states, 5 states have (on average 169.8) internal successors, (849), 5 states have internal predecessors, (849), 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:27:23,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:23,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 213 [2025-01-09 21:27:23,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:23,611 INFO L124 PetriNetUnfolderBase]: 39/378 cut-off events. [2025-01-09 21:27:23,611 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-01-09 21:27:23,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 492 conditions, 378 events. 39/378 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1410 event pairs, 0 based on Foata normal form. 13/364 useless extension candidates. Maximal degree in co-relation 435. Up to 25 conditions per place. [2025-01-09 21:27:23,613 INFO L140 encePairwiseOnDemand]: 208/213 looper letters, 50 selfloop transitions, 4 changer transitions 0/175 dead transitions. [2025-01-09 21:27:23,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 175 transitions, 470 flow [2025-01-09 21:27:23,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:27:23,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:27:23,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1063 transitions. [2025-01-09 21:27:23,615 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8317683881064163 [2025-01-09 21:27:23,616 INFO L175 Difference]: Start difference. First operand has 200 places, 196 transitions, 421 flow. Second operand 6 states and 1063 transitions. [2025-01-09 21:27:23,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 175 transitions, 470 flow [2025-01-09 21:27:23,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 175 transitions, 463 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-01-09 21:27:23,619 INFO L231 Difference]: Finished difference. Result has 147 places, 139 transitions, 291 flow [2025-01-09 21:27:23,619 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=291, PETRI_PLACES=147, PETRI_TRANSITIONS=139} [2025-01-09 21:27:23,619 INFO L279 CegarLoopForPetriNet]: 198 programPoint places, -51 predicate places. [2025-01-09 21:27:23,619 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 139 transitions, 291 flow [2025-01-09 21:27:23,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 169.8) internal successors, (849), 5 states have internal predecessors, (849), 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:27:23,620 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:23,620 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] [2025-01-09 21:27:23,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:27:23,620 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:27:23,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:23,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1476291384, now seen corresponding path program 1 times [2025-01-09 21:27:23,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:23,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871699208] [2025-01-09 21:27:23,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:23,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:23,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 21:27:23,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 21:27:23,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:23,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:27:23,640 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:27:23,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 21:27:23,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 21:27:23,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:23,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:27:23,666 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:27:23,667 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:27:23,667 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2025-01-09 21:27:23,668 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (21 of 23 remaining) [2025-01-09 21:27:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (20 of 23 remaining) [2025-01-09 21:27:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (19 of 23 remaining) [2025-01-09 21:27:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (18 of 23 remaining) [2025-01-09 21:27:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (17 of 23 remaining) [2025-01-09 21:27:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (16 of 23 remaining) [2025-01-09 21:27:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (15 of 23 remaining) [2025-01-09 21:27:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (14 of 23 remaining) [2025-01-09 21:27:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONDATA_RACE (13 of 23 remaining) [2025-01-09 21:27:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (12 of 23 remaining) [2025-01-09 21:27:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (11 of 23 remaining) [2025-01-09 21:27:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (10 of 23 remaining) [2025-01-09 21:27:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONDATA_RACE (9 of 23 remaining) [2025-01-09 21:27:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (8 of 23 remaining) [2025-01-09 21:27:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (7 of 23 remaining) [2025-01-09 21:27:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (6 of 23 remaining) [2025-01-09 21:27:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (5 of 23 remaining) [2025-01-09 21:27:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONDATA_RACE (4 of 23 remaining) [2025-01-09 21:27:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (3 of 23 remaining) [2025-01-09 21:27:23,670 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (2 of 23 remaining) [2025-01-09 21:27:23,670 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (1 of 23 remaining) [2025-01-09 21:27:23,670 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONDATA_RACE (0 of 23 remaining) [2025-01-09 21:27:23,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:27:23,670 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-09 21:27:23,672 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:27:23,672 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 21:27:23,705 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:27:23,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 292 places, 319 transitions, 654 flow [2025-01-09 21:27:23,760 INFO L124 PetriNetUnfolderBase]: 41/480 cut-off events. [2025-01-09 21:27:23,760 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:27:23,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 492 conditions, 480 events. 41/480 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2070 event pairs, 0 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 299. Up to 6 conditions per place. [2025-01-09 21:27:23,763 INFO L82 GeneralOperation]: Start removeDead. Operand has 292 places, 319 transitions, 654 flow [2025-01-09 21:27:23,768 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 292 places, 319 transitions, 654 flow [2025-01-09 21:27:23,768 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:27:23,769 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;@f0cf714, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:27:23,769 INFO L334 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2025-01-09 21:27:23,772 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:27:23,772 INFO L124 PetriNetUnfolderBase]: 0/47 cut-off events. [2025-01-09 21:27:23,772 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:27:23,772 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:23,773 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:27:23,773 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-01-09 21:27:23,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:23,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1479430424, now seen corresponding path program 1 times [2025-01-09 21:27:23,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:23,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862161287] [2025-01-09 21:27:23,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:23,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:23,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 21:27:23,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 21:27:23,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:23,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:23,802 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:27:23,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:23,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862161287] [2025-01-09 21:27:23,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862161287] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:23,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:23,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:27:23,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211837699] [2025-01-09 21:27:23,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:23,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:27:23,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:23,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:27:23,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:27:23,820 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 319 [2025-01-09 21:27:23,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 319 transitions, 654 flow. Second operand has 3 states, 3 states have (on average 251.66666666666666) internal successors, (755), 3 states have internal predecessors, (755), 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:27:23,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:23,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 319 [2025-01-09 21:27:23,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:25,415 INFO L124 PetriNetUnfolderBase]: 3460/16760 cut-off events. [2025-01-09 21:27:25,416 INFO L125 PetriNetUnfolderBase]: For 293/293 co-relation queries the response was YES. [2025-01-09 21:27:25,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22311 conditions, 16760 events. 3460/16760 cut-off events. For 293/293 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 209092 event pairs, 1584 based on Foata normal form. 2894/18013 useless extension candidates. Maximal degree in co-relation 1883. Up to 5465 conditions per place. [2025-01-09 21:27:25,569 INFO L140 encePairwiseOnDemand]: 288/319 looper letters, 51 selfloop transitions, 2 changer transitions 0/302 dead transitions. [2025-01-09 21:27:25,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 302 transitions, 726 flow [2025-01-09 21:27:25,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:27:25,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:27:25,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 844 transitions. [2025-01-09 21:27:25,574 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8819226750261233 [2025-01-09 21:27:25,575 INFO L175 Difference]: Start difference. First operand has 292 places, 319 transitions, 654 flow. Second operand 3 states and 844 transitions. [2025-01-09 21:27:25,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 302 transitions, 726 flow [2025-01-09 21:27:25,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 302 transitions, 726 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:27:25,587 INFO L231 Difference]: Finished difference. Result has 293 places, 290 transitions, 606 flow [2025-01-09 21:27:25,587 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=606, PETRI_PLACES=293, PETRI_TRANSITIONS=290} [2025-01-09 21:27:25,587 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, 1 predicate places. [2025-01-09 21:27:25,587 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 290 transitions, 606 flow [2025-01-09 21:27:25,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 251.66666666666666) internal successors, (755), 3 states have internal predecessors, (755), 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:27:25,588 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:25,588 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] [2025-01-09 21:27:25,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:27:25,588 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-01-09 21:27:25,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:25,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1913784553, now seen corresponding path program 1 times [2025-01-09 21:27:25,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:25,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544715760] [2025-01-09 21:27:25,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:25,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:25,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 21:27:25,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 21:27:25,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:25,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:25,876 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:27:25,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:25,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544715760] [2025-01-09 21:27:25,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544715760] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:25,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:25,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:27:25,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188791365] [2025-01-09 21:27:25,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:25,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:27:25,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:25,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:27:25,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:27:25,972 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 319 [2025-01-09 21:27:25,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 290 transitions, 606 flow. Second operand has 6 states, 6 states have (on average 239.5) internal successors, (1437), 6 states have internal predecessors, (1437), 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:27:25,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:25,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 319 [2025-01-09 21:27:25,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:28,394 INFO L124 PetriNetUnfolderBase]: 6961/28017 cut-off events. [2025-01-09 21:27:28,395 INFO L125 PetriNetUnfolderBase]: For 380/419 co-relation queries the response was YES. [2025-01-09 21:27:28,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39003 conditions, 28017 events. 6961/28017 cut-off events. For 380/419 co-relation queries the response was YES. Maximal size of possible extension queue 702. Compared 366668 event pairs, 3202 based on Foata normal form. 0/25145 useless extension candidates. Maximal degree in co-relation 35839. Up to 7816 conditions per place. [2025-01-09 21:27:28,544 INFO L140 encePairwiseOnDemand]: 313/319 looper letters, 142 selfloop transitions, 6 changer transitions 0/385 dead transitions. [2025-01-09 21:27:28,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 385 transitions, 1092 flow [2025-01-09 21:27:28,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:27:28,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:27:28,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1576 transitions. [2025-01-09 21:27:28,548 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8234064785788924 [2025-01-09 21:27:28,548 INFO L175 Difference]: Start difference. First operand has 293 places, 290 transitions, 606 flow. Second operand 6 states and 1576 transitions. [2025-01-09 21:27:28,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 385 transitions, 1092 flow [2025-01-09 21:27:28,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 385 transitions, 1090 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:27:28,553 INFO L231 Difference]: Finished difference. Result has 296 places, 289 transitions, 614 flow [2025-01-09 21:27:28,553 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=614, PETRI_PLACES=296, PETRI_TRANSITIONS=289} [2025-01-09 21:27:28,554 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, 4 predicate places. [2025-01-09 21:27:28,554 INFO L471 AbstractCegarLoop]: Abstraction has has 296 places, 289 transitions, 614 flow [2025-01-09 21:27:28,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 239.5) internal successors, (1437), 6 states have internal predecessors, (1437), 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:27:28,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:28,555 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] [2025-01-09 21:27:28,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:27:28,555 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-01-09 21:27:28,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:28,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1733884339, now seen corresponding path program 1 times [2025-01-09 21:27:28,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:28,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546122400] [2025-01-09 21:27:28,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:28,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:28,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:27:28,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:27:28,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:28,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:28,587 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:27:28,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:28,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546122400] [2025-01-09 21:27:28,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546122400] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:28,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:28,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:27:28,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374004410] [2025-01-09 21:27:28,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:28,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:27:28,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:28,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:27:28,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:27:28,599 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 319 [2025-01-09 21:27:28,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 289 transitions, 614 flow. Second operand has 3 states, 3 states have (on average 250.33333333333334) internal successors, (751), 3 states have internal predecessors, (751), 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:27:28,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:28,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 319 [2025-01-09 21:27:28,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:30,868 INFO L124 PetriNetUnfolderBase]: 6242/30828 cut-off events. [2025-01-09 21:27:30,868 INFO L125 PetriNetUnfolderBase]: For 256/256 co-relation queries the response was YES. [2025-01-09 21:27:30,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40778 conditions, 30828 events. 6242/30828 cut-off events. For 256/256 co-relation queries the response was YES. Maximal size of possible extension queue 764. Compared 425571 event pairs, 1648 based on Foata normal form. 0/27517 useless extension candidates. Maximal degree in co-relation 38700. Up to 5556 conditions per place. [2025-01-09 21:27:31,001 INFO L140 encePairwiseOnDemand]: 312/319 looper letters, 74 selfloop transitions, 5 changer transitions 0/327 dead transitions. [2025-01-09 21:27:31,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 327 transitions, 859 flow [2025-01-09 21:27:31,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:27:31,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:27:31,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 828 transitions. [2025-01-09 21:27:31,003 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8652037617554859 [2025-01-09 21:27:31,003 INFO L175 Difference]: Start difference. First operand has 296 places, 289 transitions, 614 flow. Second operand 3 states and 828 transitions. [2025-01-09 21:27:31,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 327 transitions, 859 flow [2025-01-09 21:27:31,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 327 transitions, 847 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:27:31,008 INFO L231 Difference]: Finished difference. Result has 295 places, 294 transitions, 646 flow [2025-01-09 21:27:31,008 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=646, PETRI_PLACES=295, PETRI_TRANSITIONS=294} [2025-01-09 21:27:31,009 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, 3 predicate places. [2025-01-09 21:27:31,009 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 294 transitions, 646 flow [2025-01-09 21:27:31,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 250.33333333333334) internal successors, (751), 3 states have internal predecessors, (751), 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:27:31,010 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:31,010 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] [2025-01-09 21:27:31,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:27:31,010 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-01-09 21:27:31,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:31,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1845637079, now seen corresponding path program 1 times [2025-01-09 21:27:31,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:31,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728474383] [2025-01-09 21:27:31,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:31,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:31,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 21:27:31,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 21:27:31,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:31,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:31,075 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:27:31,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:31,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728474383] [2025-01-09 21:27:31,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728474383] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:31,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:31,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:27:31,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867284767] [2025-01-09 21:27:31,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:31,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:27:31,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:31,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:27:31,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:27:31,111 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 319 [2025-01-09 21:27:31,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 294 transitions, 646 flow. Second operand has 5 states, 5 states have (on average 249.8) internal successors, (1249), 5 states have internal predecessors, (1249), 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:27:31,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:31,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 319 [2025-01-09 21:27:31,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:34,320 INFO L124 PetriNetUnfolderBase]: 7128/37364 cut-off events. [2025-01-09 21:27:34,320 INFO L125 PetriNetUnfolderBase]: For 573/581 co-relation queries the response was YES. [2025-01-09 21:27:34,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49676 conditions, 37364 events. 7128/37364 cut-off events. For 573/581 co-relation queries the response was YES. Maximal size of possible extension queue 951. Compared 540129 event pairs, 3498 based on Foata normal form. 13/33470 useless extension candidates. Maximal degree in co-relation 45338. Up to 10379 conditions per place. [2025-01-09 21:27:34,463 INFO L140 encePairwiseOnDemand]: 314/319 looper letters, 100 selfloop transitions, 5 changer transitions 0/356 dead transitions. [2025-01-09 21:27:34,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 356 transitions, 980 flow [2025-01-09 21:27:34,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:27:34,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:27:34,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1594 transitions. [2025-01-09 21:27:34,466 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.832810867293626 [2025-01-09 21:27:34,466 INFO L175 Difference]: Start difference. First operand has 295 places, 294 transitions, 646 flow. Second operand 6 states and 1594 transitions. [2025-01-09 21:27:34,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 356 transitions, 980 flow [2025-01-09 21:27:34,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 356 transitions, 970 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:27:34,472 INFO L231 Difference]: Finished difference. Result has 301 places, 296 transitions, 662 flow [2025-01-09 21:27:34,473 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=662, PETRI_PLACES=301, PETRI_TRANSITIONS=296} [2025-01-09 21:27:34,473 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, 9 predicate places. [2025-01-09 21:27:34,473 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 296 transitions, 662 flow [2025-01-09 21:27:34,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 249.8) internal successors, (1249), 5 states have internal predecessors, (1249), 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:27:34,474 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:34,474 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] [2025-01-09 21:27:34,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:27:34,474 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-01-09 21:27:34,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:34,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1284254668, now seen corresponding path program 1 times [2025-01-09 21:27:34,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:34,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633400103] [2025-01-09 21:27:34,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:34,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:34,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 21:27:34,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 21:27:34,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:34,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:34,520 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:27:34,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:34,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633400103] [2025-01-09 21:27:34,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633400103] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:34,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:34,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:27:34,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736750053] [2025-01-09 21:27:34,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:34,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:27:34,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:34,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:27:34,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:27:34,567 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 319 [2025-01-09 21:27:34,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 296 transitions, 662 flow. Second operand has 3 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:27:34,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:34,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 319 [2025-01-09 21:27:34,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:45,014 INFO L124 PetriNetUnfolderBase]: 36162/135740 cut-off events. [2025-01-09 21:27:45,015 INFO L125 PetriNetUnfolderBase]: For 851/851 co-relation queries the response was YES. [2025-01-09 21:27:45,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194306 conditions, 135740 events. 36162/135740 cut-off events. For 851/851 co-relation queries the response was YES. Maximal size of possible extension queue 3358. Compared 2168726 event pairs, 14868 based on Foata normal form. 0/122012 useless extension candidates. Maximal degree in co-relation 193990. Up to 31067 conditions per place. [2025-01-09 21:27:45,953 INFO L140 encePairwiseOnDemand]: 284/319 looper letters, 102 selfloop transitions, 26 changer transitions 0/355 dead transitions. [2025-01-09 21:27:45,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 355 transitions, 1047 flow [2025-01-09 21:27:45,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:27:45,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:27:45,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 800 transitions. [2025-01-09 21:27:45,955 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8359456635318704 [2025-01-09 21:27:45,955 INFO L175 Difference]: Start difference. First operand has 301 places, 296 transitions, 662 flow. Second operand 3 states and 800 transitions. [2025-01-09 21:27:45,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 355 transitions, 1047 flow [2025-01-09 21:27:45,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 355 transitions, 1041 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-09 21:27:45,964 INFO L231 Difference]: Finished difference. Result has 303 places, 322 transitions, 882 flow [2025-01-09 21:27:45,964 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=882, PETRI_PLACES=303, PETRI_TRANSITIONS=322} [2025-01-09 21:27:45,965 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, 11 predicate places. [2025-01-09 21:27:45,965 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 322 transitions, 882 flow [2025-01-09 21:27:45,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:27:45,965 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:45,965 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:27:45,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:27:45,966 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-01-09 21:27:45,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:45,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1628687987, now seen corresponding path program 1 times [2025-01-09 21:27:45,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:45,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720209007] [2025-01-09 21:27:45,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:45,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:45,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 21:27:45,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 21:27:45,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:45,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:46,004 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:27:46,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:46,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720209007] [2025-01-09 21:27:46,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720209007] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:46,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:46,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:27:46,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480964539] [2025-01-09 21:27:46,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:46,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:27:46,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:46,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:27:46,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:27:46,057 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 319 [2025-01-09 21:27:46,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 322 transitions, 882 flow. Second operand has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 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:27:46,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:46,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 319 [2025-01-09 21:27:46,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:58,544 INFO L124 PetriNetUnfolderBase]: 33841/146578 cut-off events. [2025-01-09 21:27:58,544 INFO L125 PetriNetUnfolderBase]: For 34662/35950 co-relation queries the response was YES. [2025-01-09 21:27:59,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234184 conditions, 146578 events. 33841/146578 cut-off events. For 34662/35950 co-relation queries the response was YES. Maximal size of possible extension queue 3545. Compared 2456821 event pairs, 23541 based on Foata normal form. 194/133826 useless extension candidates. Maximal degree in co-relation 233843. Up to 47293 conditions per place. [2025-01-09 21:27:59,406 INFO L140 encePairwiseOnDemand]: 306/319 looper letters, 92 selfloop transitions, 22 changer transitions 0/362 dead transitions. [2025-01-09 21:27:59,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 362 transitions, 1252 flow [2025-01-09 21:27:59,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:27:59,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:27:59,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 788 transitions. [2025-01-09 21:27:59,408 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8234064785788924 [2025-01-09 21:27:59,408 INFO L175 Difference]: Start difference. First operand has 303 places, 322 transitions, 882 flow. Second operand 3 states and 788 transitions. [2025-01-09 21:27:59,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 362 transitions, 1252 flow [2025-01-09 21:27:59,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 362 transitions, 1182 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:27:59,465 INFO L231 Difference]: Finished difference. Result has 305 places, 342 transitions, 1036 flow [2025-01-09 21:27:59,466 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1036, PETRI_PLACES=305, PETRI_TRANSITIONS=342} [2025-01-09 21:27:59,466 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, 13 predicate places. [2025-01-09 21:27:59,466 INFO L471 AbstractCegarLoop]: Abstraction has has 305 places, 342 transitions, 1036 flow [2025-01-09 21:27:59,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 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:27:59,467 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:59,467 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:27:59,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:27:59,467 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-01-09 21:27:59,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:59,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1414230964, now seen corresponding path program 1 times [2025-01-09 21:27:59,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:59,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104101747] [2025-01-09 21:27:59,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:59,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:59,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 21:27:59,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 21:27:59,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:59,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:59,492 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:27:59,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:59,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104101747] [2025-01-09 21:27:59,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104101747] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:59,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:59,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:27:59,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277057884] [2025-01-09 21:27:59,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:59,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:27:59,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:59,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:27:59,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:27:59,542 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 319 [2025-01-09 21:27:59,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 342 transitions, 1036 flow. Second operand has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 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:27:59,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:59,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 319 [2025-01-09 21:27:59,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand