./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-deagle/reorder_c11_bad-40.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-deagle/reorder_c11_bad-40.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 b6d5da741db538e8728209fa456d0dc9c63ceba5521dacbaf062bafc94e3da01 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:35:07,046 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:35:07,100 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:35:07,106 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:35:07,106 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:35:07,127 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:35:07,128 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:35:07,128 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:35:07,128 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:35:07,128 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:35:07,129 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:35:07,130 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:35:07,130 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:35:07,130 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:35:07,131 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:35:07,131 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:35:07,131 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:35:07,131 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:35:07,131 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:35:07,131 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:35:07,131 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:35:07,131 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:35:07,131 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:35:07,131 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:35:07,131 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:35:07,131 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:35:07,131 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:35:07,131 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:35:07,131 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:35:07,131 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:35:07,132 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:35:07,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:35:07,132 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:35:07,132 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:35:07,132 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:35:07,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:35:07,132 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:35:07,132 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:35:07,132 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:35:07,132 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:35:07,132 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:35:07,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:35:07,132 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:35:07,132 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:35:07,132 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:35:07,133 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:35:07,133 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 -> b6d5da741db538e8728209fa456d0dc9c63ceba5521dacbaf062bafc94e3da01 [2025-01-09 21:35:07,353 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:35:07,362 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:35:07,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:35:07,365 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:35:07,365 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:35:07,366 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/reorder_c11_bad-40.i [2025-01-09 21:35:08,482 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6ca2ad788/0b0f9716815f4d85a38334221b1fe8bd/FLAG2d2abc03b [2025-01-09 21:35:08,752 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:35:08,753 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-deagle/reorder_c11_bad-40.i [2025-01-09 21:35:08,767 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6ca2ad788/0b0f9716815f4d85a38334221b1fe8bd/FLAG2d2abc03b [2025-01-09 21:35:09,059 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6ca2ad788/0b0f9716815f4d85a38334221b1fe8bd [2025-01-09 21:35:09,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:35:09,063 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:35:09,065 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:35:09,065 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:35:09,068 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:35:09,070 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:35:09" (1/1) ... [2025-01-09 21:35:09,070 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3800c82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:35:09, skipping insertion in model container [2025-01-09 21:35:09,070 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:35:09" (1/1) ... [2025-01-09 21:35:09,098 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:35:09,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:35:09,314 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:35:09,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:35:09,385 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:35:09,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:35:09 WrapperNode [2025-01-09 21:35:09,386 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:35:09,387 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:35:09,387 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:35:09,387 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:35:09,393 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:35:09" (1/1) ... [2025-01-09 21:35:09,405 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:35:09" (1/1) ... [2025-01-09 21:35:09,428 INFO L138 Inliner]: procedures = 163, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 169 [2025-01-09 21:35:09,429 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:35:09,429 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:35:09,429 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:35:09,429 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:35:09,434 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:35:09" (1/1) ... [2025-01-09 21:35:09,435 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:35:09" (1/1) ... [2025-01-09 21:35:09,437 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:35:09" (1/1) ... [2025-01-09 21:35:09,437 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:35:09" (1/1) ... [2025-01-09 21:35:09,446 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:35:09" (1/1) ... [2025-01-09 21:35:09,447 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:35:09" (1/1) ... [2025-01-09 21:35:09,453 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:35:09" (1/1) ... [2025-01-09 21:35:09,454 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:35:09" (1/1) ... [2025-01-09 21:35:09,455 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:35:09" (1/1) ... [2025-01-09 21:35:09,456 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:35:09,457 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:35:09,457 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:35:09,457 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:35:09,458 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:35:09" (1/1) ... [2025-01-09 21:35:09,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:35:09,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:35:09,488 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:35:09,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:35:09,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:35:09,506 INFO L130 BoogieDeclarations]: Found specification of procedure setThread [2025-01-09 21:35:09,506 INFO L138 BoogieDeclarations]: Found implementation of procedure setThread [2025-01-09 21:35:09,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:35:09,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 21:35:09,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:35:09,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 21:35:09,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:35:09,506 INFO L130 BoogieDeclarations]: Found specification of procedure checkThread [2025-01-09 21:35:09,506 INFO L138 BoogieDeclarations]: Found implementation of procedure checkThread [2025-01-09 21:35:09,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:35:09,507 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 21:35:09,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:35:09,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:35:09,508 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:35:09,600 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:35:09,603 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:35:09,882 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:35:09,882 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:35:09,899 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:35:09,900 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-09 21:35:09,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:35:09 BoogieIcfgContainer [2025-01-09 21:35:09,900 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:35:09,901 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:35:09,902 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:35:09,905 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:35:09,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:35:09" (1/3) ... [2025-01-09 21:35:09,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3051ea7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:35:09, skipping insertion in model container [2025-01-09 21:35:09,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:35:09" (2/3) ... [2025-01-09 21:35:09,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3051ea7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:35:09, skipping insertion in model container [2025-01-09 21:35:09,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:35:09" (3/3) ... [2025-01-09 21:35:09,907 INFO L128 eAbstractionObserver]: Analyzing ICFG reorder_c11_bad-40.i [2025-01-09 21:35:09,917 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:35:09,918 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG reorder_c11_bad-40.i that has 3 procedures, 204 locations, 1 initial locations, 4 loop locations, and 30 error locations. [2025-01-09 21:35:09,919 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:35:09,985 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-09 21:35:10,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 210 places, 218 transitions, 456 flow [2025-01-09 21:35:10,137 INFO L124 PetriNetUnfolderBase]: 32/558 cut-off events. [2025-01-09 21:35:10,139 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-01-09 21:35:10,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 575 conditions, 558 events. 32/558 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2223 event pairs, 0 based on Foata normal form. 0/439 useless extension candidates. Maximal degree in co-relation 267. Up to 8 conditions per place. [2025-01-09 21:35:10,149 INFO L82 GeneralOperation]: Start removeDead. Operand has 210 places, 218 transitions, 456 flow [2025-01-09 21:35:10,155 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 210 places, 218 transitions, 456 flow [2025-01-09 21:35:10,162 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:35:10,171 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;@3f85ce68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:35:10,172 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-01-09 21:35:10,177 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:35:10,177 INFO L124 PetriNetUnfolderBase]: 0/19 cut-off events. [2025-01-09 21:35:10,178 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:35:10,178 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:35:10,178 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-01-09 21:35:10,178 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-01-09 21:35:10,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:35:10,182 INFO L85 PathProgramCache]: Analyzing trace with hash 917027871, now seen corresponding path program 1 times [2025-01-09 21:35:10,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:35:10,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520908384] [2025-01-09 21:35:10,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:35:10,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:35:10,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:35:10,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:35:10,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:35:10,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:35:10,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:35:10,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:35:10,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520908384] [2025-01-09 21:35:10,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520908384] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:35:10,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:35:10,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:35:10,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212440716] [2025-01-09 21:35:10,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:35:10,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:35:10,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:35:10,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:35:10,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:35:10,483 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 218 [2025-01-09 21:35:10,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 218 transitions, 456 flow. Second operand has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:35:10,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:35:10,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 218 [2025-01-09 21:35:10,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:35:10,654 INFO L124 PetriNetUnfolderBase]: 85/994 cut-off events. [2025-01-09 21:35:10,654 INFO L125 PetriNetUnfolderBase]: For 41/43 co-relation queries the response was YES. [2025-01-09 21:35:10,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1228 conditions, 994 events. 85/994 cut-off events. For 41/43 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 5493 event pairs, 64 based on Foata normal form. 82/892 useless extension candidates. Maximal degree in co-relation 886. Up to 207 conditions per place. [2025-01-09 21:35:10,666 INFO L140 encePairwiseOnDemand]: 207/218 looper letters, 31 selfloop transitions, 2 changer transitions 0/207 dead transitions. [2025-01-09 21:35:10,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 207 transitions, 500 flow [2025-01-09 21:35:10,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:35:10,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:35:10,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 567 transitions. [2025-01-09 21:35:10,683 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8669724770642202 [2025-01-09 21:35:10,684 INFO L175 Difference]: Start difference. First operand has 210 places, 218 transitions, 456 flow. Second operand 3 states and 567 transitions. [2025-01-09 21:35:10,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 207 transitions, 500 flow [2025-01-09 21:35:10,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 207 transitions, 500 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:35:10,694 INFO L231 Difference]: Finished difference. Result has 207 places, 207 transitions, 438 flow [2025-01-09 21:35:10,697 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=438, PETRI_PLACES=207, PETRI_TRANSITIONS=207} [2025-01-09 21:35:10,699 INFO L279 CegarLoopForPetriNet]: 210 programPoint places, -3 predicate places. [2025-01-09 21:35:10,701 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 207 transitions, 438 flow [2025-01-09 21:35:10,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:35:10,701 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:35:10,702 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-01-09 21:35:10,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:35:10,702 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-01-09 21:35:10,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:35:10,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1109233585, now seen corresponding path program 1 times [2025-01-09 21:35:10,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:35:10,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289097395] [2025-01-09 21:35:10,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:35:10,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:35:10,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 21:35:10,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 21:35:10,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:35:10,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:35:10,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:35:10,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:35:10,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289097395] [2025-01-09 21:35:10,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289097395] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:35:10,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:35:10,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:35:10,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369448626] [2025-01-09 21:35:10,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:35:10,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:35:10,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:35:10,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:35:10,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:35:10,845 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 218 [2025-01-09 21:35:10,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 207 transitions, 438 flow. Second operand has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:35:10,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:35:10,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 218 [2025-01-09 21:35:10,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:35:10,956 INFO L124 PetriNetUnfolderBase]: 117/1003 cut-off events. [2025-01-09 21:35:10,956 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-01-09 21:35:10,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1331 conditions, 1003 events. 117/1003 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 5449 event pairs, 78 based on Foata normal form. 0/883 useless extension candidates. Maximal degree in co-relation 1302. Up to 243 conditions per place. [2025-01-09 21:35:10,962 INFO L140 encePairwiseOnDemand]: 195/218 looper letters, 31 selfloop transitions, 11 changer transitions 0/197 dead transitions. [2025-01-09 21:35:10,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 197 transitions, 502 flow [2025-01-09 21:35:10,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:35:10,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:35:10,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 525 transitions. [2025-01-09 21:35:10,965 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8027522935779816 [2025-01-09 21:35:10,965 INFO L175 Difference]: Start difference. First operand has 207 places, 207 transitions, 438 flow. Second operand 3 states and 525 transitions. [2025-01-09 21:35:10,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 197 transitions, 502 flow [2025-01-09 21:35:10,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 197 transitions, 498 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:35:10,970 INFO L231 Difference]: Finished difference. Result has 195 places, 195 transitions, 432 flow [2025-01-09 21:35:10,971 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=432, PETRI_PLACES=195, PETRI_TRANSITIONS=195} [2025-01-09 21:35:10,972 INFO L279 CegarLoopForPetriNet]: 210 programPoint places, -15 predicate places. [2025-01-09 21:35:10,972 INFO L471 AbstractCegarLoop]: Abstraction has has 195 places, 195 transitions, 432 flow [2025-01-09 21:35:10,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:35:10,972 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:35:10,972 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] [2025-01-09 21:35:10,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:35:10,973 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-01-09 21:35:10,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:35:10,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1549694428, now seen corresponding path program 1 times [2025-01-09 21:35:10,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:35:10,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818345198] [2025-01-09 21:35:10,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:35:10,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:35:10,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 21:35:10,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 21:35:10,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:35:10,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:35:11,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:35:11,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:35:11,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818345198] [2025-01-09 21:35:11,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818345198] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:35:11,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:35:11,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:35:11,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313006223] [2025-01-09 21:35:11,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:35:11,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:35:11,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:35:11,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:35:11,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:35:11,119 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 218 [2025-01-09 21:35:11,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 195 transitions, 432 flow. Second operand has 3 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:35:11,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:35:11,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 218 [2025-01-09 21:35:11,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:35:11,173 INFO L124 PetriNetUnfolderBase]: 27/511 cut-off events. [2025-01-09 21:35:11,174 INFO L125 PetriNetUnfolderBase]: For 32/36 co-relation queries the response was YES. [2025-01-09 21:35:11,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 640 conditions, 511 events. 27/511 cut-off events. For 32/36 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1597 event pairs, 10 based on Foata normal form. 6/465 useless extension candidates. Maximal degree in co-relation 443. Up to 39 conditions per place. [2025-01-09 21:35:11,178 INFO L140 encePairwiseOnDemand]: 206/218 looper letters, 17 selfloop transitions, 8 changer transitions 9/200 dead transitions. [2025-01-09 21:35:11,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 200 transitions, 500 flow [2025-01-09 21:35:11,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:35:11,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:35:11,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 594 transitions. [2025-01-09 21:35:11,180 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.908256880733945 [2025-01-09 21:35:11,180 INFO L175 Difference]: Start difference. First operand has 195 places, 195 transitions, 432 flow. Second operand 3 states and 594 transitions. [2025-01-09 21:35:11,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 200 transitions, 500 flow [2025-01-09 21:35:11,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 200 transitions, 478 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:35:11,186 INFO L231 Difference]: Finished difference. Result has 196 places, 187 transitions, 426 flow [2025-01-09 21:35:11,186 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=426, PETRI_PLACES=196, PETRI_TRANSITIONS=187} [2025-01-09 21:35:11,187 INFO L279 CegarLoopForPetriNet]: 210 programPoint places, -14 predicate places. [2025-01-09 21:35:11,187 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 187 transitions, 426 flow [2025-01-09 21:35:11,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:35:11,188 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:35:11,188 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] [2025-01-09 21:35:11,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:35:11,188 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-01-09 21:35:11,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:35:11,188 INFO L85 PathProgramCache]: Analyzing trace with hash -651940007, now seen corresponding path program 1 times [2025-01-09 21:35:11,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:35:11,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107792390] [2025-01-09 21:35:11,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:35:11,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:35:11,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 21:35:11,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 21:35:11,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:35:11,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:35:11,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:35:11,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:35:11,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107792390] [2025-01-09 21:35:11,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107792390] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:35:11,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:35:11,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:35:11,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44068725] [2025-01-09 21:35:11,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:35:11,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:35:11,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:35:11,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:35:11,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:35:11,720 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 218 [2025-01-09 21:35:11,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 187 transitions, 426 flow. Second operand has 6 states, 6 states have (on average 169.66666666666666) internal successors, (1018), 6 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:35:11,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:35:11,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 218 [2025-01-09 21:35:11,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:35:11,804 INFO L124 PetriNetUnfolderBase]: 83/734 cut-off events. [2025-01-09 21:35:11,804 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-01-09 21:35:11,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1027 conditions, 734 events. 83/734 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2906 event pairs, 5 based on Foata normal form. 0/674 useless extension candidates. Maximal degree in co-relation 815. Up to 193 conditions per place. [2025-01-09 21:35:11,808 INFO L140 encePairwiseOnDemand]: 212/218 looper letters, 42 selfloop transitions, 5 changer transitions 0/194 dead transitions. [2025-01-09 21:35:11,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 194 transitions, 534 flow [2025-01-09 21:35:11,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:35:11,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:35:11,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1055 transitions. [2025-01-09 21:35:11,814 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8065749235474006 [2025-01-09 21:35:11,815 INFO L175 Difference]: Start difference. First operand has 196 places, 187 transitions, 426 flow. Second operand 6 states and 1055 transitions. [2025-01-09 21:35:11,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 194 transitions, 534 flow [2025-01-09 21:35:11,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 194 transitions, 526 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:35:11,818 INFO L231 Difference]: Finished difference. Result has 190 places, 186 transitions, 426 flow [2025-01-09 21:35:11,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=426, PETRI_PLACES=190, PETRI_TRANSITIONS=186} [2025-01-09 21:35:11,819 INFO L279 CegarLoopForPetriNet]: 210 programPoint places, -20 predicate places. [2025-01-09 21:35:11,819 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 186 transitions, 426 flow [2025-01-09 21:35:11,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 169.66666666666666) internal successors, (1018), 6 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:35:11,820 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:35:11,820 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:35:11,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:35:11,820 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-01-09 21:35:11,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:35:11,821 INFO L85 PathProgramCache]: Analyzing trace with hash 545615390, now seen corresponding path program 1 times [2025-01-09 21:35:11,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:35:11,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088196981] [2025-01-09 21:35:11,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:35:11,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:35:11,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 21:35:11,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 21:35:11,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:35:11,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:35:11,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:35:11,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:35:11,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088196981] [2025-01-09 21:35:11,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088196981] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:35:11,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:35:11,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:35:11,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089007966] [2025-01-09 21:35:11,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:35:11,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:35:11,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:35:11,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:35:11,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:35:11,927 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 218 [2025-01-09 21:35:11,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 186 transitions, 426 flow. Second operand has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:35:11,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:35:11,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 218 [2025-01-09 21:35:11,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:35:11,984 INFO L124 PetriNetUnfolderBase]: 63/716 cut-off events. [2025-01-09 21:35:11,985 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-01-09 21:35:11,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 950 conditions, 716 events. 63/716 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2858 event pairs, 49 based on Foata normal form. 0/650 useless extension candidates. Maximal degree in co-relation 749. Up to 151 conditions per place. [2025-01-09 21:35:11,988 INFO L140 encePairwiseOnDemand]: 215/218 looper letters, 32 selfloop transitions, 2 changer transitions 0/187 dead transitions. [2025-01-09 21:35:11,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 187 transitions, 496 flow [2025-01-09 21:35:11,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:35:11,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:35:11,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 560 transitions. [2025-01-09 21:35:11,989 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8562691131498471 [2025-01-09 21:35:11,989 INFO L175 Difference]: Start difference. First operand has 190 places, 186 transitions, 426 flow. Second operand 3 states and 560 transitions. [2025-01-09 21:35:11,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 187 transitions, 496 flow [2025-01-09 21:35:11,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 187 transitions, 486 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:35:11,993 INFO L231 Difference]: Finished difference. Result has 186 places, 185 transitions, 418 flow [2025-01-09 21:35:11,993 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=418, PETRI_PLACES=186, PETRI_TRANSITIONS=185} [2025-01-09 21:35:11,994 INFO L279 CegarLoopForPetriNet]: 210 programPoint places, -24 predicate places. [2025-01-09 21:35:11,994 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 185 transitions, 418 flow [2025-01-09 21:35:11,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:35:11,994 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:35:11,994 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] [2025-01-09 21:35:11,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:35:11,994 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-01-09 21:35:11,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:35:11,995 INFO L85 PathProgramCache]: Analyzing trace with hash 948260326, now seen corresponding path program 1 times [2025-01-09 21:35:11,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:35:11,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71606140] [2025-01-09 21:35:11,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:35:11,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:35:12,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 21:35:12,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 21:35:12,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:35:12,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:35:12,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-01-09 21:35:12,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:35:12,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71606140] [2025-01-09 21:35:12,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71606140] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:35:12,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:35:12,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:35:12,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798195805] [2025-01-09 21:35:12,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:35:12,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:35:12,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:35:12,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:35:12,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:35:12,185 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 218 [2025-01-09 21:35:12,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 185 transitions, 418 flow. Second operand has 5 states, 5 states have (on average 183.8) internal successors, (919), 5 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:35:12,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:35:12,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 218 [2025-01-09 21:35:12,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:35:12,214 INFO L124 PetriNetUnfolderBase]: 6/115 cut-off events. [2025-01-09 21:35:12,214 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-09 21:35:12,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 115 events. 6/115 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 152 event pairs, 0 based on Foata normal form. 3/118 useless extension candidates. Maximal degree in co-relation 148. Up to 6 conditions per place. [2025-01-09 21:35:12,214 INFO L140 encePairwiseOnDemand]: 213/218 looper letters, 11 selfloop transitions, 4 changer transitions 0/57 dead transitions. [2025-01-09 21:35:12,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 57 transitions, 156 flow [2025-01-09 21:35:12,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:35:12,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:35:12,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1108 transitions. [2025-01-09 21:35:12,216 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8470948012232415 [2025-01-09 21:35:12,216 INFO L175 Difference]: Start difference. First operand has 186 places, 185 transitions, 418 flow. Second operand 6 states and 1108 transitions. [2025-01-09 21:35:12,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 57 transitions, 156 flow [2025-01-09 21:35:12,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 57 transitions, 148 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 21:35:12,217 INFO L231 Difference]: Finished difference. Result has 60 places, 51 transitions, 114 flow [2025-01-09 21:35:12,217 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=114, PETRI_PLACES=60, PETRI_TRANSITIONS=51} [2025-01-09 21:35:12,218 INFO L279 CegarLoopForPetriNet]: 210 programPoint places, -150 predicate places. [2025-01-09 21:35:12,218 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 51 transitions, 114 flow [2025-01-09 21:35:12,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 183.8) internal successors, (919), 5 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:35:12,218 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:35:12,219 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 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] [2025-01-09 21:35:12,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:35:12,219 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-01-09 21:35:12,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:35:12,219 INFO L85 PathProgramCache]: Analyzing trace with hash 702344219, now seen corresponding path program 1 times [2025-01-09 21:35:12,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:35:12,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201187124] [2025-01-09 21:35:12,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:35:12,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:35:12,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 21:35:12,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 21:35:12,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:35:12,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:35:12,234 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:35:12,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 21:35:12,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 21:35:12,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:35:12,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:35:12,256 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:35:12,256 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:35:12,257 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 38 remaining) [2025-01-09 21:35:12,258 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (36 of 38 remaining) [2025-01-09 21:35:12,258 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (35 of 38 remaining) [2025-01-09 21:35:12,258 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (34 of 38 remaining) [2025-01-09 21:35:12,258 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (33 of 38 remaining) [2025-01-09 21:35:12,258 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (32 of 38 remaining) [2025-01-09 21:35:12,258 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr3ASSERT_VIOLATIONDATA_RACE (31 of 38 remaining) [2025-01-09 21:35:12,258 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (30 of 38 remaining) [2025-01-09 21:35:12,258 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (29 of 38 remaining) [2025-01-09 21:35:12,258 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (28 of 38 remaining) [2025-01-09 21:35:12,258 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (27 of 38 remaining) [2025-01-09 21:35:12,258 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (26 of 38 remaining) [2025-01-09 21:35:12,258 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (25 of 38 remaining) [2025-01-09 21:35:12,259 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (24 of 38 remaining) [2025-01-09 21:35:12,259 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (23 of 38 remaining) [2025-01-09 21:35:12,259 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (22 of 38 remaining) [2025-01-09 21:35:12,259 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (21 of 38 remaining) [2025-01-09 21:35:12,259 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (20 of 38 remaining) [2025-01-09 21:35:12,259 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (19 of 38 remaining) [2025-01-09 21:35:12,259 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (18 of 38 remaining) [2025-01-09 21:35:12,259 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (17 of 38 remaining) [2025-01-09 21:35:12,259 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (16 of 38 remaining) [2025-01-09 21:35:12,259 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (15 of 38 remaining) [2025-01-09 21:35:12,259 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (14 of 38 remaining) [2025-01-09 21:35:12,259 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (13 of 38 remaining) [2025-01-09 21:35:12,259 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (12 of 38 remaining) [2025-01-09 21:35:12,259 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (11 of 38 remaining) [2025-01-09 21:35:12,259 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (10 of 38 remaining) [2025-01-09 21:35:12,259 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (9 of 38 remaining) [2025-01-09 21:35:12,259 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (8 of 38 remaining) [2025-01-09 21:35:12,259 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (7 of 38 remaining) [2025-01-09 21:35:12,259 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 38 remaining) [2025-01-09 21:35:12,259 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (5 of 38 remaining) [2025-01-09 21:35:12,259 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (4 of 38 remaining) [2025-01-09 21:35:12,259 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (3 of 38 remaining) [2025-01-09 21:35:12,259 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (2 of 38 remaining) [2025-01-09 21:35:12,259 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (1 of 38 remaining) [2025-01-09 21:35:12,259 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr3ASSERT_VIOLATIONDATA_RACE (0 of 38 remaining) [2025-01-09 21:35:12,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:35:12,260 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:35:12,261 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:35:12,261 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 21:35:12,291 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-01-09 21:35:12,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 259 places, 272 transitions, 588 flow [2025-01-09 21:35:12,428 INFO L124 PetriNetUnfolderBase]: 131/1812 cut-off events. [2025-01-09 21:35:12,428 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-01-09 21:35:12,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1901 conditions, 1812 events. 131/1812 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 10479 event pairs, 2 based on Foata normal form. 0/1429 useless extension candidates. Maximal degree in co-relation 1028. Up to 32 conditions per place. [2025-01-09 21:35:12,437 INFO L82 GeneralOperation]: Start removeDead. Operand has 259 places, 272 transitions, 588 flow [2025-01-09 21:35:12,447 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 259 places, 272 transitions, 588 flow [2025-01-09 21:35:12,447 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:35:12,448 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;@3f85ce68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:35:12,448 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2025-01-09 21:35:12,449 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:35:12,449 INFO L124 PetriNetUnfolderBase]: 0/19 cut-off events. [2025-01-09 21:35:12,449 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:35:12,449 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:35:12,449 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-01-09 21:35:12,449 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-01-09 21:35:12,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:35:12,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1475781217, now seen corresponding path program 1 times [2025-01-09 21:35:12,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:35:12,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134254820] [2025-01-09 21:35:12,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:35:12,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:35:12,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:35:12,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:35:12,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:35:12,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:35:12,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:35:12,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:35:12,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134254820] [2025-01-09 21:35:12,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134254820] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:35:12,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:35:12,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:35:12,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116581849] [2025-01-09 21:35:12,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:35:12,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:35:12,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:35:12,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:35:12,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:35:12,548 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 272 [2025-01-09 21:35:12,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 272 transitions, 588 flow. Second operand has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:35:12,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:35:12,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 272 [2025-01-09 21:35:12,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:35:13,357 INFO L124 PetriNetUnfolderBase]: 1200/7025 cut-off events. [2025-01-09 21:35:13,357 INFO L125 PetriNetUnfolderBase]: For 674/708 co-relation queries the response was YES. [2025-01-09 21:35:13,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9370 conditions, 7025 events. 1200/7025 cut-off events. For 674/708 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 62034 event pairs, 985 based on Foata normal form. 1614/7419 useless extension candidates. Maximal degree in co-relation 4757. Up to 2070 conditions per place. [2025-01-09 21:35:13,426 INFO L140 encePairwiseOnDemand]: 257/272 looper letters, 39 selfloop transitions, 2 changer transitions 0/255 dead transitions. [2025-01-09 21:35:13,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 255 transitions, 636 flow [2025-01-09 21:35:13,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:35:13,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:35:13,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 702 transitions. [2025-01-09 21:35:13,428 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8602941176470589 [2025-01-09 21:35:13,428 INFO L175 Difference]: Start difference. First operand has 259 places, 272 transitions, 588 flow. Second operand 3 states and 702 transitions. [2025-01-09 21:35:13,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 255 transitions, 636 flow [2025-01-09 21:35:13,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 255 transitions, 636 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:35:13,433 INFO L231 Difference]: Finished difference. Result has 252 places, 255 transitions, 558 flow [2025-01-09 21:35:13,434 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=558, PETRI_PLACES=252, PETRI_TRANSITIONS=255} [2025-01-09 21:35:13,435 INFO L279 CegarLoopForPetriNet]: 259 programPoint places, -7 predicate places. [2025-01-09 21:35:13,435 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 255 transitions, 558 flow [2025-01-09 21:35:13,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:35:13,435 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:35:13,435 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-01-09 21:35:13,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:35:13,436 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-01-09 21:35:13,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:35:13,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1712294371, now seen corresponding path program 1 times [2025-01-09 21:35:13,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:35:13,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966650505] [2025-01-09 21:35:13,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:35:13,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:35:13,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 21:35:13,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 21:35:13,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:35:13,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:35:13,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:35:13,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:35:13,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966650505] [2025-01-09 21:35:13,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966650505] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:35:13,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:35:13,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:35:13,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782654261] [2025-01-09 21:35:13,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:35:13,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:35:13,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:35:13,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:35:13,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:35:13,507 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 272 [2025-01-09 21:35:13,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 255 transitions, 558 flow. Second operand has 3 states, 3 states have (on average 199.0) internal successors, (597), 3 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:35:13,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:35:13,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 272 [2025-01-09 21:35:13,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:35:14,266 INFO L124 PetriNetUnfolderBase]: 1650/7399 cut-off events. [2025-01-09 21:35:14,267 INFO L125 PetriNetUnfolderBase]: For 671/689 co-relation queries the response was YES. [2025-01-09 21:35:14,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10619 conditions, 7399 events. 1650/7399 cut-off events. For 671/689 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 62476 event pairs, 1169 based on Foata normal form. 0/6614 useless extension candidates. Maximal degree in co-relation 10588. Up to 2412 conditions per place. [2025-01-09 21:35:14,330 INFO L140 encePairwiseOnDemand]: 249/272 looper letters, 41 selfloop transitions, 11 changer transitions 0/247 dead transitions. [2025-01-09 21:35:14,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 247 transitions, 646 flow [2025-01-09 21:35:14,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:35:14,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:35:14,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 658 transitions. [2025-01-09 21:35:14,332 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8063725490196079 [2025-01-09 21:35:14,332 INFO L175 Difference]: Start difference. First operand has 252 places, 255 transitions, 558 flow. Second operand 3 states and 658 transitions. [2025-01-09 21:35:14,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 247 transitions, 646 flow [2025-01-09 21:35:14,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 247 transitions, 642 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:35:14,338 INFO L231 Difference]: Finished difference. Result has 240 places, 243 transitions, 552 flow [2025-01-09 21:35:14,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=552, PETRI_PLACES=240, PETRI_TRANSITIONS=243} [2025-01-09 21:35:14,340 INFO L279 CegarLoopForPetriNet]: 259 programPoint places, -19 predicate places. [2025-01-09 21:35:14,341 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 243 transitions, 552 flow [2025-01-09 21:35:14,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.0) internal successors, (597), 3 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:35:14,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:35:14,341 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] [2025-01-09 21:35:14,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:35:14,341 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-01-09 21:35:14,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:35:14,342 INFO L85 PathProgramCache]: Analyzing trace with hash -802324900, now seen corresponding path program 1 times [2025-01-09 21:35:14,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:35:14,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006269331] [2025-01-09 21:35:14,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:35:14,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:35:14,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 21:35:14,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 21:35:14,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:35:14,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:35:14,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:35:14,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:35:14,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006269331] [2025-01-09 21:35:14,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006269331] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:35:14,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:35:14,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:35:14,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33175863] [2025-01-09 21:35:14,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:35:14,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:35:14,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:35:14,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:35:14,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:35:14,437 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 272 [2025-01-09 21:35:14,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 243 transitions, 552 flow. Second operand has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:35:14,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:35:14,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 272 [2025-01-09 21:35:14,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:35:15,048 INFO L124 PetriNetUnfolderBase]: 630/4819 cut-off events. [2025-01-09 21:35:15,049 INFO L125 PetriNetUnfolderBase]: For 775/817 co-relation queries the response was YES. [2025-01-09 21:35:15,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6501 conditions, 4819 events. 630/4819 cut-off events. For 775/817 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 40348 event pairs, 228 based on Foata normal form. 42/4347 useless extension candidates. Maximal degree in co-relation 4159. Up to 682 conditions per place. [2025-01-09 21:35:15,074 INFO L140 encePairwiseOnDemand]: 260/272 looper letters, 37 selfloop transitions, 8 changer transitions 0/259 dead transitions. [2025-01-09 21:35:15,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 259 transitions, 698 flow [2025-01-09 21:35:15,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:35:15,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:35:15,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 736 transitions. [2025-01-09 21:35:15,076 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9019607843137255 [2025-01-09 21:35:15,076 INFO L175 Difference]: Start difference. First operand has 240 places, 243 transitions, 552 flow. Second operand 3 states and 736 transitions. [2025-01-09 21:35:15,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 259 transitions, 698 flow [2025-01-09 21:35:15,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 259 transitions, 676 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:35:15,082 INFO L231 Difference]: Finished difference. Result has 241 places, 247 transitions, 578 flow [2025-01-09 21:35:15,082 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=578, PETRI_PLACES=241, PETRI_TRANSITIONS=247} [2025-01-09 21:35:15,083 INFO L279 CegarLoopForPetriNet]: 259 programPoint places, -18 predicate places. [2025-01-09 21:35:15,083 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 247 transitions, 578 flow [2025-01-09 21:35:15,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:35:15,083 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:35:15,083 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] [2025-01-09 21:35:15,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:35:15,083 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-01-09 21:35:15,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:35:15,085 INFO L85 PathProgramCache]: Analyzing trace with hash -279106905, now seen corresponding path program 1 times [2025-01-09 21:35:15,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:35:15,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668713488] [2025-01-09 21:35:15,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:35:15,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:35:15,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 21:35:15,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 21:35:15,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:35:15,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:35:15,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:35:15,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:35:15,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668713488] [2025-01-09 21:35:15,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668713488] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:35:15,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:35:15,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:35:15,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095225812] [2025-01-09 21:35:15,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:35:15,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:35:15,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:35:15,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:35:15,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:35:15,434 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 272 [2025-01-09 21:35:15,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 247 transitions, 578 flow. Second operand has 6 states, 6 states have (on average 210.66666666666666) internal successors, (1264), 6 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:35:15,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:35:15,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 272 [2025-01-09 21:35:15,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:35:16,140 INFO L124 PetriNetUnfolderBase]: 1558/7502 cut-off events. [2025-01-09 21:35:16,141 INFO L125 PetriNetUnfolderBase]: For 740/740 co-relation queries the response was YES. [2025-01-09 21:35:16,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11144 conditions, 7502 events. 1558/7502 cut-off events. For 740/740 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 63387 event pairs, 74 based on Foata normal form. 0/6970 useless extension candidates. Maximal degree in co-relation 5065. Up to 2728 conditions per place. [2025-01-09 21:35:16,198 INFO L140 encePairwiseOnDemand]: 266/272 looper letters, 62 selfloop transitions, 6 changer transitions 0/262 dead transitions. [2025-01-09 21:35:16,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 262 transitions, 744 flow [2025-01-09 21:35:16,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:35:16,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:35:16,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1319 transitions. [2025-01-09 21:35:16,201 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8082107843137255 [2025-01-09 21:35:16,201 INFO L175 Difference]: Start difference. First operand has 241 places, 247 transitions, 578 flow. Second operand 6 states and 1319 transitions. [2025-01-09 21:35:16,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 262 transitions, 744 flow [2025-01-09 21:35:16,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 262 transitions, 736 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:35:16,205 INFO L231 Difference]: Finished difference. Result has 244 places, 246 transitions, 580 flow [2025-01-09 21:35:16,206 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=580, PETRI_PLACES=244, PETRI_TRANSITIONS=246} [2025-01-09 21:35:16,206 INFO L279 CegarLoopForPetriNet]: 259 programPoint places, -15 predicate places. [2025-01-09 21:35:16,206 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 246 transitions, 580 flow [2025-01-09 21:35:16,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 210.66666666666666) internal successors, (1264), 6 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:35:16,207 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:35:16,207 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:35:16,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:35:16,207 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-01-09 21:35:16,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:35:16,208 INFO L85 PathProgramCache]: Analyzing trace with hash -588334821, now seen corresponding path program 1 times [2025-01-09 21:35:16,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:35:16,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421515465] [2025-01-09 21:35:16,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:35:16,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:35:16,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 21:35:16,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 21:35:16,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:35:16,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:35:16,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:35:16,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:35:16,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421515465] [2025-01-09 21:35:16,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421515465] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:35:16,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:35:16,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:35:16,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510943404] [2025-01-09 21:35:16,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:35:16,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:35:16,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:35:16,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:35:16,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:35:16,308 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 272 [2025-01-09 21:35:16,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 246 transitions, 580 flow. Second operand has 3 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:35:16,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:35:16,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 272 [2025-01-09 21:35:16,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:35:16,925 INFO L124 PetriNetUnfolderBase]: 1177/6971 cut-off events. [2025-01-09 21:35:16,925 INFO L125 PetriNetUnfolderBase]: For 750/750 co-relation queries the response was YES. [2025-01-09 21:35:16,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9778 conditions, 6971 events. 1177/6971 cut-off events. For 750/750 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 60409 event pairs, 990 based on Foata normal form. 0/6385 useless extension candidates. Maximal degree in co-relation 4376. Up to 2049 conditions per place. [2025-01-09 21:35:16,966 INFO L140 encePairwiseOnDemand]: 269/272 looper letters, 43 selfloop transitions, 2 changer transitions 0/249 dead transitions. [2025-01-09 21:35:16,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 249 transitions, 676 flow [2025-01-09 21:35:16,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:35:16,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:35:16,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 694 transitions. [2025-01-09 21:35:16,969 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8504901960784313 [2025-01-09 21:35:16,969 INFO L175 Difference]: Start difference. First operand has 244 places, 246 transitions, 580 flow. Second operand 3 states and 694 transitions. [2025-01-09 21:35:16,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 249 transitions, 676 flow [2025-01-09 21:35:16,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 249 transitions, 664 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:35:16,972 INFO L231 Difference]: Finished difference. Result has 240 places, 245 transitions, 570 flow [2025-01-09 21:35:16,973 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=570, PETRI_PLACES=240, PETRI_TRANSITIONS=245} [2025-01-09 21:35:16,973 INFO L279 CegarLoopForPetriNet]: 259 programPoint places, -19 predicate places. [2025-01-09 21:35:16,973 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 245 transitions, 570 flow [2025-01-09 21:35:16,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:35:16,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:35:16,974 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] [2025-01-09 21:35:16,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:35:16,974 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-01-09 21:35:16,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:35:16,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1608971881, now seen corresponding path program 1 times [2025-01-09 21:35:16,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:35:16,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247797765] [2025-01-09 21:35:16,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:35:16,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:35:16,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 21:35:16,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 21:35:16,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:35:16,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:35:17,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:35:17,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:35:17,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247797765] [2025-01-09 21:35:17,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247797765] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:35:17,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:35:17,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:35:17,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594594448] [2025-01-09 21:35:17,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:35:17,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:35:17,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:35:17,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:35:17,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:35:17,183 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 272 [2025-01-09 21:35:17,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 245 transitions, 570 flow. Second operand has 5 states, 5 states have (on average 224.8) internal successors, (1124), 5 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:35:17,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:35:17,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 272 [2025-01-09 21:35:17,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:35:17,827 INFO L124 PetriNetUnfolderBase]: 765/5184 cut-off events. [2025-01-09 21:35:17,827 INFO L125 PetriNetUnfolderBase]: For 986/1024 co-relation queries the response was YES. [2025-01-09 21:35:17,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7170 conditions, 5184 events. 765/5184 cut-off events. For 986/1024 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 43308 event pairs, 156 based on Foata normal form. 3/4680 useless extension candidates. Maximal degree in co-relation 5120. Up to 647 conditions per place. [2025-01-09 21:35:17,874 INFO L140 encePairwiseOnDemand]: 259/272 looper letters, 48 selfloop transitions, 15 changer transitions 0/269 dead transitions. [2025-01-09 21:35:17,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 269 transitions, 768 flow [2025-01-09 21:35:17,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:35:17,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:35:17,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1402 transitions. [2025-01-09 21:35:17,877 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8590686274509803 [2025-01-09 21:35:17,877 INFO L175 Difference]: Start difference. First operand has 240 places, 245 transitions, 570 flow. Second operand 6 states and 1402 transitions. [2025-01-09 21:35:17,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 269 transitions, 768 flow [2025-01-09 21:35:17,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 269 transitions, 764 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:35:17,882 INFO L231 Difference]: Finished difference. Result has 247 places, 249 transitions, 642 flow [2025-01-09 21:35:17,882 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=642, PETRI_PLACES=247, PETRI_TRANSITIONS=249} [2025-01-09 21:35:17,883 INFO L279 CegarLoopForPetriNet]: 259 programPoint places, -12 predicate places. [2025-01-09 21:35:17,883 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 249 transitions, 642 flow [2025-01-09 21:35:17,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 224.8) internal successors, (1124), 5 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:35:17,883 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:35:17,884 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 21:35:17,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:35:17,884 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-01-09 21:35:17,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:35:17,884 INFO L85 PathProgramCache]: Analyzing trace with hash 547303891, now seen corresponding path program 1 times [2025-01-09 21:35:17,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:35:17,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900936253] [2025-01-09 21:35:17,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:35:17,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:35:17,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 21:35:17,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 21:35:17,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:35:17,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:35:17,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:35:17,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:35:17,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900936253] [2025-01-09 21:35:17,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900936253] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:35:17,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:35:17,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:35:17,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993972950] [2025-01-09 21:35:17,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:35:17,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:35:17,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:35:17,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:35:17,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:35:18,001 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 272 [2025-01-09 21:35:18,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 249 transitions, 642 flow. Second operand has 3 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:35:18,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:35:18,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 272 [2025-01-09 21:35:18,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:35:18,805 INFO L124 PetriNetUnfolderBase]: 1105/6399 cut-off events. [2025-01-09 21:35:18,805 INFO L125 PetriNetUnfolderBase]: For 1132/1132 co-relation queries the response was YES. [2025-01-09 21:35:18,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9502 conditions, 6399 events. 1105/6399 cut-off events. For 1132/1132 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 54296 event pairs, 944 based on Foata normal form. 0/5865 useless extension candidates. Maximal degree in co-relation 5254. Up to 1922 conditions per place. [2025-01-09 21:35:18,841 INFO L140 encePairwiseOnDemand]: 269/272 looper letters, 43 selfloop transitions, 2 changer transitions 0/252 dead transitions. [2025-01-09 21:35:18,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 252 transitions, 738 flow [2025-01-09 21:35:18,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:35:18,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:35:18,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 694 transitions. [2025-01-09 21:35:18,842 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8504901960784313 [2025-01-09 21:35:18,842 INFO L175 Difference]: Start difference. First operand has 247 places, 249 transitions, 642 flow. Second operand 3 states and 694 transitions. [2025-01-09 21:35:18,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 252 transitions, 738 flow [2025-01-09 21:35:18,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 252 transitions, 724 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-01-09 21:35:18,847 INFO L231 Difference]: Finished difference. Result has 247 places, 248 transitions, 630 flow [2025-01-09 21:35:18,848 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=626, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=630, PETRI_PLACES=247, PETRI_TRANSITIONS=248} [2025-01-09 21:35:18,848 INFO L279 CegarLoopForPetriNet]: 259 programPoint places, -12 predicate places. [2025-01-09 21:35:18,848 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 248 transitions, 630 flow [2025-01-09 21:35:18,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:35:18,849 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:35:18,849 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-09 21:35:18,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:35:18,849 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-01-09 21:35:18,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:35:18,850 INFO L85 PathProgramCache]: Analyzing trace with hash 287734329, now seen corresponding path program 1 times [2025-01-09 21:35:18,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:35:18,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555145149] [2025-01-09 21:35:18,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:35:18,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:35:18,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 21:35:18,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 21:35:18,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:35:18,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:35:18,865 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:35:18,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 21:35:18,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 21:35:18,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:35:18,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:35:18,886 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:35:18,886 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:35:18,886 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (43 of 44 remaining) [2025-01-09 21:35:18,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (42 of 44 remaining) [2025-01-09 21:35:18,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (41 of 44 remaining) [2025-01-09 21:35:18,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (40 of 44 remaining) [2025-01-09 21:35:18,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (39 of 44 remaining) [2025-01-09 21:35:18,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (38 of 44 remaining) [2025-01-09 21:35:18,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr3ASSERT_VIOLATIONDATA_RACE (37 of 44 remaining) [2025-01-09 21:35:18,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (36 of 44 remaining) [2025-01-09 21:35:18,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (35 of 44 remaining) [2025-01-09 21:35:18,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (34 of 44 remaining) [2025-01-09 21:35:18,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (33 of 44 remaining) [2025-01-09 21:35:18,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (32 of 44 remaining) [2025-01-09 21:35:18,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (31 of 44 remaining) [2025-01-09 21:35:18,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (30 of 44 remaining) [2025-01-09 21:35:18,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (29 of 44 remaining) [2025-01-09 21:35:18,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (28 of 44 remaining) [2025-01-09 21:35:18,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (27 of 44 remaining) [2025-01-09 21:35:18,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (26 of 44 remaining) [2025-01-09 21:35:18,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (25 of 44 remaining) [2025-01-09 21:35:18,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (24 of 44 remaining) [2025-01-09 21:35:18,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (23 of 44 remaining) [2025-01-09 21:35:18,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (22 of 44 remaining) [2025-01-09 21:35:18,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (21 of 44 remaining) [2025-01-09 21:35:18,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (20 of 44 remaining) [2025-01-09 21:35:18,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (19 of 44 remaining) [2025-01-09 21:35:18,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (18 of 44 remaining) [2025-01-09 21:35:18,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (17 of 44 remaining) [2025-01-09 21:35:18,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (16 of 44 remaining) [2025-01-09 21:35:18,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (15 of 44 remaining) [2025-01-09 21:35:18,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (14 of 44 remaining) [2025-01-09 21:35:18,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (13 of 44 remaining) [2025-01-09 21:35:18,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 44 remaining) [2025-01-09 21:35:18,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (11 of 44 remaining) [2025-01-09 21:35:18,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (10 of 44 remaining) [2025-01-09 21:35:18,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (9 of 44 remaining) [2025-01-09 21:35:18,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (8 of 44 remaining) [2025-01-09 21:35:18,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (7 of 44 remaining) [2025-01-09 21:35:18,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (6 of 44 remaining) [2025-01-09 21:35:18,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (5 of 44 remaining) [2025-01-09 21:35:18,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr3ASSERT_VIOLATIONDATA_RACE (4 of 44 remaining) [2025-01-09 21:35:18,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (3 of 44 remaining) [2025-01-09 21:35:18,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (2 of 44 remaining) [2025-01-09 21:35:18,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (1 of 44 remaining) [2025-01-09 21:35:18,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr3ASSERT_VIOLATIONDATA_RACE (0 of 44 remaining) [2025-01-09 21:35:18,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:35:18,889 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:35:18,890 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:35:18,890 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-09 21:35:18,912 INFO L143 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2025-01-09 21:35:18,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 308 places, 326 transitions, 724 flow [2025-01-09 21:35:19,419 INFO L124 PetriNetUnfolderBase]: 544/5934 cut-off events. [2025-01-09 21:35:19,419 INFO L125 PetriNetUnfolderBase]: For 419/419 co-relation queries the response was YES. [2025-01-09 21:35:19,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6370 conditions, 5934 events. 544/5934 cut-off events. For 419/419 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 46616 event pairs, 64 based on Foata normal form. 0/4713 useless extension candidates. Maximal degree in co-relation 3413. Up to 192 conditions per place. [2025-01-09 21:35:19,474 INFO L82 GeneralOperation]: Start removeDead. Operand has 308 places, 326 transitions, 724 flow [2025-01-09 21:35:19,512 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 308 places, 326 transitions, 724 flow [2025-01-09 21:35:19,513 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:35:19,513 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;@3f85ce68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:35:19,513 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-01-09 21:35:19,514 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:35:19,514 INFO L124 PetriNetUnfolderBase]: 0/19 cut-off events. [2025-01-09 21:35:19,514 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:35:19,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:35:19,514 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-01-09 21:35:19,514 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:35:19,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:35:19,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1770171745, now seen corresponding path program 1 times [2025-01-09 21:35:19,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:35:19,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117542893] [2025-01-09 21:35:19,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:35:19,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:35:19,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:35:19,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:35:19,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:35:19,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:35:19,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:35:19,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:35:19,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117542893] [2025-01-09 21:35:19,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117542893] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:35:19,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:35:19,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:35:19,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835867090] [2025-01-09 21:35:19,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:35:19,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:35:19,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:35:19,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:35:19,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:35:19,593 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 326 [2025-01-09 21:35:19,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 326 transitions, 724 flow. Second operand has 3 states, 3 states have (on average 258.3333333333333) internal successors, (775), 3 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:35:19,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:35:19,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 326 [2025-01-09 21:35:19,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:35:26,447 INFO L124 PetriNetUnfolderBase]: 12815/49237 cut-off events. [2025-01-09 21:35:26,447 INFO L125 PetriNetUnfolderBase]: For 7844/8390 co-relation queries the response was YES. [2025-01-09 21:35:26,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71260 conditions, 49237 events. 12815/49237 cut-off events. For 7844/8390 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 571368 event pairs, 10886 based on Foata normal form. 19499/60610 useless extension candidates. Maximal degree in co-relation 36872. Up to 19303 conditions per place. [2025-01-09 21:35:27,214 INFO L140 encePairwiseOnDemand]: 307/326 looper letters, 47 selfloop transitions, 2 changer transitions 0/303 dead transitions. [2025-01-09 21:35:27,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 303 transitions, 776 flow [2025-01-09 21:35:27,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:35:27,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:35:27,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 837 transitions. [2025-01-09 21:35:27,216 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8558282208588958 [2025-01-09 21:35:27,216 INFO L175 Difference]: Start difference. First operand has 308 places, 326 transitions, 724 flow. Second operand 3 states and 837 transitions. [2025-01-09 21:35:27,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 303 transitions, 776 flow [2025-01-09 21:35:27,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 303 transitions, 776 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:35:27,227 INFO L231 Difference]: Finished difference. Result has 297 places, 303 transitions, 682 flow [2025-01-09 21:35:27,227 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=682, PETRI_PLACES=297, PETRI_TRANSITIONS=303} [2025-01-09 21:35:27,227 INFO L279 CegarLoopForPetriNet]: 308 programPoint places, -11 predicate places. [2025-01-09 21:35:27,228 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 303 transitions, 682 flow [2025-01-09 21:35:27,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 258.3333333333333) internal successors, (775), 3 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:35:27,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:35:27,228 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-01-09 21:35:27,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:35:27,228 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:35:27,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:35:27,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1576973855, now seen corresponding path program 1 times [2025-01-09 21:35:27,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:35:27,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997910239] [2025-01-09 21:35:27,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:35:27,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:35:27,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 21:35:27,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 21:35:27,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:35:27,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:35:27,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:35:27,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:35:27,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997910239] [2025-01-09 21:35:27,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997910239] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:35:27,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:35:27,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:35:27,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409184261] [2025-01-09 21:35:27,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:35:27,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:35:27,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:35:27,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:35:27,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:35:27,305 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 239 out of 326 [2025-01-09 21:35:27,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 303 transitions, 682 flow. Second operand has 3 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:35:27,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:35:27,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 239 of 326 [2025-01-09 21:35:27,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:35:35,195 INFO L124 PetriNetUnfolderBase]: 17515/54756 cut-off events. [2025-01-09 21:35:35,195 INFO L125 PetriNetUnfolderBase]: For 7467/7915 co-relation queries the response was YES. [2025-01-09 21:35:35,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84323 conditions, 54756 events. 17515/54756 cut-off events. For 7467/7915 co-relation queries the response was YES. Maximal size of possible extension queue 488. Compared 594245 event pairs, 12762 based on Foata normal form. 0/49547 useless extension candidates. Maximal degree in co-relation 84290. Up to 22195 conditions per place. [2025-01-09 21:35:35,975 INFO L140 encePairwiseOnDemand]: 303/326 looper letters, 51 selfloop transitions, 11 changer transitions 0/297 dead transitions. [2025-01-09 21:35:35,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 297 transitions, 794 flow [2025-01-09 21:35:35,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:35:35,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:35:35,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 791 transitions. [2025-01-09 21:35:35,977 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8087934560327198 [2025-01-09 21:35:35,977 INFO L175 Difference]: Start difference. First operand has 297 places, 303 transitions, 682 flow. Second operand 3 states and 791 transitions. [2025-01-09 21:35:35,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 297 transitions, 794 flow [2025-01-09 21:35:35,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 297 transitions, 790 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:35:35,991 INFO L231 Difference]: Finished difference. Result has 285 places, 291 transitions, 676 flow [2025-01-09 21:35:35,992 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=676, PETRI_PLACES=285, PETRI_TRANSITIONS=291} [2025-01-09 21:35:35,992 INFO L279 CegarLoopForPetriNet]: 308 programPoint places, -23 predicate places. [2025-01-09 21:35:35,992 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 291 transitions, 676 flow [2025-01-09 21:35:35,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:35:35,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:35:35,993 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] [2025-01-09 21:35:35,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:35:35,993 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:35:35,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:35:35,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1047767716, now seen corresponding path program 1 times [2025-01-09 21:35:35,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:35:35,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041372269] [2025-01-09 21:35:35,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:35:35,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:35:35,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 21:35:35,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 21:35:35,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:35:35,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:35:36,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:35:36,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:35:36,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041372269] [2025-01-09 21:35:36,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041372269] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:35:36,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:35:36,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:35:36,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408619105] [2025-01-09 21:35:36,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:35:36,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:35:36,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:35:36,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:35:36,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:35:36,072 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 326 [2025-01-09 21:35:36,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 291 transitions, 676 flow. Second operand has 3 states, 3 states have (on average 271.3333333333333) internal successors, (814), 3 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:35:36,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:35:36,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 326 [2025-01-09 21:35:36,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:35:41,191 INFO L124 PetriNetUnfolderBase]: 8365/37765 cut-off events. [2025-01-09 21:35:41,191 INFO L125 PetriNetUnfolderBase]: For 9868/10422 co-relation queries the response was YES. [2025-01-09 21:35:41,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55596 conditions, 37765 events. 8365/37765 cut-off events. For 9868/10422 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 458745 event pairs, 3344 based on Foata normal form. 300/33766 useless extension candidates. Maximal degree in co-relation 37121. Up to 8245 conditions per place. [2025-01-09 21:35:41,754 INFO L140 encePairwiseOnDemand]: 314/326 looper letters, 51 selfloop transitions, 8 changer transitions 0/313 dead transitions. [2025-01-09 21:35:41,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 313 transitions, 874 flow [2025-01-09 21:35:41,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:35:41,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:35:41,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 873 transitions. [2025-01-09 21:35:41,756 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8926380368098159 [2025-01-09 21:35:41,756 INFO L175 Difference]: Start difference. First operand has 285 places, 291 transitions, 676 flow. Second operand 3 states and 873 transitions. [2025-01-09 21:35:41,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 313 transitions, 874 flow [2025-01-09 21:35:41,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 313 transitions, 852 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:35:41,768 INFO L231 Difference]: Finished difference. Result has 286 places, 295 transitions, 702 flow [2025-01-09 21:35:41,768 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=702, PETRI_PLACES=286, PETRI_TRANSITIONS=295} [2025-01-09 21:35:41,769 INFO L279 CegarLoopForPetriNet]: 308 programPoint places, -22 predicate places. [2025-01-09 21:35:41,769 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 295 transitions, 702 flow [2025-01-09 21:35:41,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 271.3333333333333) internal successors, (814), 3 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:35:41,769 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:35:41,769 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] [2025-01-09 21:35:41,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:35:41,769 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:35:41,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:35:41,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1549694101, now seen corresponding path program 1 times [2025-01-09 21:35:41,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:35:41,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186994797] [2025-01-09 21:35:41,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:35:41,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:35:41,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 21:35:41,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 21:35:41,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:35:41,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:35:41,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:35:41,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:35:41,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186994797] [2025-01-09 21:35:41,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186994797] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:35:41,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:35:41,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:35:41,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405571932] [2025-01-09 21:35:41,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:35:41,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:35:41,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:35:41,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:35:41,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:35:42,060 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 326 [2025-01-09 21:35:42,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 295 transitions, 702 flow. Second operand has 6 states, 6 states have (on average 251.66666666666666) internal successors, (1510), 6 states have internal predecessors, (1510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:35:42,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:35:42,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 326 [2025-01-09 21:35:42,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:35:51,955 INFO L124 PetriNetUnfolderBase]: 19159/64405 cut-off events. [2025-01-09 21:35:51,956 INFO L125 PetriNetUnfolderBase]: For 9276/9276 co-relation queries the response was YES. [2025-01-09 21:35:52,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101733 conditions, 64405 events. 19159/64405 cut-off events. For 9276/9276 co-relation queries the response was YES. Maximal size of possible extension queue 717. Compared 749483 event pairs, 801 based on Foata normal form. 0/60779 useless extension candidates. Maximal degree in co-relation 49665. Up to 29355 conditions per place. [2025-01-09 21:35:52,910 INFO L140 encePairwiseOnDemand]: 320/326 looper letters, 78 selfloop transitions, 6 changer transitions 0/318 dead transitions. [2025-01-09 21:35:52,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 318 transitions, 916 flow [2025-01-09 21:35:52,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:35:52,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:35:52,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1581 transitions. [2025-01-09 21:35:52,913 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.808282208588957 [2025-01-09 21:35:52,913 INFO L175 Difference]: Start difference. First operand has 286 places, 295 transitions, 702 flow. Second operand 6 states and 1581 transitions. [2025-01-09 21:35:52,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 318 transitions, 916 flow [2025-01-09 21:35:52,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 318 transitions, 908 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:35:52,922 INFO L231 Difference]: Finished difference. Result has 289 places, 294 transitions, 704 flow [2025-01-09 21:35:52,923 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=704, PETRI_PLACES=289, PETRI_TRANSITIONS=294} [2025-01-09 21:35:52,923 INFO L279 CegarLoopForPetriNet]: 308 programPoint places, -19 predicate places. [2025-01-09 21:35:52,924 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 294 transitions, 704 flow [2025-01-09 21:35:52,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 251.66666666666666) internal successors, (1510), 6 states have internal predecessors, (1510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:35:52,924 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:35:52,924 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:35:52,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:35:52,924 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:35:52,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:35:52,925 INFO L85 PathProgramCache]: Analyzing trace with hash -989753714, now seen corresponding path program 1 times [2025-01-09 21:35:52,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:35:52,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350434687] [2025-01-09 21:35:52,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:35:52,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:35:52,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 21:35:52,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 21:35:52,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:35:52,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:35:52,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:35:52,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:35:52,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350434687] [2025-01-09 21:35:52,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350434687] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:35:52,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:35:52,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:35:52,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640818221] [2025-01-09 21:35:52,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:35:52,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:35:52,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:35:52,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:35:52,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:35:53,002 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 326 [2025-01-09 21:35:53,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 294 transitions, 704 flow. Second operand has 3 states, 3 states have (on average 260.0) internal successors, (780), 3 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:35:53,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:35:53,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 326 [2025-01-09 21:35:53,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand