./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread/reorder_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/reorder_2.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 eaeb1d72262bd1e189945b98598b3acb68c08676109949c39074605b8c62cb69 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:08:56,742 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:08:56,777 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:08:56,781 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:08:56,781 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:08:56,795 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:08:56,795 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:08:56,795 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:08:56,796 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:08:56,796 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:08:56,796 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:08:56,796 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:08:56,796 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:08:56,796 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:08:56,796 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:08:56,797 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:08:56,797 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:08:56,797 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:08:56,797 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:08:56,797 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:08:56,797 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:08:56,797 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:08:56,797 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:08:56,797 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:08:56,797 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:08:56,797 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:08:56,798 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:08:56,798 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:08:56,798 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:08:56,798 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:08:56,798 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:08:56,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:08:56,798 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:08:56,798 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:08:56,798 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:08:56,798 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:08:56,798 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:08:56,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:08:56,799 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:08:56,799 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:08:56,799 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:08:56,799 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:08:56,799 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 -> eaeb1d72262bd1e189945b98598b3acb68c08676109949c39074605b8c62cb69 [2025-02-08 05:08:57,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:08:57,030 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:08:57,032 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:08:57,032 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:08:57,033 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:08:57,033 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/reorder_2.i [2025-02-08 05:08:58,245 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7fc9a4d0a/c769ee1c54fa4ced9262310201455770/FLAG58afa8761 [2025-02-08 05:08:58,573 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:08:58,573 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/reorder_2.i [2025-02-08 05:08:58,590 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7fc9a4d0a/c769ee1c54fa4ced9262310201455770/FLAG58afa8761 [2025-02-08 05:08:58,825 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7fc9a4d0a/c769ee1c54fa4ced9262310201455770 [2025-02-08 05:08:58,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:08:58,829 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:08:58,829 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:08:58,829 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:08:58,833 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:08:58,834 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:08:58" (1/1) ... [2025-02-08 05:08:58,836 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@309c0ec4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:08:58, skipping insertion in model container [2025-02-08 05:08:58,836 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:08:58" (1/1) ... [2025-02-08 05:08:58,873 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:08:59,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:08:59,148 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:08:59,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:08:59,239 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:08:59,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:08:59 WrapperNode [2025-02-08 05:08:59,240 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:08:59,241 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:08:59,241 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:08:59,241 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:08:59,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:08:59" (1/1) ... [2025-02-08 05:08:59,262 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:08:59" (1/1) ... [2025-02-08 05:08:59,277 INFO L138 Inliner]: procedures = 372, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 208 [2025-02-08 05:08:59,277 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:08:59,277 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:08:59,277 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:08:59,278 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:08:59,282 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:08:59" (1/1) ... [2025-02-08 05:08:59,283 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:08:59" (1/1) ... [2025-02-08 05:08:59,286 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:08:59" (1/1) ... [2025-02-08 05:08:59,286 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:08:59" (1/1) ... [2025-02-08 05:08:59,297 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:08:59" (1/1) ... [2025-02-08 05:08:59,298 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:08:59" (1/1) ... [2025-02-08 05:08:59,303 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:08:59" (1/1) ... [2025-02-08 05:08:59,304 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:08:59" (1/1) ... [2025-02-08 05:08:59,306 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:08:59,307 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:08:59,307 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:08:59,307 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:08:59,307 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:08:59" (1/1) ... [2025-02-08 05:08:59,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:08:59,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:08:59,336 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:08:59,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:08:59,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 05:08:59,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 05:08:59,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:08:59,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 05:08:59,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:08:59,354 INFO L130 BoogieDeclarations]: Found specification of procedure setThread [2025-02-08 05:08:59,354 INFO L138 BoogieDeclarations]: Found implementation of procedure setThread [2025-02-08 05:08:59,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:08:59,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:08:59,354 INFO L130 BoogieDeclarations]: Found specification of procedure checkThread [2025-02-08 05:08:59,354 INFO L138 BoogieDeclarations]: Found implementation of procedure checkThread [2025-02-08 05:08:59,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:08:59,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:08:59,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:08:59,355 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:08:59,461 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:08:59,462 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:08:59,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260: havoc main_~#setPool~0#1.base, main_~#setPool~0#1.offset; [2025-02-08 05:08:59,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-1: SUMMARY for call ULTIMATE.dealloc(main_~#setPool~0#1.base, main_~#setPool~0#1.offset); srcloc: null [2025-02-08 05:08:59,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1261: havoc main_~#checkPool~0#1.base, main_~#checkPool~0#1.offset; [2025-02-08 05:08:59,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1261-1: SUMMARY for call ULTIMATE.dealloc(main_~#checkPool~0#1.base, main_~#checkPool~0#1.offset); srcloc: null [2025-02-08 05:08:59,731 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:08:59,731 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:08:59,755 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:08:59,755 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:08:59,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:08:59 BoogieIcfgContainer [2025-02-08 05:08:59,756 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:08:59,758 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:08:59,758 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:08:59,783 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:08:59,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:08:58" (1/3) ... [2025-02-08 05:08:59,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@939e2bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:08:59, skipping insertion in model container [2025-02-08 05:08:59,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:08:59" (2/3) ... [2025-02-08 05:08:59,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@939e2bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:08:59, skipping insertion in model container [2025-02-08 05:08:59,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:08:59" (3/3) ... [2025-02-08 05:08:59,785 INFO L128 eAbstractionObserver]: Analyzing ICFG reorder_2.i [2025-02-08 05:08:59,795 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:08:59,796 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG reorder_2.i that has 3 procedures, 226 locations, 1 initial locations, 4 loop locations, and 26 error locations. [2025-02-08 05:08:59,796 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:08:59,870 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-08 05:08:59,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 232 places, 245 transitions, 510 flow [2025-02-08 05:08:59,997 INFO L124 PetriNetUnfolderBase]: 39/521 cut-off events. [2025-02-08 05:08:59,998 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-08 05:09:00,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 538 conditions, 521 events. 39/521 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2098 event pairs, 0 based on Foata normal form. 0/422 useless extension candidates. Maximal degree in co-relation 277. Up to 8 conditions per place. [2025-02-08 05:09:00,009 INFO L82 GeneralOperation]: Start removeDead. Operand has 232 places, 245 transitions, 510 flow [2025-02-08 05:09:00,014 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 232 places, 245 transitions, 510 flow [2025-02-08 05:09:00,019 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:09:00,026 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;@5b23ce67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:09:00,026 INFO L334 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2025-02-08 05:09:00,031 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:09:00,031 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-02-08 05:09:00,031 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:09:00,032 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:00,032 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:09:00,032 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-02-08 05:09:00,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:00,036 INFO L85 PathProgramCache]: Analyzing trace with hash 446652900, now seen corresponding path program 1 times [2025-02-08 05:09:00,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:00,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296210033] [2025-02-08 05:09:00,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:00,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:00,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 05:09:00,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 05:09:00,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:00,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:00,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:00,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:00,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296210033] [2025-02-08 05:09:00,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296210033] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:00,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:00,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:00,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757560195] [2025-02-08 05:09:00,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:00,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:00,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:00,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:00,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:00,195 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 245 [2025-02-08 05:09:00,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 245 transitions, 510 flow. Second operand has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:00,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:00,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 245 [2025-02-08 05:09:00,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:00,359 INFO L124 PetriNetUnfolderBase]: 63/811 cut-off events. [2025-02-08 05:09:00,359 INFO L125 PetriNetUnfolderBase]: For 90/142 co-relation queries the response was YES. [2025-02-08 05:09:00,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 971 conditions, 811 events. 63/811 cut-off events. For 90/142 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4191 event pairs, 50 based on Foata normal form. 67/749 useless extension candidates. Maximal degree in co-relation 575. Up to 128 conditions per place. [2025-02-08 05:09:00,365 INFO L140 encePairwiseOnDemand]: 224/245 looper letters, 18 selfloop transitions, 1 changer transitions 6/223 dead transitions. [2025-02-08 05:09:00,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 223 transitions, 504 flow [2025-02-08 05:09:00,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:00,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:00,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 654 transitions. [2025-02-08 05:09:00,379 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.889795918367347 [2025-02-08 05:09:00,381 INFO L175 Difference]: Start difference. First operand has 232 places, 245 transitions, 510 flow. Second operand 3 states and 654 transitions. [2025-02-08 05:09:00,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 223 transitions, 504 flow [2025-02-08 05:09:00,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 223 transitions, 504 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:09:00,390 INFO L231 Difference]: Finished difference. Result has 224 places, 217 transitions, 456 flow [2025-02-08 05:09:00,392 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=456, PETRI_PLACES=224, PETRI_TRANSITIONS=217} [2025-02-08 05:09:00,394 INFO L279 CegarLoopForPetriNet]: 232 programPoint places, -8 predicate places. [2025-02-08 05:09:00,395 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 217 transitions, 456 flow [2025-02-08 05:09:00,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:00,396 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:00,396 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] [2025-02-08 05:09:00,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:09:00,396 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-02-08 05:09:00,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:00,397 INFO L85 PathProgramCache]: Analyzing trace with hash 961331889, now seen corresponding path program 1 times [2025-02-08 05:09:00,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:00,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112426031] [2025-02-08 05:09:00,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:00,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:00,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 05:09:00,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 05:09:00,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:00,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:00,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:00,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:00,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112426031] [2025-02-08 05:09:00,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112426031] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:00,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:00,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:00,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386005492] [2025-02-08 05:09:00,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:00,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:00,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:00,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:00,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:00,499 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 245 [2025-02-08 05:09:00,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 217 transitions, 456 flow. Second operand has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:00,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:00,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 245 [2025-02-08 05:09:00,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:00,698 INFO L124 PetriNetUnfolderBase]: 60/1400 cut-off events. [2025-02-08 05:09:00,698 INFO L125 PetriNetUnfolderBase]: For 130/306 co-relation queries the response was YES. [2025-02-08 05:09:00,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1567 conditions, 1400 events. 60/1400 cut-off events. For 130/306 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 8949 event pairs, 28 based on Foata normal form. 0/1185 useless extension candidates. Maximal degree in co-relation 754. Up to 51 conditions per place. [2025-02-08 05:09:00,704 INFO L140 encePairwiseOnDemand]: 243/245 looper letters, 21 selfloop transitions, 1 changer transitions 0/226 dead transitions. [2025-02-08 05:09:00,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 226 transitions, 536 flow [2025-02-08 05:09:00,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:00,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:00,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 668 transitions. [2025-02-08 05:09:00,706 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.908843537414966 [2025-02-08 05:09:00,706 INFO L175 Difference]: Start difference. First operand has 224 places, 217 transitions, 456 flow. Second operand 3 states and 668 transitions. [2025-02-08 05:09:00,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 226 transitions, 536 flow [2025-02-08 05:09:00,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 226 transitions, 535 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:09:00,713 INFO L231 Difference]: Finished difference. Result has 218 places, 216 transitions, 455 flow [2025-02-08 05:09:00,714 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=455, PETRI_PLACES=218, PETRI_TRANSITIONS=216} [2025-02-08 05:09:00,715 INFO L279 CegarLoopForPetriNet]: 232 programPoint places, -14 predicate places. [2025-02-08 05:09:00,715 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 216 transitions, 455 flow [2025-02-08 05:09:00,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:00,716 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:00,716 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] [2025-02-08 05:09:00,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:09:00,716 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-02-08 05:09:00,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:00,717 INFO L85 PathProgramCache]: Analyzing trace with hash -263621186, now seen corresponding path program 1 times [2025-02-08 05:09:00,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:00,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566290718] [2025-02-08 05:09:00,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:00,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:00,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 05:09:00,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 05:09:00,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:00,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:00,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:00,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:00,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566290718] [2025-02-08 05:09:00,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566290718] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:00,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:00,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:00,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139135068] [2025-02-08 05:09:00,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:00,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:00,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:00,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:00,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:00,797 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 245 [2025-02-08 05:09:00,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 216 transitions, 455 flow. Second operand has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:00,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:00,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 245 [2025-02-08 05:09:00,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:01,056 INFO L124 PetriNetUnfolderBase]: 232/1701 cut-off events. [2025-02-08 05:09:01,057 INFO L125 PetriNetUnfolderBase]: For 154/458 co-relation queries the response was YES. [2025-02-08 05:09:01,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2230 conditions, 1701 events. 232/1701 cut-off events. For 154/458 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 11305 event pairs, 52 based on Foata normal form. 19/1513 useless extension candidates. Maximal degree in co-relation 1112. Up to 355 conditions per place. [2025-02-08 05:09:01,063 INFO L140 encePairwiseOnDemand]: 233/245 looper letters, 15 selfloop transitions, 1 changer transitions 24/220 dead transitions. [2025-02-08 05:09:01,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 220 transitions, 529 flow [2025-02-08 05:09:01,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:01,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:01,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 636 transitions. [2025-02-08 05:09:01,065 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8653061224489796 [2025-02-08 05:09:01,065 INFO L175 Difference]: Start difference. First operand has 218 places, 216 transitions, 455 flow. Second operand 3 states and 636 transitions. [2025-02-08 05:09:01,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 220 transitions, 529 flow [2025-02-08 05:09:01,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 220 transitions, 528 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:09:01,070 INFO L231 Difference]: Finished difference. Result has 213 places, 192 transitions, 408 flow [2025-02-08 05:09:01,071 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=408, PETRI_PLACES=213, PETRI_TRANSITIONS=192} [2025-02-08 05:09:01,071 INFO L279 CegarLoopForPetriNet]: 232 programPoint places, -19 predicate places. [2025-02-08 05:09:01,071 INFO L471 AbstractCegarLoop]: Abstraction has has 213 places, 192 transitions, 408 flow [2025-02-08 05:09:01,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:01,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:01,072 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] [2025-02-08 05:09:01,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:09:01,072 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-02-08 05:09:01,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:01,073 INFO L85 PathProgramCache]: Analyzing trace with hash 391703951, now seen corresponding path program 1 times [2025-02-08 05:09:01,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:01,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744708857] [2025-02-08 05:09:01,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:01,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:01,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 05:09:01,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 05:09:01,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:01,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:01,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:01,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:01,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744708857] [2025-02-08 05:09:01,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744708857] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:01,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:01,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:01,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401728283] [2025-02-08 05:09:01,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:01,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:01,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:01,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:01,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:01,133 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 245 [2025-02-08 05:09:01,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 192 transitions, 408 flow. Second operand has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:01,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:01,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 245 [2025-02-08 05:09:01,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:01,255 INFO L124 PetriNetUnfolderBase]: 184/1638 cut-off events. [2025-02-08 05:09:01,255 INFO L125 PetriNetUnfolderBase]: For 112/216 co-relation queries the response was YES. [2025-02-08 05:09:01,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2107 conditions, 1638 events. 184/1638 cut-off events. For 112/216 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 11152 event pairs, 156 based on Foata normal form. 0/1438 useless extension candidates. Maximal degree in co-relation 1838. Up to 362 conditions per place. [2025-02-08 05:09:01,260 INFO L140 encePairwiseOnDemand]: 239/245 looper letters, 18 selfloop transitions, 2 changer transitions 0/189 dead transitions. [2025-02-08 05:09:01,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 189 transitions, 442 flow [2025-02-08 05:09:01,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:01,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:01,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 639 transitions. [2025-02-08 05:09:01,262 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8693877551020408 [2025-02-08 05:09:01,262 INFO L175 Difference]: Start difference. First operand has 213 places, 192 transitions, 408 flow. Second operand 3 states and 639 transitions. [2025-02-08 05:09:01,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 189 transitions, 442 flow [2025-02-08 05:09:01,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 189 transitions, 441 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:09:01,267 INFO L231 Difference]: Finished difference. Result has 193 places, 189 transitions, 409 flow [2025-02-08 05:09:01,267 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=409, PETRI_PLACES=193, PETRI_TRANSITIONS=189} [2025-02-08 05:09:01,267 INFO L279 CegarLoopForPetriNet]: 232 programPoint places, -39 predicate places. [2025-02-08 05:09:01,268 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 189 transitions, 409 flow [2025-02-08 05:09:01,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:01,268 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:01,268 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] [2025-02-08 05:09:01,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:09:01,268 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-02-08 05:09:01,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:01,269 INFO L85 PathProgramCache]: Analyzing trace with hash 107275171, now seen corresponding path program 1 times [2025-02-08 05:09:01,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:01,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590765989] [2025-02-08 05:09:01,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:01,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:01,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 05:09:01,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 05:09:01,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:01,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:01,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:01,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:01,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590765989] [2025-02-08 05:09:01,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590765989] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:01,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:01,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:01,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110827224] [2025-02-08 05:09:01,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:01,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:01,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:01,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:01,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:01,353 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 245 [2025-02-08 05:09:01,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 189 transitions, 409 flow. Second operand has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:01,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:01,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 245 [2025-02-08 05:09:01,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:01,481 INFO L124 PetriNetUnfolderBase]: 124/1385 cut-off events. [2025-02-08 05:09:01,481 INFO L125 PetriNetUnfolderBase]: For 112/216 co-relation queries the response was YES. [2025-02-08 05:09:01,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1736 conditions, 1385 events. 124/1385 cut-off events. For 112/216 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 8863 event pairs, 96 based on Foata normal form. 0/1196 useless extension candidates. Maximal degree in co-relation 868. Up to 250 conditions per place. [2025-02-08 05:09:01,486 INFO L140 encePairwiseOnDemand]: 242/245 looper letters, 17 selfloop transitions, 2 changer transitions 3/188 dead transitions. [2025-02-08 05:09:01,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 188 transitions, 447 flow [2025-02-08 05:09:01,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:01,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:01,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 642 transitions. [2025-02-08 05:09:01,489 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8734693877551021 [2025-02-08 05:09:01,489 INFO L175 Difference]: Start difference. First operand has 193 places, 189 transitions, 409 flow. Second operand 3 states and 642 transitions. [2025-02-08 05:09:01,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 188 transitions, 447 flow [2025-02-08 05:09:01,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 188 transitions, 447 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:09:01,493 INFO L231 Difference]: Finished difference. Result has 194 places, 185 transitions, 405 flow [2025-02-08 05:09:01,493 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=405, PETRI_PLACES=194, PETRI_TRANSITIONS=185} [2025-02-08 05:09:01,494 INFO L279 CegarLoopForPetriNet]: 232 programPoint places, -38 predicate places. [2025-02-08 05:09:01,496 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 185 transitions, 405 flow [2025-02-08 05:09:01,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:01,497 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:01,497 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] [2025-02-08 05:09:01,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:09:01,497 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-02-08 05:09:01,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:01,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1159260160, now seen corresponding path program 1 times [2025-02-08 05:09:01,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:01,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507581366] [2025-02-08 05:09:01,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:01,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:01,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 05:09:01,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 05:09:01,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:01,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:01,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:01,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:01,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507581366] [2025-02-08 05:09:01,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507581366] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:01,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:01,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:01,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655574384] [2025-02-08 05:09:01,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:01,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:01,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:01,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:01,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:01,566 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 245 [2025-02-08 05:09:01,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 185 transitions, 405 flow. Second operand has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:01,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:01,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 245 [2025-02-08 05:09:01,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:01,667 INFO L124 PetriNetUnfolderBase]: 60/1200 cut-off events. [2025-02-08 05:09:01,667 INFO L125 PetriNetUnfolderBase]: For 130/306 co-relation queries the response was YES. [2025-02-08 05:09:01,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1393 conditions, 1200 events. 60/1200 cut-off events. For 130/306 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 7123 event pairs, 28 based on Foata normal form. 0/1056 useless extension candidates. Maximal degree in co-relation 696. Up to 51 conditions per place. [2025-02-08 05:09:01,670 INFO L140 encePairwiseOnDemand]: 243/245 looper letters, 21 selfloop transitions, 1 changer transitions 0/194 dead transitions. [2025-02-08 05:09:01,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 194 transitions, 485 flow [2025-02-08 05:09:01,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:01,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:01,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 668 transitions. [2025-02-08 05:09:01,672 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.908843537414966 [2025-02-08 05:09:01,672 INFO L175 Difference]: Start difference. First operand has 194 places, 185 transitions, 405 flow. Second operand 3 states and 668 transitions. [2025-02-08 05:09:01,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 194 transitions, 485 flow [2025-02-08 05:09:01,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 194 transitions, 481 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:09:01,675 INFO L231 Difference]: Finished difference. Result has 190 places, 184 transitions, 401 flow [2025-02-08 05:09:01,676 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=401, PETRI_PLACES=190, PETRI_TRANSITIONS=184} [2025-02-08 05:09:01,676 INFO L279 CegarLoopForPetriNet]: 232 programPoint places, -42 predicate places. [2025-02-08 05:09:01,676 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 184 transitions, 401 flow [2025-02-08 05:09:01,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:01,677 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:01,677 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] [2025-02-08 05:09:01,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:09:01,677 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-02-08 05:09:01,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:01,678 INFO L85 PathProgramCache]: Analyzing trace with hash 55105596, now seen corresponding path program 1 times [2025-02-08 05:09:01,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:01,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877669921] [2025-02-08 05:09:01,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:01,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:01,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 05:09:01,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 05:09:01,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:01,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:01,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:01,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:01,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877669921] [2025-02-08 05:09:01,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877669921] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:01,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:01,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:01,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550792125] [2025-02-08 05:09:01,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:01,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:01,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:01,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:01,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:01,723 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 245 [2025-02-08 05:09:01,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 184 transitions, 401 flow. Second operand has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:01,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:01,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 245 [2025-02-08 05:09:01,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:01,824 INFO L124 PetriNetUnfolderBase]: 120/1323 cut-off events. [2025-02-08 05:09:01,824 INFO L125 PetriNetUnfolderBase]: For 118/238 co-relation queries the response was YES. [2025-02-08 05:09:01,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1660 conditions, 1323 events. 120/1323 cut-off events. For 118/238 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 8429 event pairs, 92 based on Foata normal form. 0/1138 useless extension candidates. Maximal degree in co-relation 835. Up to 234 conditions per place. [2025-02-08 05:09:01,828 INFO L140 encePairwiseOnDemand]: 242/245 looper letters, 18 selfloop transitions, 2 changer transitions 0/183 dead transitions. [2025-02-08 05:09:01,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 183 transitions, 439 flow [2025-02-08 05:09:01,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:01,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:01,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 641 transitions. [2025-02-08 05:09:01,830 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8721088435374149 [2025-02-08 05:09:01,830 INFO L175 Difference]: Start difference. First operand has 190 places, 184 transitions, 401 flow. Second operand 3 states and 641 transitions. [2025-02-08 05:09:01,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 183 transitions, 439 flow [2025-02-08 05:09:01,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 183 transitions, 438 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:09:01,833 INFO L231 Difference]: Finished difference. Result has 190 places, 183 transitions, 402 flow [2025-02-08 05:09:01,833 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=402, PETRI_PLACES=190, PETRI_TRANSITIONS=183} [2025-02-08 05:09:01,835 INFO L279 CegarLoopForPetriNet]: 232 programPoint places, -42 predicate places. [2025-02-08 05:09:01,835 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 183 transitions, 402 flow [2025-02-08 05:09:01,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:01,836 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:01,836 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] [2025-02-08 05:09:01,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:09:01,836 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-02-08 05:09:01,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:01,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1488159745, now seen corresponding path program 1 times [2025-02-08 05:09:01,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:01,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427836667] [2025-02-08 05:09:01,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:01,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:01,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 05:09:01,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 05:09:01,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:01,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:01,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:01,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:01,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427836667] [2025-02-08 05:09:01,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427836667] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:01,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:01,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:09:01,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544599238] [2025-02-08 05:09:01,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:01,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:01,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:01,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:01,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:01,916 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 245 [2025-02-08 05:09:01,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 183 transitions, 402 flow. Second operand has 3 states, 3 states have (on average 209.66666666666666) internal successors, (629), 3 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:01,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:01,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 245 [2025-02-08 05:09:01,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:02,009 INFO L124 PetriNetUnfolderBase]: 58/1187 cut-off events. [2025-02-08 05:09:02,010 INFO L125 PetriNetUnfolderBase]: For 130/306 co-relation queries the response was YES. [2025-02-08 05:09:02,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1388 conditions, 1187 events. 58/1187 cut-off events. For 130/306 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 7031 event pairs, 28 based on Foata normal form. 2/1046 useless extension candidates. Maximal degree in co-relation 706. Up to 110 conditions per place. [2025-02-08 05:09:02,014 INFO L140 encePairwiseOnDemand]: 243/245 looper letters, 16 selfloop transitions, 0 changer transitions 1/182 dead transitions. [2025-02-08 05:09:02,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 182 transitions, 431 flow [2025-02-08 05:09:02,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:02,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:02,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 642 transitions. [2025-02-08 05:09:02,016 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8734693877551021 [2025-02-08 05:09:02,016 INFO L175 Difference]: Start difference. First operand has 190 places, 183 transitions, 402 flow. Second operand 3 states and 642 transitions. [2025-02-08 05:09:02,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 182 transitions, 431 flow [2025-02-08 05:09:02,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 182 transitions, 423 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-02-08 05:09:02,020 INFO L231 Difference]: Finished difference. Result has 189 places, 181 transitions, 389 flow [2025-02-08 05:09:02,020 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=389, PETRI_PLACES=189, PETRI_TRANSITIONS=181} [2025-02-08 05:09:02,021 INFO L279 CegarLoopForPetriNet]: 232 programPoint places, -43 predicate places. [2025-02-08 05:09:02,022 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 181 transitions, 389 flow [2025-02-08 05:09:02,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.66666666666666) internal successors, (629), 3 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:02,023 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:02,023 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] [2025-02-08 05:09:02,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:09:02,023 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-02-08 05:09:02,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:02,023 INFO L85 PathProgramCache]: Analyzing trace with hash -953917961, now seen corresponding path program 1 times [2025-02-08 05:09:02,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:02,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915624604] [2025-02-08 05:09:02,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:02,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:02,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-08 05:09:02,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 05:09:02,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:02,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:02,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:02,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:02,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915624604] [2025-02-08 05:09:02,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915624604] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:02,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:02,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:09:02,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750026636] [2025-02-08 05:09:02,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:02,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:09:02,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:02,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:09:02,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:09:02,545 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 245 [2025-02-08 05:09:02,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 181 transitions, 389 flow. Second operand has 6 states, 6 states have (on average 184.66666666666666) internal successors, (1108), 6 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:02,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:02,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 245 [2025-02-08 05:09:02,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:02,817 INFO L124 PetriNetUnfolderBase]: 652/3659 cut-off events. [2025-02-08 05:09:02,818 INFO L125 PetriNetUnfolderBase]: For 96/106 co-relation queries the response was YES. [2025-02-08 05:09:02,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5181 conditions, 3659 events. 652/3659 cut-off events. For 96/106 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 31709 event pairs, 296 based on Foata normal form. 0/3276 useless extension candidates. Maximal degree in co-relation 5175. Up to 1255 conditions per place. [2025-02-08 05:09:02,832 INFO L140 encePairwiseOnDemand]: 239/245 looper letters, 44 selfloop transitions, 5 changer transitions 4/188 dead transitions. [2025-02-08 05:09:02,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 188 transitions, 503 flow [2025-02-08 05:09:02,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:09:02,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:09:02,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1149 transitions. [2025-02-08 05:09:02,834 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7816326530612245 [2025-02-08 05:09:02,835 INFO L175 Difference]: Start difference. First operand has 189 places, 181 transitions, 389 flow. Second operand 6 states and 1149 transitions. [2025-02-08 05:09:02,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 188 transitions, 503 flow [2025-02-08 05:09:02,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 188 transitions, 501 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-08 05:09:02,875 INFO L231 Difference]: Finished difference. Result has 191 places, 176 transitions, 387 flow [2025-02-08 05:09:02,876 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=387, PETRI_PLACES=191, PETRI_TRANSITIONS=176} [2025-02-08 05:09:02,876 INFO L279 CegarLoopForPetriNet]: 232 programPoint places, -41 predicate places. [2025-02-08 05:09:02,876 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 176 transitions, 387 flow [2025-02-08 05:09:02,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 184.66666666666666) internal successors, (1108), 6 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:02,877 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:02,877 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:09:02,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:09:02,877 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-02-08 05:09:02,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:02,878 INFO L85 PathProgramCache]: Analyzing trace with hash -502891925, now seen corresponding path program 1 times [2025-02-08 05:09:02,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:02,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634288641] [2025-02-08 05:09:02,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:02,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:02,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 05:09:02,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 05:09:02,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:02,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:02,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:02,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:02,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634288641] [2025-02-08 05:09:02,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634288641] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:02,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:02,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:09:02,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004030853] [2025-02-08 05:09:02,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:02,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:09:02,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:02,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:09:02,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:09:03,020 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 245 [2025-02-08 05:09:03,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 176 transitions, 387 flow. Second operand has 4 states, 4 states have (on average 204.5) internal successors, (818), 4 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:03,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:03,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 245 [2025-02-08 05:09:03,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:03,163 INFO L124 PetriNetUnfolderBase]: 159/1512 cut-off events. [2025-02-08 05:09:03,163 INFO L125 PetriNetUnfolderBase]: For 90/192 co-relation queries the response was YES. [2025-02-08 05:09:03,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1969 conditions, 1512 events. 159/1512 cut-off events. For 90/192 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 10370 event pairs, 120 based on Foata normal form. 11/1351 useless extension candidates. Maximal degree in co-relation 1963. Up to 209 conditions per place. [2025-02-08 05:09:03,169 INFO L140 encePairwiseOnDemand]: 233/245 looper letters, 42 selfloop transitions, 10 changer transitions 0/204 dead transitions. [2025-02-08 05:09:03,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 204 transitions, 571 flow [2025-02-08 05:09:03,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:09:03,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 05:09:03,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 866 transitions. [2025-02-08 05:09:03,172 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8836734693877552 [2025-02-08 05:09:03,172 INFO L175 Difference]: Start difference. First operand has 191 places, 176 transitions, 387 flow. Second operand 4 states and 866 transitions. [2025-02-08 05:09:03,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 204 transitions, 571 flow [2025-02-08 05:09:03,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 204 transitions, 561 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:09:03,175 INFO L231 Difference]: Finished difference. Result has 187 places, 184 transitions, 451 flow [2025-02-08 05:09:03,175 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=451, PETRI_PLACES=187, PETRI_TRANSITIONS=184} [2025-02-08 05:09:03,176 INFO L279 CegarLoopForPetriNet]: 232 programPoint places, -45 predicate places. [2025-02-08 05:09:03,176 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 184 transitions, 451 flow [2025-02-08 05:09:03,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 204.5) internal successors, (818), 4 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:03,176 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:03,177 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:09:03,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:09:03,177 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-02-08 05:09:03,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:03,178 INFO L85 PathProgramCache]: Analyzing trace with hash 754751132, now seen corresponding path program 1 times [2025-02-08 05:09:03,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:03,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489031164] [2025-02-08 05:09:03,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:03,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:03,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 05:09:03,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 05:09:03,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:03,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:09:03,200 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:09:03,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 05:09:03,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 05:09:03,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:03,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:09:03,230 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:09:03,230 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:09:03,231 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 33 remaining) [2025-02-08 05:09:03,232 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (31 of 33 remaining) [2025-02-08 05:09:03,232 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (30 of 33 remaining) [2025-02-08 05:09:03,232 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (29 of 33 remaining) [2025-02-08 05:09:03,232 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (28 of 33 remaining) [2025-02-08 05:09:03,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (27 of 33 remaining) [2025-02-08 05:09:03,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (26 of 33 remaining) [2025-02-08 05:09:03,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (25 of 33 remaining) [2025-02-08 05:09:03,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (24 of 33 remaining) [2025-02-08 05:09:03,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (23 of 33 remaining) [2025-02-08 05:09:03,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (22 of 33 remaining) [2025-02-08 05:09:03,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (21 of 33 remaining) [2025-02-08 05:09:03,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (20 of 33 remaining) [2025-02-08 05:09:03,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (19 of 33 remaining) [2025-02-08 05:09:03,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (18 of 33 remaining) [2025-02-08 05:09:03,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (17 of 33 remaining) [2025-02-08 05:09:03,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (16 of 33 remaining) [2025-02-08 05:09:03,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (15 of 33 remaining) [2025-02-08 05:09:03,234 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (14 of 33 remaining) [2025-02-08 05:09:03,234 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (13 of 33 remaining) [2025-02-08 05:09:03,234 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (12 of 33 remaining) [2025-02-08 05:09:03,234 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (11 of 33 remaining) [2025-02-08 05:09:03,234 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 33 remaining) [2025-02-08 05:09:03,234 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 33 remaining) [2025-02-08 05:09:03,234 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (8 of 33 remaining) [2025-02-08 05:09:03,234 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 33 remaining) [2025-02-08 05:09:03,234 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (6 of 33 remaining) [2025-02-08 05:09:03,234 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 33 remaining) [2025-02-08 05:09:03,234 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (4 of 33 remaining) [2025-02-08 05:09:03,234 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (3 of 33 remaining) [2025-02-08 05:09:03,234 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (2 of 33 remaining) [2025-02-08 05:09:03,234 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (1 of 33 remaining) [2025-02-08 05:09:03,234 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (0 of 33 remaining) [2025-02-08 05:09:03,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:09:03,235 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:09:03,236 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:09:03,237 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 05:09:03,258 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-02-08 05:09:03,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 263 places, 278 transitions, 600 flow [2025-02-08 05:09:03,388 INFO L124 PetriNetUnfolderBase]: 155/1630 cut-off events. [2025-02-08 05:09:03,388 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-02-08 05:09:03,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1719 conditions, 1630 events. 155/1630 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 9467 event pairs, 1 based on Foata normal form. 0/1331 useless extension candidates. Maximal degree in co-relation 942. Up to 32 conditions per place. [2025-02-08 05:09:03,393 INFO L82 GeneralOperation]: Start removeDead. Operand has 263 places, 278 transitions, 600 flow [2025-02-08 05:09:03,399 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 263 places, 278 transitions, 600 flow [2025-02-08 05:09:03,400 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:09:03,400 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;@5b23ce67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:09:03,400 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-02-08 05:09:03,402 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:09:03,402 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-02-08 05:09:03,402 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:09:03,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:03,402 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:09:03,402 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:09:03,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:03,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1839430776, now seen corresponding path program 1 times [2025-02-08 05:09:03,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:03,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901168271] [2025-02-08 05:09:03,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:03,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:03,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 05:09:03,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 05:09:03,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:03,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:03,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:03,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:03,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901168271] [2025-02-08 05:09:03,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901168271] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:03,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:03,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:03,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129648569] [2025-02-08 05:09:03,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:03,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:03,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:03,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:03,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:03,444 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 278 [2025-02-08 05:09:03,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 278 transitions, 600 flow. Second operand has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:03,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:03,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 278 [2025-02-08 05:09:03,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:04,734 INFO L124 PetriNetUnfolderBase]: 2218/10556 cut-off events. [2025-02-08 05:09:04,735 INFO L125 PetriNetUnfolderBase]: For 2105/5174 co-relation queries the response was YES. [2025-02-08 05:09:04,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14543 conditions, 10556 events. 2218/10556 cut-off events. For 2105/5174 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 112559 event pairs, 1905 based on Foata normal form. 1199/10029 useless extension candidates. Maximal degree in co-relation 9437. Up to 3249 conditions per place. [2025-02-08 05:09:04,803 INFO L140 encePairwiseOnDemand]: 251/278 looper letters, 28 selfloop transitions, 1 changer transitions 4/248 dead transitions. [2025-02-08 05:09:04,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 248 transitions, 598 flow [2025-02-08 05:09:04,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:04,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:04,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 718 transitions. [2025-02-08 05:09:04,806 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8609112709832134 [2025-02-08 05:09:04,806 INFO L175 Difference]: Start difference. First operand has 263 places, 278 transitions, 600 flow. Second operand 3 states and 718 transitions. [2025-02-08 05:09:04,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 248 transitions, 598 flow [2025-02-08 05:09:04,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 248 transitions, 598 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:09:04,813 INFO L231 Difference]: Finished difference. Result has 249 places, 244 transitions, 534 flow [2025-02-08 05:09:04,814 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=534, PETRI_PLACES=249, PETRI_TRANSITIONS=244} [2025-02-08 05:09:04,815 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -14 predicate places. [2025-02-08 05:09:04,815 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 244 transitions, 534 flow [2025-02-08 05:09:04,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:04,816 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:04,816 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] [2025-02-08 05:09:04,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:09:04,816 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:09:04,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:04,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1187773361, now seen corresponding path program 1 times [2025-02-08 05:09:04,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:04,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703568498] [2025-02-08 05:09:04,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:04,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:04,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 05:09:04,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 05:09:04,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:04,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:04,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:04,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:04,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703568498] [2025-02-08 05:09:04,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703568498] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:04,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:04,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:04,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556349021] [2025-02-08 05:09:04,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:04,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:04,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:04,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:04,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:04,854 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 278 [2025-02-08 05:09:04,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 244 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:04,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:04,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 278 [2025-02-08 05:09:04,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:06,402 INFO L124 PetriNetUnfolderBase]: 2492/17972 cut-off events. [2025-02-08 05:09:06,402 INFO L125 PetriNetUnfolderBase]: For 5268/27144 co-relation queries the response was YES. [2025-02-08 05:09:06,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22939 conditions, 17972 events. 2492/17972 cut-off events. For 5268/27144 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 225853 event pairs, 1706 based on Foata normal form. 0/14727 useless extension candidates. Maximal degree in co-relation 11439. Up to 1670 conditions per place. [2025-02-08 05:09:06,492 INFO L140 encePairwiseOnDemand]: 276/278 looper letters, 41 selfloop transitions, 1 changer transitions 0/263 dead transitions. [2025-02-08 05:09:06,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 263 transitions, 696 flow [2025-02-08 05:09:06,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:06,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:06,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 736 transitions. [2025-02-08 05:09:06,494 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.882494004796163 [2025-02-08 05:09:06,494 INFO L175 Difference]: Start difference. First operand has 249 places, 244 transitions, 534 flow. Second operand 3 states and 736 transitions. [2025-02-08 05:09:06,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 263 transitions, 696 flow [2025-02-08 05:09:06,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 263 transitions, 695 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:09:06,498 INFO L231 Difference]: Finished difference. Result has 245 places, 243 transitions, 533 flow [2025-02-08 05:09:06,499 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=533, PETRI_PLACES=245, PETRI_TRANSITIONS=243} [2025-02-08 05:09:06,499 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -18 predicate places. [2025-02-08 05:09:06,499 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 243 transitions, 533 flow [2025-02-08 05:09:06,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:06,500 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:06,500 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] [2025-02-08 05:09:06,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:09:06,500 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:09:06,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:06,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1833869870, now seen corresponding path program 1 times [2025-02-08 05:09:06,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:06,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632653316] [2025-02-08 05:09:06,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:06,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:06,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 05:09:06,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 05:09:06,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:06,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:06,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:06,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:06,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632653316] [2025-02-08 05:09:06,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632653316] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:06,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:06,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:06,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781985398] [2025-02-08 05:09:06,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:06,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:06,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:06,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:06,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:06,531 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 278 [2025-02-08 05:09:06,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 243 transitions, 533 flow. Second operand has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:06,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:06,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 278 [2025-02-08 05:09:06,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:10,018 INFO L124 PetriNetUnfolderBase]: 14770/42333 cut-off events. [2025-02-08 05:09:10,019 INFO L125 PetriNetUnfolderBase]: For 9226/47382 co-relation queries the response was YES. [2025-02-08 05:09:10,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66272 conditions, 42333 events. 14770/42333 cut-off events. For 9226/47382 co-relation queries the response was YES. Maximal size of possible extension queue 1110. Compared 494882 event pairs, 4272 based on Foata normal form. 121/37347 useless extension candidates. Maximal degree in co-relation 33132. Up to 17809 conditions per place. [2025-02-08 05:09:10,275 INFO L140 encePairwiseOnDemand]: 264/278 looper letters, 41 selfloop transitions, 2 changer transitions 18/258 dead transitions. [2025-02-08 05:09:10,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 258 transitions, 702 flow [2025-02-08 05:09:10,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:10,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:10,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 701 transitions. [2025-02-08 05:09:10,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8405275779376499 [2025-02-08 05:09:10,277 INFO L175 Difference]: Start difference. First operand has 245 places, 243 transitions, 533 flow. Second operand 3 states and 701 transitions. [2025-02-08 05:09:10,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 258 transitions, 702 flow [2025-02-08 05:09:10,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 258 transitions, 701 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:09:10,283 INFO L231 Difference]: Finished difference. Result has 240 places, 223 transitions, 502 flow [2025-02-08 05:09:10,283 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=502, PETRI_PLACES=240, PETRI_TRANSITIONS=223} [2025-02-08 05:09:10,284 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -23 predicate places. [2025-02-08 05:09:10,284 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 223 transitions, 502 flow [2025-02-08 05:09:10,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:10,285 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:10,285 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] [2025-02-08 05:09:10,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:09:10,285 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:09:10,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:10,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1083751645, now seen corresponding path program 1 times [2025-02-08 05:09:10,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:10,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720756658] [2025-02-08 05:09:10,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:10,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:10,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 05:09:10,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 05:09:10,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:10,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:10,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:10,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:10,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720756658] [2025-02-08 05:09:10,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720756658] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:10,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:10,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:10,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564021710] [2025-02-08 05:09:10,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:10,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:10,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:10,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:10,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:10,318 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 278 [2025-02-08 05:09:10,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 223 transitions, 502 flow. Second operand has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:10,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:10,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 278 [2025-02-08 05:09:10,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:12,452 INFO L124 PetriNetUnfolderBase]: 6096/23780 cut-off events. [2025-02-08 05:09:12,452 INFO L125 PetriNetUnfolderBase]: For 4746/11286 co-relation queries the response was YES. [2025-02-08 05:09:12,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35749 conditions, 23780 events. 6096/23780 cut-off events. For 4746/11286 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 277004 event pairs, 5210 based on Foata normal form. 0/21020 useless extension candidates. Maximal degree in co-relation 28670. Up to 8524 conditions per place. [2025-02-08 05:09:12,552 INFO L140 encePairwiseOnDemand]: 272/278 looper letters, 28 selfloop transitions, 2 changer transitions 0/220 dead transitions. [2025-02-08 05:09:12,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 220 transitions, 556 flow [2025-02-08 05:09:12,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:12,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:12,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 697 transitions. [2025-02-08 05:09:12,554 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8357314148681055 [2025-02-08 05:09:12,554 INFO L175 Difference]: Start difference. First operand has 240 places, 223 transitions, 502 flow. Second operand 3 states and 697 transitions. [2025-02-08 05:09:12,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 220 transitions, 556 flow [2025-02-08 05:09:12,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 220 transitions, 556 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:09:12,559 INFO L231 Difference]: Finished difference. Result has 224 places, 220 transitions, 504 flow [2025-02-08 05:09:12,560 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=504, PETRI_PLACES=224, PETRI_TRANSITIONS=220} [2025-02-08 05:09:12,560 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -39 predicate places. [2025-02-08 05:09:12,561 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 220 transitions, 504 flow [2025-02-08 05:09:12,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:12,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:12,562 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] [2025-02-08 05:09:12,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:09:12,562 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:09:12,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:12,562 INFO L85 PathProgramCache]: Analyzing trace with hash -466336073, now seen corresponding path program 1 times [2025-02-08 05:09:12,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:12,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254502153] [2025-02-08 05:09:12,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:12,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:12,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 05:09:12,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 05:09:12,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:12,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:12,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:12,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:12,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254502153] [2025-02-08 05:09:12,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254502153] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:12,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:12,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:12,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551876256] [2025-02-08 05:09:12,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:12,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:12,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:12,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:12,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:12,598 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 278 [2025-02-08 05:09:12,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 220 transitions, 504 flow. Second operand has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:12,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:12,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 278 [2025-02-08 05:09:12,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:13,945 INFO L124 PetriNetUnfolderBase]: 4656/19695 cut-off events. [2025-02-08 05:09:13,946 INFO L125 PetriNetUnfolderBase]: For 4754/12902 co-relation queries the response was YES. [2025-02-08 05:09:14,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29201 conditions, 19695 events. 4656/19695 cut-off events. For 4754/12902 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 229345 event pairs, 3782 based on Foata normal form. 0/16702 useless extension candidates. Maximal degree in co-relation 24021. Up to 6578 conditions per place. [2025-02-08 05:09:14,056 INFO L140 encePairwiseOnDemand]: 275/278 looper letters, 28 selfloop transitions, 2 changer transitions 2/219 dead transitions. [2025-02-08 05:09:14,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 219 transitions, 562 flow [2025-02-08 05:09:14,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:14,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:14,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 700 transitions. [2025-02-08 05:09:14,059 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8393285371702638 [2025-02-08 05:09:14,059 INFO L175 Difference]: Start difference. First operand has 224 places, 220 transitions, 504 flow. Second operand 3 states and 700 transitions. [2025-02-08 05:09:14,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 219 transitions, 562 flow [2025-02-08 05:09:14,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 219 transitions, 562 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:09:14,064 INFO L231 Difference]: Finished difference. Result has 225 places, 217 transitions, 502 flow [2025-02-08 05:09:14,064 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=502, PETRI_PLACES=225, PETRI_TRANSITIONS=217} [2025-02-08 05:09:14,065 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -38 predicate places. [2025-02-08 05:09:14,065 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 217 transitions, 502 flow [2025-02-08 05:09:14,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:14,065 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:14,065 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] [2025-02-08 05:09:14,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:09:14,066 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:09:14,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:14,066 INFO L85 PathProgramCache]: Analyzing trace with hash -754359404, now seen corresponding path program 1 times [2025-02-08 05:09:14,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:14,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617495] [2025-02-08 05:09:14,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:14,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:14,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 05:09:14,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 05:09:14,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:14,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:14,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:14,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:14,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617495] [2025-02-08 05:09:14,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617495] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:14,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:14,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:14,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732506368] [2025-02-08 05:09:14,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:14,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:14,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:14,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:14,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:14,094 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 278 [2025-02-08 05:09:14,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 217 transitions, 502 flow. Second operand has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:14,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:14,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 278 [2025-02-08 05:09:14,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:15,542 INFO L124 PetriNetUnfolderBase]: 2546/16004 cut-off events. [2025-02-08 05:09:15,542 INFO L125 PetriNetUnfolderBase]: For 5268/27144 co-relation queries the response was YES. [2025-02-08 05:09:15,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21678 conditions, 16004 events. 2546/16004 cut-off events. For 5268/27144 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 192596 event pairs, 1706 based on Foata normal form. 0/13616 useless extension candidates. Maximal degree in co-relation 19193. Up to 1670 conditions per place. [2025-02-08 05:09:15,615 INFO L140 encePairwiseOnDemand]: 276/278 looper letters, 41 selfloop transitions, 1 changer transitions 0/236 dead transitions. [2025-02-08 05:09:15,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 236 transitions, 664 flow [2025-02-08 05:09:15,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:15,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:15,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 736 transitions. [2025-02-08 05:09:15,617 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.882494004796163 [2025-02-08 05:09:15,618 INFO L175 Difference]: Start difference. First operand has 225 places, 217 transitions, 502 flow. Second operand 3 states and 736 transitions. [2025-02-08 05:09:15,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 236 transitions, 664 flow [2025-02-08 05:09:15,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 236 transitions, 660 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:09:15,622 INFO L231 Difference]: Finished difference. Result has 222 places, 216 transitions, 498 flow [2025-02-08 05:09:15,622 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=498, PETRI_PLACES=222, PETRI_TRANSITIONS=216} [2025-02-08 05:09:15,623 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -41 predicate places. [2025-02-08 05:09:15,623 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 216 transitions, 498 flow [2025-02-08 05:09:15,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:15,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:15,623 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] [2025-02-08 05:09:15,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:09:15,623 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:09:15,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:15,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1206016708, now seen corresponding path program 1 times [2025-02-08 05:09:15,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:15,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629989160] [2025-02-08 05:09:15,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:15,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:15,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 05:09:15,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 05:09:15,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:15,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:15,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:15,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:15,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629989160] [2025-02-08 05:09:15,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629989160] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:15,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:15,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:15,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871709731] [2025-02-08 05:09:15,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:15,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:15,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:15,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:15,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:15,660 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 278 [2025-02-08 05:09:15,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 216 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:15,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:15,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 278 [2025-02-08 05:09:15,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:17,620 INFO L124 PetriNetUnfolderBase]: 5342/21325 cut-off events. [2025-02-08 05:09:17,620 INFO L125 PetriNetUnfolderBase]: For 4784/13692 co-relation queries the response was YES. [2025-02-08 05:09:17,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31977 conditions, 21325 events. 5342/21325 cut-off events. For 4784/13692 co-relation queries the response was YES. Maximal size of possible extension queue 602. Compared 250269 event pairs, 4482 based on Foata normal form. 0/18112 useless extension candidates. Maximal degree in co-relation 25846. Up to 7458 conditions per place. [2025-02-08 05:09:17,710 INFO L140 encePairwiseOnDemand]: 275/278 looper letters, 29 selfloop transitions, 2 changer transitions 0/215 dead transitions. [2025-02-08 05:09:17,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 215 transitions, 558 flow [2025-02-08 05:09:17,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:17,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:17,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 700 transitions. [2025-02-08 05:09:17,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8393285371702638 [2025-02-08 05:09:17,715 INFO L175 Difference]: Start difference. First operand has 222 places, 216 transitions, 498 flow. Second operand 3 states and 700 transitions. [2025-02-08 05:09:17,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 215 transitions, 558 flow [2025-02-08 05:09:17,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 215 transitions, 557 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:09:17,724 INFO L231 Difference]: Finished difference. Result has 222 places, 215 transitions, 499 flow [2025-02-08 05:09:17,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=499, PETRI_PLACES=222, PETRI_TRANSITIONS=215} [2025-02-08 05:09:17,724 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -41 predicate places. [2025-02-08 05:09:17,724 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 215 transitions, 499 flow [2025-02-08 05:09:17,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:17,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:17,728 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] [2025-02-08 05:09:17,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:09:17,729 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:09:17,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:17,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1655117953, now seen corresponding path program 1 times [2025-02-08 05:09:17,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:17,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448061487] [2025-02-08 05:09:17,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:17,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:17,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 05:09:17,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 05:09:17,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:17,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:17,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:17,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:17,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448061487] [2025-02-08 05:09:17,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448061487] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:17,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:17,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:09:17,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245421819] [2025-02-08 05:09:17,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:17,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:17,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:17,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:17,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:17,773 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 278 [2025-02-08 05:09:17,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 215 transitions, 499 flow. Second operand has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:17,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:17,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 278 [2025-02-08 05:09:17,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:19,782 INFO L124 PetriNetUnfolderBase]: 3752/19495 cut-off events. [2025-02-08 05:09:19,783 INFO L125 PetriNetUnfolderBase]: For 5268/27144 co-relation queries the response was YES. [2025-02-08 05:09:19,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27253 conditions, 19495 events. 3752/19495 cut-off events. For 5268/27144 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 235646 event pairs, 2730 based on Foata normal form. 2/16460 useless extension candidates. Maximal degree in co-relation 23378. Up to 5036 conditions per place. [2025-02-08 05:09:19,867 INFO L140 encePairwiseOnDemand]: 276/278 looper letters, 27 selfloop transitions, 0 changer transitions 1/214 dead transitions. [2025-02-08 05:09:19,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 214 transitions, 550 flow [2025-02-08 05:09:19,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:19,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:19,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 701 transitions. [2025-02-08 05:09:19,869 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8405275779376499 [2025-02-08 05:09:19,869 INFO L175 Difference]: Start difference. First operand has 222 places, 215 transitions, 499 flow. Second operand 3 states and 701 transitions. [2025-02-08 05:09:19,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 214 transitions, 550 flow [2025-02-08 05:09:19,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 214 transitions, 542 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-02-08 05:09:19,874 INFO L231 Difference]: Finished difference. Result has 221 places, 213 transitions, 486 flow [2025-02-08 05:09:19,874 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=486, PETRI_PLACES=221, PETRI_TRANSITIONS=213} [2025-02-08 05:09:19,875 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -42 predicate places. [2025-02-08 05:09:19,875 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 213 transitions, 486 flow [2025-02-08 05:09:19,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:19,875 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:19,875 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] [2025-02-08 05:09:19,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:09:19,875 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:09:19,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:19,876 INFO L85 PathProgramCache]: Analyzing trace with hash -673798133, now seen corresponding path program 1 times [2025-02-08 05:09:19,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:19,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597152029] [2025-02-08 05:09:19,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:19,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:19,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-08 05:09:19,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 05:09:19,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:19,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:20,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:20,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:20,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597152029] [2025-02-08 05:09:20,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597152029] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:20,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:20,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:09:20,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384369080] [2025-02-08 05:09:20,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:20,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:09:20,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:20,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:09:20,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:09:20,237 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 278 [2025-02-08 05:09:20,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 213 transitions, 486 flow. Second operand has 6 states, 6 states have (on average 200.66666666666666) internal successors, (1204), 6 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:20,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:20,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 278 [2025-02-08 05:09:20,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:26,231 INFO L124 PetriNetUnfolderBase]: 21016/72675 cut-off events. [2025-02-08 05:09:26,232 INFO L125 PetriNetUnfolderBase]: For 3200/3342 co-relation queries the response was YES. [2025-02-08 05:09:26,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111202 conditions, 72675 events. 21016/72675 cut-off events. For 3200/3342 co-relation queries the response was YES. Maximal size of possible extension queue 1503. Compared 961432 event pairs, 9754 based on Foata normal form. 0/66400 useless extension candidates. Maximal degree in co-relation 111193. Up to 29941 conditions per place. [2025-02-08 05:09:26,591 INFO L140 encePairwiseOnDemand]: 271/278 looper letters, 64 selfloop transitions, 5 changer transitions 3/228 dead transitions. [2025-02-08 05:09:26,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 228 transitions, 656 flow [2025-02-08 05:09:26,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:09:26,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:09:26,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1265 transitions. [2025-02-08 05:09:26,593 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7583932853717026 [2025-02-08 05:09:26,593 INFO L175 Difference]: Start difference. First operand has 221 places, 213 transitions, 486 flow. Second operand 6 states and 1265 transitions. [2025-02-08 05:09:26,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 228 transitions, 656 flow [2025-02-08 05:09:26,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 228 transitions, 654 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-08 05:09:26,604 INFO L231 Difference]: Finished difference. Result has 223 places, 209 transitions, 486 flow [2025-02-08 05:09:26,604 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=486, PETRI_PLACES=223, PETRI_TRANSITIONS=209} [2025-02-08 05:09:26,605 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -40 predicate places. [2025-02-08 05:09:26,605 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 209 transitions, 486 flow [2025-02-08 05:09:26,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 200.66666666666666) internal successors, (1204), 6 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:26,605 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:26,605 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:09:26,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 05:09:26,606 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:09:26,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:26,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1579106175, now seen corresponding path program 1 times [2025-02-08 05:09:26,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:26,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87790743] [2025-02-08 05:09:26,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:26,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:26,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 05:09:26,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 05:09:26,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:26,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:26,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:26,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:26,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87790743] [2025-02-08 05:09:26,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87790743] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:26,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:26,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:09:26,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024979213] [2025-02-08 05:09:26,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:26,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:09:26,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:26,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:09:26,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:09:26,749 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 278 [2025-02-08 05:09:26,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 209 transitions, 486 flow. Second operand has 4 states, 4 states have (on average 220.5) internal successors, (882), 4 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:26,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:26,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 278 [2025-02-08 05:09:26,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:29,136 INFO L124 PetriNetUnfolderBase]: 7222/29018 cut-off events. [2025-02-08 05:09:29,136 INFO L125 PetriNetUnfolderBase]: For 4098/8924 co-relation queries the response was YES. [2025-02-08 05:09:29,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43101 conditions, 29018 events. 7222/29018 cut-off events. For 4098/8924 co-relation queries the response was YES. Maximal size of possible extension queue 708. Compared 354236 event pairs, 5043 based on Foata normal form. 137/25717 useless extension candidates. Maximal degree in co-relation 43092. Up to 5892 conditions per place. [2025-02-08 05:09:29,295 INFO L140 encePairwiseOnDemand]: 265/278 looper letters, 77 selfloop transitions, 11 changer transitions 0/262 dead transitions. [2025-02-08 05:09:29,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 262 transitions, 832 flow [2025-02-08 05:09:29,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:09:29,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 05:09:29,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 966 transitions. [2025-02-08 05:09:29,297 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8687050359712231 [2025-02-08 05:09:29,297 INFO L175 Difference]: Start difference. First operand has 223 places, 209 transitions, 486 flow. Second operand 4 states and 966 transitions. [2025-02-08 05:09:29,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 262 transitions, 832 flow [2025-02-08 05:09:29,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 262 transitions, 822 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:09:29,304 INFO L231 Difference]: Finished difference. Result has 220 places, 218 transitions, 558 flow [2025-02-08 05:09:29,304 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=558, PETRI_PLACES=220, PETRI_TRANSITIONS=218} [2025-02-08 05:09:29,305 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -43 predicate places. [2025-02-08 05:09:29,305 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 218 transitions, 558 flow [2025-02-08 05:09:29,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 220.5) internal successors, (882), 4 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:29,305 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:29,305 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:09:29,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 05:09:29,306 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:09:29,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:29,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1265955357, now seen corresponding path program 1 times [2025-02-08 05:09:29,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:29,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089631985] [2025-02-08 05:09:29,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:29,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:29,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-08 05:09:29,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-08 05:09:29,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:29,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:29,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:29,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:29,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089631985] [2025-02-08 05:09:29,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089631985] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:29,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:29,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 05:09:29,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782827533] [2025-02-08 05:09:29,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:29,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:09:29,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:29,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:09:29,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:09:29,533 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 278 [2025-02-08 05:09:29,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 218 transitions, 558 flow. Second operand has 6 states, 6 states have (on average 216.83333333333334) internal successors, (1301), 6 states have internal predecessors, (1301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:29,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:29,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 278 [2025-02-08 05:09:29,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:32,485 INFO L124 PetriNetUnfolderBase]: 8170/32850 cut-off events. [2025-02-08 05:09:32,485 INFO L125 PetriNetUnfolderBase]: For 7366/8964 co-relation queries the response was YES. [2025-02-08 05:09:32,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51732 conditions, 32850 events. 8170/32850 cut-off events. For 7366/8964 co-relation queries the response was YES. Maximal size of possible extension queue 699. Compared 409226 event pairs, 5344 based on Foata normal form. 3/29317 useless extension candidates. Maximal degree in co-relation 51721. Up to 6739 conditions per place. [2025-02-08 05:09:32,651 INFO L140 encePairwiseOnDemand]: 262/278 looper letters, 96 selfloop transitions, 17 changer transitions 0/283 dead transitions. [2025-02-08 05:09:32,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 283 transitions, 994 flow [2025-02-08 05:09:32,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 05:09:32,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 05:09:32,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1619 transitions. [2025-02-08 05:09:32,654 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8319630010277492 [2025-02-08 05:09:32,654 INFO L175 Difference]: Start difference. First operand has 220 places, 218 transitions, 558 flow. Second operand 7 states and 1619 transitions. [2025-02-08 05:09:32,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 283 transitions, 994 flow [2025-02-08 05:09:32,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 283 transitions, 992 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:09:32,662 INFO L231 Difference]: Finished difference. Result has 229 places, 224 transitions, 650 flow [2025-02-08 05:09:32,663 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=650, PETRI_PLACES=229, PETRI_TRANSITIONS=224} [2025-02-08 05:09:32,663 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -34 predicate places. [2025-02-08 05:09:32,663 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 224 transitions, 650 flow [2025-02-08 05:09:32,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 216.83333333333334) internal successors, (1301), 6 states have internal predecessors, (1301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:32,664 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:32,664 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:09:32,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 05:09:32,664 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:09:32,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:32,664 INFO L85 PathProgramCache]: Analyzing trace with hash 794953979, now seen corresponding path program 1 times [2025-02-08 05:09:32,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:32,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241881688] [2025-02-08 05:09:32,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:32,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:32,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-08 05:09:32,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-08 05:09:32,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:32,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:32,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:32,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:32,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241881688] [2025-02-08 05:09:32,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241881688] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:32,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:32,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:09:32,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261148047] [2025-02-08 05:09:32,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:32,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:09:32,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:32,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:09:32,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:09:32,980 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 278 [2025-02-08 05:09:32,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 224 transitions, 650 flow. Second operand has 6 states, 6 states have (on average 200.83333333333334) internal successors, (1205), 6 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:32,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:32,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 278 [2025-02-08 05:09:32,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:37,852 INFO L124 PetriNetUnfolderBase]: 21085/50618 cut-off events. [2025-02-08 05:09:37,853 INFO L125 PetriNetUnfolderBase]: For 11053/11057 co-relation queries the response was YES. [2025-02-08 05:09:38,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89377 conditions, 50618 events. 21085/50618 cut-off events. For 11053/11057 co-relation queries the response was YES. Maximal size of possible extension queue 839. Compared 527090 event pairs, 9342 based on Foata normal form. 0/47521 useless extension candidates. Maximal degree in co-relation 89362. Up to 25899 conditions per place. [2025-02-08 05:09:38,410 INFO L140 encePairwiseOnDemand]: 271/278 looper letters, 91 selfloop transitions, 6 changer transitions 0/255 dead transitions. [2025-02-08 05:09:38,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 255 transitions, 906 flow [2025-02-08 05:09:38,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:09:38,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:09:38,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1281 transitions. [2025-02-08 05:09:38,412 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7679856115107914 [2025-02-08 05:09:38,413 INFO L175 Difference]: Start difference. First operand has 229 places, 224 transitions, 650 flow. Second operand 6 states and 1281 transitions. [2025-02-08 05:09:38,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 255 transitions, 906 flow [2025-02-08 05:09:38,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 255 transitions, 880 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-02-08 05:09:38,435 INFO L231 Difference]: Finished difference. Result has 230 places, 223 transitions, 634 flow [2025-02-08 05:09:38,435 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=634, PETRI_PLACES=230, PETRI_TRANSITIONS=223} [2025-02-08 05:09:38,436 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -33 predicate places. [2025-02-08 05:09:38,437 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 223 transitions, 634 flow [2025-02-08 05:09:38,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 200.83333333333334) internal successors, (1205), 6 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:38,437 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:38,437 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:09:38,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 05:09:38,437 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:09:38,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:38,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1844938729, now seen corresponding path program 1 times [2025-02-08 05:09:38,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:38,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077485850] [2025-02-08 05:09:38,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:38,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:38,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-08 05:09:38,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-08 05:09:38,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:38,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:38,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:38,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:38,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077485850] [2025-02-08 05:09:38,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077485850] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:38,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:38,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:09:38,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105437532] [2025-02-08 05:09:38,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:38,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:09:38,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:38,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:09:38,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:09:38,667 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 278 [2025-02-08 05:09:38,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 223 transitions, 634 flow. Second operand has 5 states, 5 states have (on average 218.8) internal successors, (1094), 5 states have internal predecessors, (1094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:38,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:38,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 278 [2025-02-08 05:09:38,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand