./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/parallel-parallel-sum-2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc 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/weaver/parallel-parallel-sum-2.wvr.c -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 aee5edffc06a346ddce4a9cfa75b4213bee8ccd3009aa5307dc09037d26d7f28 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:30:38,966 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:30:39,015 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:30:39,021 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:30:39,021 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:30:39,044 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:30:39,044 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:30:39,045 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:30:39,046 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:30:39,046 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:30:39,047 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:30:39,047 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:30:39,047 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:30:39,047 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:30:39,047 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:30:39,047 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:30:39,047 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:30:39,048 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:30:39,048 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:30:39,048 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:30:39,048 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:30:39,048 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:30:39,048 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:30:39,048 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:30:39,048 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:30:39,048 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:30:39,048 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:30:39,048 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:30:39,048 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:30:39,048 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:30:39,048 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:30:39,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:30:39,048 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:30:39,049 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:30:39,049 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:30:39,049 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:30:39,049 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:30:39,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:30:39,049 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:30:39,049 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:30:39,049 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:30:39,049 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:30:39,049 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 -> aee5edffc06a346ddce4a9cfa75b4213bee8ccd3009aa5307dc09037d26d7f28 [2025-02-06 09:30:39,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:30:39,284 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:30:39,286 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:30:39,287 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:30:39,287 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:30:39,288 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-parallel-sum-2.wvr.c [2025-02-06 09:30:40,430 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ef8822381/a4834fb331874f788c3bc0b5aee6d2a6/FLAG7fd0fe345 [2025-02-06 09:30:40,624 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:30:40,626 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-parallel-sum-2.wvr.c [2025-02-06 09:30:40,633 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ef8822381/a4834fb331874f788c3bc0b5aee6d2a6/FLAG7fd0fe345 [2025-02-06 09:30:40,643 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ef8822381/a4834fb331874f788c3bc0b5aee6d2a6 [2025-02-06 09:30:40,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:30:40,650 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:30:40,651 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:30:40,651 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:30:40,654 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:30:40,655 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:30:40" (1/1) ... [2025-02-06 09:30:40,655 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ece7a3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:40, skipping insertion in model container [2025-02-06 09:30:40,657 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:30:40" (1/1) ... [2025-02-06 09:30:40,670 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:30:40,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:30:40,796 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:30:40,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:30:40,839 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:30:40,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:40 WrapperNode [2025-02-06 09:30:40,840 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:30:40,841 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:30:40,841 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:30:40,841 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:30:40,845 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:40" (1/1) ... [2025-02-06 09:30:40,852 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:40" (1/1) ... [2025-02-06 09:30:40,874 INFO L138 Inliner]: procedures = 28, calls = 59, calls flagged for inlining = 23, calls inlined = 33, statements flattened = 629 [2025-02-06 09:30:40,874 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:30:40,875 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:30:40,875 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:30:40,875 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:30:40,881 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:40" (1/1) ... [2025-02-06 09:30:40,881 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:40" (1/1) ... [2025-02-06 09:30:40,888 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:40" (1/1) ... [2025-02-06 09:30:40,889 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:40" (1/1) ... [2025-02-06 09:30:40,905 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:40" (1/1) ... [2025-02-06 09:30:40,907 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:40" (1/1) ... [2025-02-06 09:30:40,908 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:40" (1/1) ... [2025-02-06 09:30:40,909 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:40" (1/1) ... [2025-02-06 09:30:40,912 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:30:40,912 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:30:40,912 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:30:40,913 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:30:40,913 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:40" (1/1) ... [2025-02-06 09:30:40,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:30:40,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:30:40,943 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 09:30:40,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 09:30:40,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:30:40,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:30:40,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:30:40,965 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 09:30:40,965 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 09:30:40,966 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 09:30:40,966 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 09:30:40,966 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 09:30:40,967 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 09:30:40,967 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-06 09:30:40,967 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-06 09:30:40,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:30:40,967 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-02-06 09:30:40,967 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-02-06 09:30:40,967 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-02-06 09:30:40,967 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-02-06 09:30:40,967 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 09:30:40,967 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 09:30:40,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 09:30:40,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:30:40,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:30:40,969 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:30:41,085 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:30:41,088 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:30:41,776 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:30:41,776 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:30:42,073 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:30:42,073 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:30:42,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:30:42 BoogieIcfgContainer [2025-02-06 09:30:42,074 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:30:42,075 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:30:42,076 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:30:42,079 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:30:42,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:30:40" (1/3) ... [2025-02-06 09:30:42,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@83d98d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:30:42, skipping insertion in model container [2025-02-06 09:30:42,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:40" (2/3) ... [2025-02-06 09:30:42,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@83d98d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:30:42, skipping insertion in model container [2025-02-06 09:30:42,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:30:42" (3/3) ... [2025-02-06 09:30:42,082 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-2.wvr.c [2025-02-06 09:30:42,094 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:30:42,096 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-parallel-sum-2.wvr.c that has 7 procedures, 453 locations, 1 initial locations, 5 loop locations, and 83 error locations. [2025-02-06 09:30:42,096 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:30:42,230 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2025-02-06 09:30:42,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 513 places, 521 transitions, 1108 flow [2025-02-06 09:30:42,421 INFO L124 PetriNetUnfolderBase]: 25/471 cut-off events. [2025-02-06 09:30:42,424 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 09:30:42,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 500 conditions, 471 events. 25/471 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 837 event pairs, 0 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 413. Up to 3 conditions per place. [2025-02-06 09:30:42,431 INFO L82 GeneralOperation]: Start removeDead. Operand has 513 places, 521 transitions, 1108 flow [2025-02-06 09:30:42,441 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 449 places, 454 transitions, 956 flow [2025-02-06 09:30:42,447 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:30:42,454 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;@331ff97c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:30:42,454 INFO L334 AbstractCegarLoop]: Starting to check reachability of 147 error locations. [2025-02-06 09:30:42,458 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:30:42,459 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2025-02-06 09:30:42,459 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:30:42,459 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:42,459 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] [2025-02-06 09:30:42,460 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-02-06 09:30:42,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:42,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1570896864, now seen corresponding path program 1 times [2025-02-06 09:30:42,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:42,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201930941] [2025-02-06 09:30:42,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:42,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:42,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 09:30:42,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 09:30:42,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:42,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:42,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:42,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:42,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201930941] [2025-02-06 09:30:42,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201930941] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:42,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:42,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:42,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510747750] [2025-02-06 09:30:42,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:42,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:42,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:42,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:42,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:42,697 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 525 [2025-02-06 09:30:42,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 454 transitions, 956 flow. Second operand has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:42,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:42,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 525 [2025-02-06 09:30:42,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:43,487 INFO L124 PetriNetUnfolderBase]: 1299/4037 cut-off events. [2025-02-06 09:30:43,487 INFO L125 PetriNetUnfolderBase]: For 1061/1061 co-relation queries the response was YES. [2025-02-06 09:30:43,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6589 conditions, 4037 events. 1299/4037 cut-off events. For 1061/1061 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 30370 event pairs, 526 based on Foata normal form. 564/3830 useless extension candidates. Maximal degree in co-relation 6108. Up to 1640 conditions per place. [2025-02-06 09:30:43,538 INFO L140 encePairwiseOnDemand]: 462/525 looper letters, 31 selfloop transitions, 2 changer transitions 4/393 dead transitions. [2025-02-06 09:30:43,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 393 transitions, 900 flow [2025-02-06 09:30:43,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:43,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:43,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1321 transitions. [2025-02-06 09:30:43,555 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8387301587301588 [2025-02-06 09:30:43,556 INFO L175 Difference]: Start difference. First operand has 449 places, 454 transitions, 956 flow. Second operand 3 states and 1321 transitions. [2025-02-06 09:30:43,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 393 transitions, 900 flow [2025-02-06 09:30:43,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 393 transitions, 868 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-02-06 09:30:43,574 INFO L231 Difference]: Finished difference. Result has 388 places, 389 transitions, 798 flow [2025-02-06 09:30:43,577 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=798, PETRI_PLACES=388, PETRI_TRANSITIONS=389} [2025-02-06 09:30:43,580 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -61 predicate places. [2025-02-06 09:30:43,580 INFO L471 AbstractCegarLoop]: Abstraction has has 388 places, 389 transitions, 798 flow [2025-02-06 09:30:43,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:43,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:43,581 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] [2025-02-06 09:30:43,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:30:43,582 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-02-06 09:30:43,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:43,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1455286073, now seen corresponding path program 1 times [2025-02-06 09:30:43,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:43,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807334147] [2025-02-06 09:30:43,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:43,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:43,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 09:30:43,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 09:30:43,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:43,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:43,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:43,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:43,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807334147] [2025-02-06 09:30:43,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807334147] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:43,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:43,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:43,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687825395] [2025-02-06 09:30:43,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:43,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:43,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:43,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:43,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:43,667 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 525 [2025-02-06 09:30:43,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 389 transitions, 798 flow. Second operand has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:43,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:43,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 525 [2025-02-06 09:30:43,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:44,167 INFO L124 PetriNetUnfolderBase]: 1292/3932 cut-off events. [2025-02-06 09:30:44,168 INFO L125 PetriNetUnfolderBase]: For 296/296 co-relation queries the response was YES. [2025-02-06 09:30:44,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5719 conditions, 3932 events. 1292/3932 cut-off events. For 296/296 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 29086 event pairs, 521 based on Foata normal form. 0/3189 useless extension candidates. Maximal degree in co-relation 5681. Up to 1631 conditions per place. [2025-02-06 09:30:44,194 INFO L140 encePairwiseOnDemand]: 522/525 looper letters, 31 selfloop transitions, 2 changer transitions 0/388 dead transitions. [2025-02-06 09:30:44,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 388 transitions, 862 flow [2025-02-06 09:30:44,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:44,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:44,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1261 transitions. [2025-02-06 09:30:44,197 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8006349206349206 [2025-02-06 09:30:44,197 INFO L175 Difference]: Start difference. First operand has 388 places, 389 transitions, 798 flow. Second operand 3 states and 1261 transitions. [2025-02-06 09:30:44,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 388 transitions, 862 flow [2025-02-06 09:30:44,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 388 transitions, 858 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:44,204 INFO L231 Difference]: Finished difference. Result has 383 places, 388 transitions, 796 flow [2025-02-06 09:30:44,204 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=796, PETRI_PLACES=383, PETRI_TRANSITIONS=388} [2025-02-06 09:30:44,205 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -66 predicate places. [2025-02-06 09:30:44,205 INFO L471 AbstractCegarLoop]: Abstraction has has 383 places, 388 transitions, 796 flow [2025-02-06 09:30:44,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:44,205 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:44,205 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:30:44,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:30:44,206 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-02-06 09:30:44,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:44,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1497757122, now seen corresponding path program 1 times [2025-02-06 09:30:44,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:44,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964251215] [2025-02-06 09:30:44,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:44,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:44,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 09:30:44,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 09:30:44,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:44,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:44,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:44,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:44,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964251215] [2025-02-06 09:30:44,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964251215] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:44,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:44,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:44,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978889244] [2025-02-06 09:30:44,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:44,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:44,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:44,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:44,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:44,272 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 525 [2025-02-06 09:30:44,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 388 transitions, 796 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:44,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:44,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 525 [2025-02-06 09:30:44,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:44,679 INFO L124 PetriNetUnfolderBase]: 1245/3789 cut-off events. [2025-02-06 09:30:44,680 INFO L125 PetriNetUnfolderBase]: For 287/287 co-relation queries the response was YES. [2025-02-06 09:30:44,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5504 conditions, 3789 events. 1245/3789 cut-off events. For 287/287 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 27689 event pairs, 493 based on Foata normal form. 0/3083 useless extension candidates. Maximal degree in co-relation 5458. Up to 1563 conditions per place. [2025-02-06 09:30:44,704 INFO L140 encePairwiseOnDemand]: 522/525 looper letters, 29 selfloop transitions, 2 changer transitions 0/387 dead transitions. [2025-02-06 09:30:44,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 387 transitions, 856 flow [2025-02-06 09:30:44,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:44,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:44,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1268 transitions. [2025-02-06 09:30:44,708 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8050793650793651 [2025-02-06 09:30:44,709 INFO L175 Difference]: Start difference. First operand has 383 places, 388 transitions, 796 flow. Second operand 3 states and 1268 transitions. [2025-02-06 09:30:44,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 387 transitions, 856 flow [2025-02-06 09:30:44,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 387 transitions, 852 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:44,714 INFO L231 Difference]: Finished difference. Result has 382 places, 387 transitions, 794 flow [2025-02-06 09:30:44,715 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=794, PETRI_PLACES=382, PETRI_TRANSITIONS=387} [2025-02-06 09:30:44,716 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -67 predicate places. [2025-02-06 09:30:44,716 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 387 transitions, 794 flow [2025-02-06 09:30:44,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:44,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:44,717 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:30:44,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:30:44,718 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-02-06 09:30:44,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:44,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1906388696, now seen corresponding path program 1 times [2025-02-06 09:30:44,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:44,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306772856] [2025-02-06 09:30:44,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:44,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:44,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-06 09:30:44,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-06 09:30:44,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:44,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:44,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:44,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:44,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306772856] [2025-02-06 09:30:44,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306772856] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:44,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:44,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:44,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160957664] [2025-02-06 09:30:44,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:44,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:44,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:44,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:44,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:44,765 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 525 [2025-02-06 09:30:44,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 387 transitions, 794 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:44,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:44,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 525 [2025-02-06 09:30:44,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:45,303 INFO L124 PetriNetUnfolderBase]: 1245/3788 cut-off events. [2025-02-06 09:30:45,303 INFO L125 PetriNetUnfolderBase]: For 287/287 co-relation queries the response was YES. [2025-02-06 09:30:45,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5503 conditions, 3788 events. 1245/3788 cut-off events. For 287/287 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 27723 event pairs, 493 based on Foata normal form. 0/3083 useless extension candidates. Maximal degree in co-relation 5449. Up to 1563 conditions per place. [2025-02-06 09:30:45,335 INFO L140 encePairwiseOnDemand]: 522/525 looper letters, 29 selfloop transitions, 2 changer transitions 0/386 dead transitions. [2025-02-06 09:30:45,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 386 transitions, 854 flow [2025-02-06 09:30:45,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:45,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:45,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1268 transitions. [2025-02-06 09:30:45,338 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8050793650793651 [2025-02-06 09:30:45,338 INFO L175 Difference]: Start difference. First operand has 382 places, 387 transitions, 794 flow. Second operand 3 states and 1268 transitions. [2025-02-06 09:30:45,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 386 transitions, 854 flow [2025-02-06 09:30:45,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 386 transitions, 850 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:45,344 INFO L231 Difference]: Finished difference. Result has 381 places, 386 transitions, 792 flow [2025-02-06 09:30:45,345 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=788, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=792, PETRI_PLACES=381, PETRI_TRANSITIONS=386} [2025-02-06 09:30:45,346 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -68 predicate places. [2025-02-06 09:30:45,346 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 386 transitions, 792 flow [2025-02-06 09:30:45,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:45,347 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:45,347 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:30:45,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:30:45,348 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-02-06 09:30:45,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:45,348 INFO L85 PathProgramCache]: Analyzing trace with hash -406025939, now seen corresponding path program 1 times [2025-02-06 09:30:45,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:45,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608429972] [2025-02-06 09:30:45,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:45,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:45,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 09:30:45,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 09:30:45,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:45,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:45,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:45,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:45,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608429972] [2025-02-06 09:30:45,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608429972] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:45,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:45,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:45,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123942225] [2025-02-06 09:30:45,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:45,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:45,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:45,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:45,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:45,430 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 525 [2025-02-06 09:30:45,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 386 transitions, 792 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:45,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:45,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 525 [2025-02-06 09:30:45,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:45,889 INFO L124 PetriNetUnfolderBase]: 1245/3787 cut-off events. [2025-02-06 09:30:45,890 INFO L125 PetriNetUnfolderBase]: For 287/287 co-relation queries the response was YES. [2025-02-06 09:30:45,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5502 conditions, 3787 events. 1245/3787 cut-off events. For 287/287 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 27700 event pairs, 493 based on Foata normal form. 0/3083 useless extension candidates. Maximal degree in co-relation 5440. Up to 1563 conditions per place. [2025-02-06 09:30:45,910 INFO L140 encePairwiseOnDemand]: 522/525 looper letters, 29 selfloop transitions, 2 changer transitions 0/385 dead transitions. [2025-02-06 09:30:45,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 385 transitions, 852 flow [2025-02-06 09:30:45,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:45,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:45,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1268 transitions. [2025-02-06 09:30:45,913 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8050793650793651 [2025-02-06 09:30:45,913 INFO L175 Difference]: Start difference. First operand has 381 places, 386 transitions, 792 flow. Second operand 3 states and 1268 transitions. [2025-02-06 09:30:45,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 385 transitions, 852 flow [2025-02-06 09:30:45,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 385 transitions, 848 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:45,917 INFO L231 Difference]: Finished difference. Result has 380 places, 385 transitions, 790 flow [2025-02-06 09:30:45,918 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=790, PETRI_PLACES=380, PETRI_TRANSITIONS=385} [2025-02-06 09:30:45,918 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -69 predicate places. [2025-02-06 09:30:45,918 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 385 transitions, 790 flow [2025-02-06 09:30:45,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:45,919 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:45,919 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:30:45,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:30:45,919 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-02-06 09:30:45,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:45,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1039453985, now seen corresponding path program 1 times [2025-02-06 09:30:45,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:45,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727913646] [2025-02-06 09:30:45,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:45,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:45,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 09:30:45,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 09:30:45,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:45,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:45,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:45,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:45,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727913646] [2025-02-06 09:30:45,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727913646] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:45,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:45,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:45,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157216861] [2025-02-06 09:30:45,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:45,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:45,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:45,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:45,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:45,984 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 525 [2025-02-06 09:30:45,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 385 transitions, 790 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:45,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:45,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 525 [2025-02-06 09:30:45,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:46,373 INFO L124 PetriNetUnfolderBase]: 1245/3786 cut-off events. [2025-02-06 09:30:46,373 INFO L125 PetriNetUnfolderBase]: For 287/287 co-relation queries the response was YES. [2025-02-06 09:30:46,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5501 conditions, 3786 events. 1245/3786 cut-off events. For 287/287 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 27701 event pairs, 493 based on Foata normal form. 0/3083 useless extension candidates. Maximal degree in co-relation 5431. Up to 1563 conditions per place. [2025-02-06 09:30:46,403 INFO L140 encePairwiseOnDemand]: 522/525 looper letters, 29 selfloop transitions, 2 changer transitions 0/384 dead transitions. [2025-02-06 09:30:46,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 384 transitions, 850 flow [2025-02-06 09:30:46,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:46,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:46,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1268 transitions. [2025-02-06 09:30:46,406 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8050793650793651 [2025-02-06 09:30:46,406 INFO L175 Difference]: Start difference. First operand has 380 places, 385 transitions, 790 flow. Second operand 3 states and 1268 transitions. [2025-02-06 09:30:46,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 384 transitions, 850 flow [2025-02-06 09:30:46,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 384 transitions, 846 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:46,410 INFO L231 Difference]: Finished difference. Result has 379 places, 384 transitions, 788 flow [2025-02-06 09:30:46,410 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=788, PETRI_PLACES=379, PETRI_TRANSITIONS=384} [2025-02-06 09:30:46,411 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -70 predicate places. [2025-02-06 09:30:46,411 INFO L471 AbstractCegarLoop]: Abstraction has has 379 places, 384 transitions, 788 flow [2025-02-06 09:30:46,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:46,412 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:46,412 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:30:46,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:30:46,412 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-02-06 09:30:46,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:46,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1791149597, now seen corresponding path program 1 times [2025-02-06 09:30:46,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:46,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925267105] [2025-02-06 09:30:46,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:46,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:46,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-06 09:30:46,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-06 09:30:46,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:46,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:46,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:46,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:46,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925267105] [2025-02-06 09:30:46,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925267105] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:46,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:46,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:46,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496036792] [2025-02-06 09:30:46,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:46,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:46,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:46,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:46,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:46,489 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 406 out of 525 [2025-02-06 09:30:46,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 384 transitions, 788 flow. Second operand has 3 states, 3 states have (on average 407.3333333333333) internal successors, (1222), 3 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:46,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:46,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 406 of 525 [2025-02-06 09:30:46,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:46,863 INFO L124 PetriNetUnfolderBase]: 1245/3785 cut-off events. [2025-02-06 09:30:46,863 INFO L125 PetriNetUnfolderBase]: For 287/287 co-relation queries the response was YES. [2025-02-06 09:30:46,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5506 conditions, 3785 events. 1245/3785 cut-off events. For 287/287 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 27712 event pairs, 493 based on Foata normal form. 0/3083 useless extension candidates. Maximal degree in co-relation 5428. Up to 1569 conditions per place. [2025-02-06 09:30:46,888 INFO L140 encePairwiseOnDemand]: 522/525 looper letters, 35 selfloop transitions, 2 changer transitions 0/383 dead transitions. [2025-02-06 09:30:46,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 383 transitions, 860 flow [2025-02-06 09:30:46,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:46,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:46,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1256 transitions. [2025-02-06 09:30:46,891 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7974603174603174 [2025-02-06 09:30:46,891 INFO L175 Difference]: Start difference. First operand has 379 places, 384 transitions, 788 flow. Second operand 3 states and 1256 transitions. [2025-02-06 09:30:46,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 383 transitions, 860 flow [2025-02-06 09:30:46,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 383 transitions, 856 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:46,895 INFO L231 Difference]: Finished difference. Result has 378 places, 383 transitions, 786 flow [2025-02-06 09:30:46,896 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=786, PETRI_PLACES=378, PETRI_TRANSITIONS=383} [2025-02-06 09:30:46,896 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -71 predicate places. [2025-02-06 09:30:46,896 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 383 transitions, 786 flow [2025-02-06 09:30:46,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 407.3333333333333) internal successors, (1222), 3 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:46,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:46,897 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:30:46,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:30:46,897 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-02-06 09:30:46,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:46,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1160784554, now seen corresponding path program 1 times [2025-02-06 09:30:46,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:46,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197001518] [2025-02-06 09:30:46,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:46,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:46,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-06 09:30:46,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-06 09:30:46,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:46,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:46,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:46,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:46,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197001518] [2025-02-06 09:30:46,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197001518] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:46,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:46,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:46,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785541255] [2025-02-06 09:30:46,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:46,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:46,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:46,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:46,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:46,950 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 525 [2025-02-06 09:30:46,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 383 transitions, 786 flow. Second operand has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:46,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:46,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 525 [2025-02-06 09:30:46,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:47,306 INFO L124 PetriNetUnfolderBase]: 1245/3784 cut-off events. [2025-02-06 09:30:47,306 INFO L125 PetriNetUnfolderBase]: For 287/287 co-relation queries the response was YES. [2025-02-06 09:30:47,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5500 conditions, 3784 events. 1245/3784 cut-off events. For 287/287 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 27720 event pairs, 493 based on Foata normal form. 0/3083 useless extension candidates. Maximal degree in co-relation 5414. Up to 1564 conditions per place. [2025-02-06 09:30:47,320 INFO L140 encePairwiseOnDemand]: 522/525 looper letters, 30 selfloop transitions, 2 changer transitions 0/382 dead transitions. [2025-02-06 09:30:47,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 382 transitions, 848 flow [2025-02-06 09:30:47,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:47,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:47,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1266 transitions. [2025-02-06 09:30:47,322 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8038095238095239 [2025-02-06 09:30:47,322 INFO L175 Difference]: Start difference. First operand has 378 places, 383 transitions, 786 flow. Second operand 3 states and 1266 transitions. [2025-02-06 09:30:47,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 382 transitions, 848 flow [2025-02-06 09:30:47,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 382 transitions, 844 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:47,326 INFO L231 Difference]: Finished difference. Result has 377 places, 382 transitions, 784 flow [2025-02-06 09:30:47,326 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=784, PETRI_PLACES=377, PETRI_TRANSITIONS=382} [2025-02-06 09:30:47,327 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -72 predicate places. [2025-02-06 09:30:47,327 INFO L471 AbstractCegarLoop]: Abstraction has has 377 places, 382 transitions, 784 flow [2025-02-06 09:30:47,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:47,328 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:47,328 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:30:47,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:30:47,328 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-02-06 09:30:47,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:47,328 INFO L85 PathProgramCache]: Analyzing trace with hash 487925340, now seen corresponding path program 1 times [2025-02-06 09:30:47,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:47,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174014961] [2025-02-06 09:30:47,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:47,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:47,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 09:30:47,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 09:30:47,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:47,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:47,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:47,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:47,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174014961] [2025-02-06 09:30:47,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174014961] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:47,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:47,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:47,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477816094] [2025-02-06 09:30:47,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:47,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:47,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:47,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:47,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:47,387 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 525 [2025-02-06 09:30:47,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 382 transitions, 784 flow. Second operand has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:47,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:47,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 525 [2025-02-06 09:30:47,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:47,720 INFO L124 PetriNetUnfolderBase]: 1245/3783 cut-off events. [2025-02-06 09:30:47,720 INFO L125 PetriNetUnfolderBase]: For 287/287 co-relation queries the response was YES. [2025-02-06 09:30:47,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5499 conditions, 3783 events. 1245/3783 cut-off events. For 287/287 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 27793 event pairs, 493 based on Foata normal form. 0/3083 useless extension candidates. Maximal degree in co-relation 5405. Up to 1564 conditions per place. [2025-02-06 09:30:47,745 INFO L140 encePairwiseOnDemand]: 522/525 looper letters, 30 selfloop transitions, 2 changer transitions 0/381 dead transitions. [2025-02-06 09:30:47,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 381 transitions, 846 flow [2025-02-06 09:30:47,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:47,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:47,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1266 transitions. [2025-02-06 09:30:47,747 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8038095238095239 [2025-02-06 09:30:47,747 INFO L175 Difference]: Start difference. First operand has 377 places, 382 transitions, 784 flow. Second operand 3 states and 1266 transitions. [2025-02-06 09:30:47,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 381 transitions, 846 flow [2025-02-06 09:30:47,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 381 transitions, 842 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:47,751 INFO L231 Difference]: Finished difference. Result has 376 places, 381 transitions, 782 flow [2025-02-06 09:30:47,752 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=782, PETRI_PLACES=376, PETRI_TRANSITIONS=381} [2025-02-06 09:30:47,752 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -73 predicate places. [2025-02-06 09:30:47,753 INFO L471 AbstractCegarLoop]: Abstraction has has 376 places, 381 transitions, 782 flow [2025-02-06 09:30:47,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:47,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:47,753 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:30:47,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:30:47,754 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-02-06 09:30:47,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:47,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1820735916, now seen corresponding path program 1 times [2025-02-06 09:30:47,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:47,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474834344] [2025-02-06 09:30:47,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:47,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:47,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 09:30:47,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 09:30:47,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:47,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:47,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:47,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:47,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474834344] [2025-02-06 09:30:47,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474834344] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:47,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:47,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:47,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739900835] [2025-02-06 09:30:47,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:47,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:47,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:47,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:47,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:47,798 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 525 [2025-02-06 09:30:47,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 381 transitions, 782 flow. Second operand has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:47,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:47,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 525 [2025-02-06 09:30:47,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:48,216 INFO L124 PetriNetUnfolderBase]: 1245/3782 cut-off events. [2025-02-06 09:30:48,216 INFO L125 PetriNetUnfolderBase]: For 287/287 co-relation queries the response was YES. [2025-02-06 09:30:48,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5498 conditions, 3782 events. 1245/3782 cut-off events. For 287/287 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 27734 event pairs, 493 based on Foata normal form. 0/3083 useless extension candidates. Maximal degree in co-relation 5396. Up to 1564 conditions per place. [2025-02-06 09:30:48,240 INFO L140 encePairwiseOnDemand]: 522/525 looper letters, 30 selfloop transitions, 2 changer transitions 0/380 dead transitions. [2025-02-06 09:30:48,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 380 transitions, 844 flow [2025-02-06 09:30:48,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:48,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:48,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1266 transitions. [2025-02-06 09:30:48,243 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8038095238095239 [2025-02-06 09:30:48,243 INFO L175 Difference]: Start difference. First operand has 376 places, 381 transitions, 782 flow. Second operand 3 states and 1266 transitions. [2025-02-06 09:30:48,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 380 transitions, 844 flow [2025-02-06 09:30:48,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 380 transitions, 840 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:48,248 INFO L231 Difference]: Finished difference. Result has 375 places, 380 transitions, 780 flow [2025-02-06 09:30:48,248 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=776, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=780, PETRI_PLACES=375, PETRI_TRANSITIONS=380} [2025-02-06 09:30:48,249 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -74 predicate places. [2025-02-06 09:30:48,249 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 380 transitions, 780 flow [2025-02-06 09:30:48,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:48,249 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:48,250 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:30:48,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:30:48,250 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-02-06 09:30:48,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:48,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1892348964, now seen corresponding path program 1 times [2025-02-06 09:30:48,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:48,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501232017] [2025-02-06 09:30:48,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:48,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:48,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 09:30:48,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 09:30:48,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:48,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:48,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:48,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:48,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501232017] [2025-02-06 09:30:48,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501232017] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:48,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:48,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:48,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445677319] [2025-02-06 09:30:48,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:48,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:48,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:48,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:48,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:48,307 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 525 [2025-02-06 09:30:48,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 380 transitions, 780 flow. Second operand has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:48,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:48,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 525 [2025-02-06 09:30:48,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:48,673 INFO L124 PetriNetUnfolderBase]: 1245/3781 cut-off events. [2025-02-06 09:30:48,673 INFO L125 PetriNetUnfolderBase]: For 287/287 co-relation queries the response was YES. [2025-02-06 09:30:48,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5497 conditions, 3781 events. 1245/3781 cut-off events. For 287/287 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 27790 event pairs, 493 based on Foata normal form. 0/3083 useless extension candidates. Maximal degree in co-relation 5387. Up to 1564 conditions per place. [2025-02-06 09:30:48,697 INFO L140 encePairwiseOnDemand]: 522/525 looper letters, 30 selfloop transitions, 2 changer transitions 0/379 dead transitions. [2025-02-06 09:30:48,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 379 transitions, 842 flow [2025-02-06 09:30:48,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:48,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:48,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1266 transitions. [2025-02-06 09:30:48,699 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8038095238095239 [2025-02-06 09:30:48,699 INFO L175 Difference]: Start difference. First operand has 375 places, 380 transitions, 780 flow. Second operand 3 states and 1266 transitions. [2025-02-06 09:30:48,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 379 transitions, 842 flow [2025-02-06 09:30:48,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 379 transitions, 838 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:48,703 INFO L231 Difference]: Finished difference. Result has 374 places, 379 transitions, 778 flow [2025-02-06 09:30:48,704 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=778, PETRI_PLACES=374, PETRI_TRANSITIONS=379} [2025-02-06 09:30:48,704 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -75 predicate places. [2025-02-06 09:30:48,704 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 379 transitions, 778 flow [2025-02-06 09:30:48,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:48,705 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:48,705 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:30:48,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 09:30:48,705 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-02-06 09:30:48,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:48,706 INFO L85 PathProgramCache]: Analyzing trace with hash 2054043623, now seen corresponding path program 1 times [2025-02-06 09:30:48,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:48,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54789874] [2025-02-06 09:30:48,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:48,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:48,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 09:30:48,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 09:30:48,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:48,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:48,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:48,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:48,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54789874] [2025-02-06 09:30:48,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54789874] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:48,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:48,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:48,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561932038] [2025-02-06 09:30:48,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:48,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:48,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:48,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:48,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:48,759 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 406 out of 525 [2025-02-06 09:30:48,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 379 transitions, 778 flow. Second operand has 3 states, 3 states have (on average 407.3333333333333) internal successors, (1222), 3 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:48,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:48,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 406 of 525 [2025-02-06 09:30:48,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:49,101 INFO L124 PetriNetUnfolderBase]: 1377/4049 cut-off events. [2025-02-06 09:30:49,102 INFO L125 PetriNetUnfolderBase]: For 308/308 co-relation queries the response was YES. [2025-02-06 09:30:49,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5960 conditions, 4049 events. 1377/4049 cut-off events. For 308/308 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 30056 event pairs, 581 based on Foata normal form. 0/3333 useless extension candidates. Maximal degree in co-relation 5842. Up to 1747 conditions per place. [2025-02-06 09:30:49,124 INFO L140 encePairwiseOnDemand]: 522/525 looper letters, 33 selfloop transitions, 2 changer transitions 0/378 dead transitions. [2025-02-06 09:30:49,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 378 transitions, 846 flow [2025-02-06 09:30:49,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:49,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:49,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1254 transitions. [2025-02-06 09:30:49,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7961904761904762 [2025-02-06 09:30:49,127 INFO L175 Difference]: Start difference. First operand has 374 places, 379 transitions, 778 flow. Second operand 3 states and 1254 transitions. [2025-02-06 09:30:49,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 378 transitions, 846 flow [2025-02-06 09:30:49,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 378 transitions, 842 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:49,131 INFO L231 Difference]: Finished difference. Result has 373 places, 378 transitions, 776 flow [2025-02-06 09:30:49,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=776, PETRI_PLACES=373, PETRI_TRANSITIONS=378} [2025-02-06 09:30:49,132 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -76 predicate places. [2025-02-06 09:30:49,132 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 378 transitions, 776 flow [2025-02-06 09:30:49,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 407.3333333333333) internal successors, (1222), 3 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:49,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:49,133 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:30:49,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 09:30:49,133 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-02-06 09:30:49,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:49,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1447438417, now seen corresponding path program 1 times [2025-02-06 09:30:49,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:49,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201543379] [2025-02-06 09:30:49,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:49,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:49,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 09:30:49,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 09:30:49,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:49,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:49,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:49,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:49,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201543379] [2025-02-06 09:30:49,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201543379] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:49,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:49,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:49,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720630393] [2025-02-06 09:30:49,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:49,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:49,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:49,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:49,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:49,190 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 525 [2025-02-06 09:30:49,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 378 transitions, 776 flow. Second operand has 3 states, 3 states have (on average 401.0) internal successors, (1203), 3 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:49,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:49,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 525 [2025-02-06 09:30:49,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:49,572 INFO L124 PetriNetUnfolderBase]: 1479/4329 cut-off events. [2025-02-06 09:30:49,573 INFO L125 PetriNetUnfolderBase]: For 331/331 co-relation queries the response was YES. [2025-02-06 09:30:49,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6394 conditions, 4329 events. 1479/4329 cut-off events. For 331/331 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 32694 event pairs, 643 based on Foata normal form. 0/3573 useless extension candidates. Maximal degree in co-relation 6268. Up to 1891 conditions per place. [2025-02-06 09:30:49,597 INFO L140 encePairwiseOnDemand]: 520/525 looper letters, 34 selfloop transitions, 1 changer transitions 0/374 dead transitions. [2025-02-06 09:30:49,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 374 transitions, 838 flow [2025-02-06 09:30:49,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:49,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:49,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1239 transitions. [2025-02-06 09:30:49,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7866666666666666 [2025-02-06 09:30:49,598 INFO L175 Difference]: Start difference. First operand has 373 places, 378 transitions, 776 flow. Second operand 3 states and 1239 transitions. [2025-02-06 09:30:49,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 374 transitions, 838 flow [2025-02-06 09:30:49,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 374 transitions, 834 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:49,602 INFO L231 Difference]: Finished difference. Result has 369 places, 374 transitions, 766 flow [2025-02-06 09:30:49,602 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=766, PETRI_PLACES=369, PETRI_TRANSITIONS=374} [2025-02-06 09:30:49,603 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -80 predicate places. [2025-02-06 09:30:49,603 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 374 transitions, 766 flow [2025-02-06 09:30:49,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.0) internal successors, (1203), 3 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:49,603 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:49,604 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:30:49,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 09:30:49,604 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-02-06 09:30:49,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:49,604 INFO L85 PathProgramCache]: Analyzing trace with hash 871982943, now seen corresponding path program 1 times [2025-02-06 09:30:49,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:49,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939395124] [2025-02-06 09:30:49,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:49,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:49,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 09:30:49,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 09:30:49,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:49,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:49,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:49,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:49,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939395124] [2025-02-06 09:30:49,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939395124] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:49,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:49,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:49,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572582503] [2025-02-06 09:30:49,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:49,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:49,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:49,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:49,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:49,668 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 525 [2025-02-06 09:30:49,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 374 transitions, 766 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:49,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:49,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 525 [2025-02-06 09:30:49,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:49,999 INFO L124 PetriNetUnfolderBase]: 1292/3779 cut-off events. [2025-02-06 09:30:49,999 INFO L125 PetriNetUnfolderBase]: For 293/293 co-relation queries the response was YES. [2025-02-06 09:30:50,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5558 conditions, 3779 events. 1292/3779 cut-off events. For 293/293 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 27437 event pairs, 536 based on Foata normal form. 0/3113 useless extension candidates. Maximal degree in co-relation 5432. Up to 1624 conditions per place. [2025-02-06 09:30:50,028 INFO L140 encePairwiseOnDemand]: 522/525 looper letters, 29 selfloop transitions, 2 changer transitions 0/373 dead transitions. [2025-02-06 09:30:50,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 373 transitions, 826 flow [2025-02-06 09:30:50,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:50,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:50,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1268 transitions. [2025-02-06 09:30:50,030 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8050793650793651 [2025-02-06 09:30:50,030 INFO L175 Difference]: Start difference. First operand has 369 places, 374 transitions, 766 flow. Second operand 3 states and 1268 transitions. [2025-02-06 09:30:50,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 373 transitions, 826 flow [2025-02-06 09:30:50,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 373 transitions, 825 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:30:50,034 INFO L231 Difference]: Finished difference. Result has 369 places, 373 transitions, 767 flow [2025-02-06 09:30:50,034 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=763, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=767, PETRI_PLACES=369, PETRI_TRANSITIONS=373} [2025-02-06 09:30:50,034 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -80 predicate places. [2025-02-06 09:30:50,035 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 373 transitions, 767 flow [2025-02-06 09:30:50,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:50,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:50,035 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:30:50,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 09:30:50,036 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-02-06 09:30:50,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:50,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1539176570, now seen corresponding path program 1 times [2025-02-06 09:30:50,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:50,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842595423] [2025-02-06 09:30:50,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:50,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:50,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 09:30:50,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 09:30:50,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:50,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:50,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:50,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:50,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842595423] [2025-02-06 09:30:50,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842595423] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:50,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:50,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:30:50,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184227287] [2025-02-06 09:30:50,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:50,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:30:50,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:50,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:30:50,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:30:50,543 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 405 out of 525 [2025-02-06 09:30:50,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 373 transitions, 767 flow. Second operand has 6 states, 6 states have (on average 406.5) internal successors, (2439), 6 states have internal predecessors, (2439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:50,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:50,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 405 of 525 [2025-02-06 09:30:50,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:50,964 INFO L124 PetriNetUnfolderBase]: 1292/3778 cut-off events. [2025-02-06 09:30:50,964 INFO L125 PetriNetUnfolderBase]: For 293/293 co-relation queries the response was YES. [2025-02-06 09:30:50,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5567 conditions, 3778 events. 1292/3778 cut-off events. For 293/293 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 27476 event pairs, 536 based on Foata normal form. 0/3113 useless extension candidates. Maximal degree in co-relation 5442. Up to 1629 conditions per place. [2025-02-06 09:30:50,982 INFO L140 encePairwiseOnDemand]: 519/525 looper letters, 34 selfloop transitions, 5 changer transitions 0/372 dead transitions. [2025-02-06 09:30:50,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 372 transitions, 843 flow [2025-02-06 09:30:50,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:30:50,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:30:50,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2470 transitions. [2025-02-06 09:30:50,985 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7841269841269841 [2025-02-06 09:30:50,985 INFO L175 Difference]: Start difference. First operand has 369 places, 373 transitions, 767 flow. Second operand 6 states and 2470 transitions. [2025-02-06 09:30:50,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 372 transitions, 843 flow [2025-02-06 09:30:50,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 372 transitions, 839 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:50,988 INFO L231 Difference]: Finished difference. Result has 371 places, 372 transitions, 771 flow [2025-02-06 09:30:50,989 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=771, PETRI_PLACES=371, PETRI_TRANSITIONS=372} [2025-02-06 09:30:50,989 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -78 predicate places. [2025-02-06 09:30:50,989 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 372 transitions, 771 flow [2025-02-06 09:30:50,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 406.5) internal successors, (2439), 6 states have internal predecessors, (2439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:50,990 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:50,990 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:30:50,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 09:30:50,990 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-02-06 09:30:50,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:50,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1119679348, now seen corresponding path program 1 times [2025-02-06 09:30:50,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:50,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936518435] [2025-02-06 09:30:50,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:50,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:50,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-06 09:30:51,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-06 09:30:51,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:51,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:51,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:51,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:51,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936518435] [2025-02-06 09:30:51,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936518435] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:51,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:51,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:51,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382033581] [2025-02-06 09:30:51,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:51,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:51,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:51,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:51,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:51,053 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 525 [2025-02-06 09:30:51,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 372 transitions, 771 flow. Second operand has 3 states, 3 states have (on average 401.0) internal successors, (1203), 3 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:51,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:51,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 525 [2025-02-06 09:30:51,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:51,558 INFO L124 PetriNetUnfolderBase]: 1814/4923 cut-off events. [2025-02-06 09:30:51,558 INFO L125 PetriNetUnfolderBase]: For 366/366 co-relation queries the response was YES. [2025-02-06 09:30:51,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7451 conditions, 4923 events. 1814/4923 cut-off events. For 366/366 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 38067 event pairs, 408 based on Foata normal form. 0/4108 useless extension candidates. Maximal degree in co-relation 7433. Up to 1170 conditions per place. [2025-02-06 09:30:51,593 INFO L140 encePairwiseOnDemand]: 516/525 looper letters, 58 selfloop transitions, 3 changer transitions 0/388 dead transitions. [2025-02-06 09:30:51,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 388 transitions, 937 flow [2025-02-06 09:30:51,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:51,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:51,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1267 transitions. [2025-02-06 09:30:51,595 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8044444444444444 [2025-02-06 09:30:51,595 INFO L175 Difference]: Start difference. First operand has 371 places, 372 transitions, 771 flow. Second operand 3 states and 1267 transitions. [2025-02-06 09:30:51,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 388 transitions, 937 flow [2025-02-06 09:30:51,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 388 transitions, 927 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:30:51,602 INFO L231 Difference]: Finished difference. Result has 364 places, 368 transitions, 769 flow [2025-02-06 09:30:51,603 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=749, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=769, PETRI_PLACES=364, PETRI_TRANSITIONS=368} [2025-02-06 09:30:51,603 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -85 predicate places. [2025-02-06 09:30:51,603 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 368 transitions, 769 flow [2025-02-06 09:30:51,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.0) internal successors, (1203), 3 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:51,604 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:51,604 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:30:51,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 09:30:51,604 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-02-06 09:30:51,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:51,605 INFO L85 PathProgramCache]: Analyzing trace with hash -2024893077, now seen corresponding path program 1 times [2025-02-06 09:30:51,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:51,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520936040] [2025-02-06 09:30:51,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:51,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:51,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-06 09:30:51,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-06 09:30:51,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:51,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:51,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:51,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:51,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520936040] [2025-02-06 09:30:51,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520936040] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:51,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:51,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:51,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644340576] [2025-02-06 09:30:51,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:51,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:51,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:51,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:51,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:51,648 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 525 [2025-02-06 09:30:51,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 368 transitions, 769 flow. Second operand has 3 states, 3 states have (on average 416.0) internal successors, (1248), 3 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:51,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:51,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 525 [2025-02-06 09:30:51,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:52,387 INFO L124 PetriNetUnfolderBase]: 2365/6539 cut-off events. [2025-02-06 09:30:52,388 INFO L125 PetriNetUnfolderBase]: For 988/988 co-relation queries the response was YES. [2025-02-06 09:30:52,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10206 conditions, 6539 events. 2365/6539 cut-off events. For 988/988 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 55192 event pairs, 629 based on Foata normal form. 0/5506 useless extension candidates. Maximal degree in co-relation 10079. Up to 1646 conditions per place. [2025-02-06 09:30:52,440 INFO L140 encePairwiseOnDemand]: 521/525 looper letters, 50 selfloop transitions, 4 changer transitions 0/390 dead transitions. [2025-02-06 09:30:52,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 390 transitions, 944 flow [2025-02-06 09:30:52,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:52,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:52,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1296 transitions. [2025-02-06 09:30:52,442 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8228571428571428 [2025-02-06 09:30:52,442 INFO L175 Difference]: Start difference. First operand has 364 places, 368 transitions, 769 flow. Second operand 3 states and 1296 transitions. [2025-02-06 09:30:52,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 390 transitions, 944 flow [2025-02-06 09:30:52,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 390 transitions, 934 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:52,448 INFO L231 Difference]: Finished difference. Result has 365 places, 370 transitions, 793 flow [2025-02-06 09:30:52,448 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=793, PETRI_PLACES=365, PETRI_TRANSITIONS=370} [2025-02-06 09:30:52,449 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -84 predicate places. [2025-02-06 09:30:52,449 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 370 transitions, 793 flow [2025-02-06 09:30:52,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 416.0) internal successors, (1248), 3 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:52,449 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:52,450 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:30:52,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 09:30:52,450 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-02-06 09:30:52,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:52,450 INFO L85 PathProgramCache]: Analyzing trace with hash -412853461, now seen corresponding path program 1 times [2025-02-06 09:30:52,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:52,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086451777] [2025-02-06 09:30:52,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:52,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:52,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-06 09:30:52,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-06 09:30:52,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:52,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:52,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:52,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:52,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086451777] [2025-02-06 09:30:52,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086451777] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:52,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:52,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:52,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68294760] [2025-02-06 09:30:52,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:52,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:52,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:52,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:52,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:52,500 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 525 [2025-02-06 09:30:52,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 370 transitions, 793 flow. Second operand has 3 states, 3 states have (on average 416.6666666666667) internal successors, (1250), 3 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:52,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:52,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 525 [2025-02-06 09:30:52,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:53,603 INFO L124 PetriNetUnfolderBase]: 4048/11063 cut-off events. [2025-02-06 09:30:53,604 INFO L125 PetriNetUnfolderBase]: For 2294/2294 co-relation queries the response was YES. [2025-02-06 09:30:53,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17945 conditions, 11063 events. 4048/11063 cut-off events. For 2294/2294 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 105778 event pairs, 1964 based on Foata normal form. 0/9260 useless extension candidates. Maximal degree in co-relation 17818. Up to 3035 conditions per place. [2025-02-06 09:30:53,684 INFO L140 encePairwiseOnDemand]: 521/525 looper letters, 60 selfloop transitions, 3 changer transitions 0/399 dead transitions. [2025-02-06 09:30:53,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 399 transitions, 1022 flow [2025-02-06 09:30:53,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:53,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:53,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1302 transitions. [2025-02-06 09:30:53,686 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8266666666666667 [2025-02-06 09:30:53,686 INFO L175 Difference]: Start difference. First operand has 365 places, 370 transitions, 793 flow. Second operand 3 states and 1302 transitions. [2025-02-06 09:30:53,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 399 transitions, 1022 flow [2025-02-06 09:30:53,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 399 transitions, 1008 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:53,691 INFO L231 Difference]: Finished difference. Result has 366 places, 371 transitions, 803 flow [2025-02-06 09:30:53,692 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=783, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=803, PETRI_PLACES=366, PETRI_TRANSITIONS=371} [2025-02-06 09:30:53,692 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -83 predicate places. [2025-02-06 09:30:53,692 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 371 transitions, 803 flow [2025-02-06 09:30:53,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 416.6666666666667) internal successors, (1250), 3 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:53,692 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:53,693 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:30:53,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 09:30:53,693 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-02-06 09:30:53,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:53,693 INFO L85 PathProgramCache]: Analyzing trace with hash 30638419, now seen corresponding path program 1 times [2025-02-06 09:30:53,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:53,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718905911] [2025-02-06 09:30:53,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:53,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:53,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-06 09:30:53,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-06 09:30:53,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:53,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:53,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:53,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:53,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718905911] [2025-02-06 09:30:53,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718905911] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:53,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:53,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:53,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935611284] [2025-02-06 09:30:53,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:53,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:53,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:53,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:53,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:53,735 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 525 [2025-02-06 09:30:53,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 371 transitions, 803 flow. Second operand has 3 states, 3 states have (on average 416.0) internal successors, (1248), 3 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:53,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:53,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 525 [2025-02-06 09:30:53,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:55,723 INFO L124 PetriNetUnfolderBase]: 7061/18755 cut-off events. [2025-02-06 09:30:55,724 INFO L125 PetriNetUnfolderBase]: For 3913/3913 co-relation queries the response was YES. [2025-02-06 09:30:55,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31375 conditions, 18755 events. 7061/18755 cut-off events. For 3913/3913 co-relation queries the response was YES. Maximal size of possible extension queue 662. Compared 195153 event pairs, 3451 based on Foata normal form. 0/15759 useless extension candidates. Maximal degree in co-relation 31246. Up to 5267 conditions per place. [2025-02-06 09:30:55,855 INFO L140 encePairwiseOnDemand]: 521/525 looper letters, 64 selfloop transitions, 4 changer transitions 0/402 dead transitions. [2025-02-06 09:30:55,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 402 transitions, 1052 flow [2025-02-06 09:30:55,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:55,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:55,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1300 transitions. [2025-02-06 09:30:55,858 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8253968253968254 [2025-02-06 09:30:55,858 INFO L175 Difference]: Start difference. First operand has 366 places, 371 transitions, 803 flow. Second operand 3 states and 1300 transitions. [2025-02-06 09:30:55,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 402 transitions, 1052 flow [2025-02-06 09:30:55,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 402 transitions, 1042 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:55,866 INFO L231 Difference]: Finished difference. Result has 367 places, 373 transitions, 827 flow [2025-02-06 09:30:55,866 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=795, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=827, PETRI_PLACES=367, PETRI_TRANSITIONS=373} [2025-02-06 09:30:55,867 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -82 predicate places. [2025-02-06 09:30:55,867 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 373 transitions, 827 flow [2025-02-06 09:30:55,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 416.0) internal successors, (1248), 3 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:55,867 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:55,867 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:30:55,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 09:30:55,868 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-02-06 09:30:55,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:55,868 INFO L85 PathProgramCache]: Analyzing trace with hash -701883035, now seen corresponding path program 1 times [2025-02-06 09:30:55,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:55,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407790010] [2025-02-06 09:30:55,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:55,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:55,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-06 09:30:55,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-06 09:30:55,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:55,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:55,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:55,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:55,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407790010] [2025-02-06 09:30:55,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407790010] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:55,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:55,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:55,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710803725] [2025-02-06 09:30:55,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:55,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:55,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:55,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:55,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:55,922 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 525 [2025-02-06 09:30:55,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 373 transitions, 827 flow. Second operand has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:55,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:55,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 525 [2025-02-06 09:30:55,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:58,370 INFO L124 PetriNetUnfolderBase]: 9127/21789 cut-off events. [2025-02-06 09:30:58,370 INFO L125 PetriNetUnfolderBase]: For 5562/5562 co-relation queries the response was YES. [2025-02-06 09:30:58,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38802 conditions, 21789 events. 9127/21789 cut-off events. For 5562/5562 co-relation queries the response was YES. Maximal size of possible extension queue 765. Compared 218893 event pairs, 1204 based on Foata normal form. 0/18743 useless extension candidates. Maximal degree in co-relation 38672. Up to 10921 conditions per place. [2025-02-06 09:30:58,578 INFO L140 encePairwiseOnDemand]: 519/525 looper letters, 64 selfloop transitions, 4 changer transitions 0/398 dead transitions. [2025-02-06 09:30:58,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 398 transitions, 1057 flow [2025-02-06 09:30:58,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:58,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:58,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1282 transitions. [2025-02-06 09:30:58,580 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.813968253968254 [2025-02-06 09:30:58,580 INFO L175 Difference]: Start difference. First operand has 367 places, 373 transitions, 827 flow. Second operand 3 states and 1282 transitions. [2025-02-06 09:30:58,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 398 transitions, 1057 flow [2025-02-06 09:30:58,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 398 transitions, 1043 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:58,590 INFO L231 Difference]: Finished difference. Result has 366 places, 374 transitions, 839 flow [2025-02-06 09:30:58,590 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=815, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=839, PETRI_PLACES=366, PETRI_TRANSITIONS=374} [2025-02-06 09:30:58,591 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -83 predicate places. [2025-02-06 09:30:58,591 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 374 transitions, 839 flow [2025-02-06 09:30:58,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:58,591 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:58,591 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:30:58,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 09:30:58,592 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-02-06 09:30:58,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:58,592 INFO L85 PathProgramCache]: Analyzing trace with hash -2034420023, now seen corresponding path program 1 times [2025-02-06 09:30:58,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:58,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228956624] [2025-02-06 09:30:58,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:58,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:58,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-06 09:30:58,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-06 09:30:58,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:58,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:58,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:58,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:58,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228956624] [2025-02-06 09:30:58,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228956624] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:58,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:58,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:58,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127304134] [2025-02-06 09:30:58,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:58,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:58,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:58,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:58,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:58,635 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 525 [2025-02-06 09:30:58,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 374 transitions, 839 flow. Second operand has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:58,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:58,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 525 [2025-02-06 09:30:58,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:01,848 INFO L124 PetriNetUnfolderBase]: 11737/30511 cut-off events. [2025-02-06 09:31:01,849 INFO L125 PetriNetUnfolderBase]: For 7741/7741 co-relation queries the response was YES. [2025-02-06 09:31:02,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54534 conditions, 30511 events. 11737/30511 cut-off events. For 7741/7741 co-relation queries the response was YES. Maximal size of possible extension queue 980. Compared 334742 event pairs, 2352 based on Foata normal form. 0/26196 useless extension candidates. Maximal degree in co-relation 54404. Up to 12037 conditions per place. [2025-02-06 09:31:02,132 INFO L140 encePairwiseOnDemand]: 519/525 looper letters, 69 selfloop transitions, 4 changer transitions 0/402 dead transitions. [2025-02-06 09:31:02,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 402 transitions, 1090 flow [2025-02-06 09:31:02,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:02,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:02,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1283 transitions. [2025-02-06 09:31:02,135 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8146031746031746 [2025-02-06 09:31:02,135 INFO L175 Difference]: Start difference. First operand has 366 places, 374 transitions, 839 flow. Second operand 3 states and 1283 transitions. [2025-02-06 09:31:02,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 402 transitions, 1090 flow [2025-02-06 09:31:02,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 402 transitions, 1090 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:31:02,143 INFO L231 Difference]: Finished difference. Result has 367 places, 375 transitions, 859 flow [2025-02-06 09:31:02,144 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=835, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=859, PETRI_PLACES=367, PETRI_TRANSITIONS=375} [2025-02-06 09:31:02,144 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -82 predicate places. [2025-02-06 09:31:02,144 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 375 transitions, 859 flow [2025-02-06 09:31:02,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:02,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:02,145 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:02,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 09:31:02,145 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-02-06 09:31:02,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:02,147 INFO L85 PathProgramCache]: Analyzing trace with hash -862883158, now seen corresponding path program 1 times [2025-02-06 09:31:02,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:02,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116361362] [2025-02-06 09:31:02,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:02,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:02,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-02-06 09:31:02,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-02-06 09:31:02,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:02,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:02,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:02,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:02,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116361362] [2025-02-06 09:31:02,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116361362] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:02,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:02,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:02,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270291814] [2025-02-06 09:31:02,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:02,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:02,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:02,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:02,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:02,211 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 525 [2025-02-06 09:31:02,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 375 transitions, 859 flow. Second operand has 3 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:02,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:02,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 525 [2025-02-06 09:31:02,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:06,114 INFO L124 PetriNetUnfolderBase]: 10925/29786 cut-off events. [2025-02-06 09:31:06,115 INFO L125 PetriNetUnfolderBase]: For 9466/9466 co-relation queries the response was YES. [2025-02-06 09:31:06,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55191 conditions, 29786 events. 10925/29786 cut-off events. For 9466/9466 co-relation queries the response was YES. Maximal size of possible extension queue 965. Compared 335613 event pairs, 4510 based on Foata normal form. 0/25474 useless extension candidates. Maximal degree in co-relation 55060. Up to 14071 conditions per place. [2025-02-06 09:31:06,427 INFO L140 encePairwiseOnDemand]: 523/525 looper letters, 42 selfloop transitions, 1 changer transitions 0/374 dead transitions. [2025-02-06 09:31:06,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 374 transitions, 943 flow [2025-02-06 09:31:06,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:06,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:06,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1275 transitions. [2025-02-06 09:31:06,429 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8095238095238095 [2025-02-06 09:31:06,429 INFO L175 Difference]: Start difference. First operand has 367 places, 375 transitions, 859 flow. Second operand 3 states and 1275 transitions. [2025-02-06 09:31:06,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 374 transitions, 943 flow [2025-02-06 09:31:06,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 374 transitions, 943 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:31:06,441 INFO L231 Difference]: Finished difference. Result has 368 places, 374 transitions, 859 flow [2025-02-06 09:31:06,441 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=857, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=859, PETRI_PLACES=368, PETRI_TRANSITIONS=374} [2025-02-06 09:31:06,442 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -81 predicate places. [2025-02-06 09:31:06,442 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 374 transitions, 859 flow [2025-02-06 09:31:06,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:06,443 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:06,443 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:06,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 09:31:06,443 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-02-06 09:31:06,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:06,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1119437391, now seen corresponding path program 1 times [2025-02-06 09:31:06,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:06,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449231625] [2025-02-06 09:31:06,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:06,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:06,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-02-06 09:31:06,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-02-06 09:31:06,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:06,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:06,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:06,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:06,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449231625] [2025-02-06 09:31:06,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449231625] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:06,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:06,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:06,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315183900] [2025-02-06 09:31:06,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:06,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:06,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:06,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:06,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:06,509 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 525 [2025-02-06 09:31:06,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 374 transitions, 859 flow. Second operand has 3 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:06,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:06,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 525 [2025-02-06 09:31:06,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:10,358 INFO L124 PetriNetUnfolderBase]: 10925/29785 cut-off events. [2025-02-06 09:31:10,358 INFO L125 PetriNetUnfolderBase]: For 9466/9466 co-relation queries the response was YES. [2025-02-06 09:31:10,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55191 conditions, 29785 events. 10925/29785 cut-off events. For 9466/9466 co-relation queries the response was YES. Maximal size of possible extension queue 966. Compared 335328 event pairs, 4510 based on Foata normal form. 1/25474 useless extension candidates. Maximal degree in co-relation 55177. Up to 14071 conditions per place. [2025-02-06 09:31:10,524 INFO L140 encePairwiseOnDemand]: 523/525 looper letters, 0 selfloop transitions, 0 changer transitions 373/373 dead transitions. [2025-02-06 09:31:10,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 373 transitions, 941 flow [2025-02-06 09:31:10,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:10,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:10,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1274 transitions. [2025-02-06 09:31:10,525 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8088888888888889 [2025-02-06 09:31:10,525 INFO L175 Difference]: Start difference. First operand has 368 places, 374 transitions, 859 flow. Second operand 3 states and 1274 transitions. [2025-02-06 09:31:10,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 373 transitions, 941 flow [2025-02-06 09:31:10,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 373 transitions, 940 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:31:10,536 INFO L231 Difference]: Finished difference. Result has 368 places, 0 transitions, 0 flow [2025-02-06 09:31:10,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=856, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=368, PETRI_TRANSITIONS=0} [2025-02-06 09:31:10,536 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -81 predicate places. [2025-02-06 09:31:10,536 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 0 transitions, 0 flow [2025-02-06 09:31:10,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:10,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (146 of 147 remaining) [2025-02-06 09:31:10,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (145 of 147 remaining) [2025-02-06 09:31:10,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (144 of 147 remaining) [2025-02-06 09:31:10,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (143 of 147 remaining) [2025-02-06 09:31:10,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (142 of 147 remaining) [2025-02-06 09:31:10,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (141 of 147 remaining) [2025-02-06 09:31:10,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (140 of 147 remaining) [2025-02-06 09:31:10,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (139 of 147 remaining) [2025-02-06 09:31:10,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (138 of 147 remaining) [2025-02-06 09:31:10,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (137 of 147 remaining) [2025-02-06 09:31:10,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (136 of 147 remaining) [2025-02-06 09:31:10,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (135 of 147 remaining) [2025-02-06 09:31:10,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (134 of 147 remaining) [2025-02-06 09:31:10,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (133 of 147 remaining) [2025-02-06 09:31:10,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (132 of 147 remaining) [2025-02-06 09:31:10,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (131 of 147 remaining) [2025-02-06 09:31:10,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (130 of 147 remaining) [2025-02-06 09:31:10,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (129 of 147 remaining) [2025-02-06 09:31:10,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (128 of 147 remaining) [2025-02-06 09:31:10,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (127 of 147 remaining) [2025-02-06 09:31:10,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (126 of 147 remaining) [2025-02-06 09:31:10,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (125 of 147 remaining) [2025-02-06 09:31:10,541 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (124 of 147 remaining) [2025-02-06 09:31:10,541 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (123 of 147 remaining) [2025-02-06 09:31:10,541 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (122 of 147 remaining) [2025-02-06 09:31:10,541 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (121 of 147 remaining) [2025-02-06 09:31:10,541 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (120 of 147 remaining) [2025-02-06 09:31:10,541 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (119 of 147 remaining) [2025-02-06 09:31:10,541 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (118 of 147 remaining) [2025-02-06 09:31:10,541 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (117 of 147 remaining) [2025-02-06 09:31:10,541 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (116 of 147 remaining) [2025-02-06 09:31:10,541 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (115 of 147 remaining) [2025-02-06 09:31:10,541 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (114 of 147 remaining) [2025-02-06 09:31:10,541 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (113 of 147 remaining) [2025-02-06 09:31:10,541 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (112 of 147 remaining) [2025-02-06 09:31:10,541 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (111 of 147 remaining) [2025-02-06 09:31:10,541 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (110 of 147 remaining) [2025-02-06 09:31:10,541 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (109 of 147 remaining) [2025-02-06 09:31:10,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (108 of 147 remaining) [2025-02-06 09:31:10,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (107 of 147 remaining) [2025-02-06 09:31:10,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (106 of 147 remaining) [2025-02-06 09:31:10,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (105 of 147 remaining) [2025-02-06 09:31:10,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (104 of 147 remaining) [2025-02-06 09:31:10,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (103 of 147 remaining) [2025-02-06 09:31:10,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (102 of 147 remaining) [2025-02-06 09:31:10,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (101 of 147 remaining) [2025-02-06 09:31:10,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (100 of 147 remaining) [2025-02-06 09:31:10,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (99 of 147 remaining) [2025-02-06 09:31:10,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (98 of 147 remaining) [2025-02-06 09:31:10,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (97 of 147 remaining) [2025-02-06 09:31:10,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (96 of 147 remaining) [2025-02-06 09:31:10,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (95 of 147 remaining) [2025-02-06 09:31:10,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (94 of 147 remaining) [2025-02-06 09:31:10,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (93 of 147 remaining) [2025-02-06 09:31:10,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (92 of 147 remaining) [2025-02-06 09:31:10,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (91 of 147 remaining) [2025-02-06 09:31:10,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (90 of 147 remaining) [2025-02-06 09:31:10,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (89 of 147 remaining) [2025-02-06 09:31:10,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (88 of 147 remaining) [2025-02-06 09:31:10,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (87 of 147 remaining) [2025-02-06 09:31:10,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (86 of 147 remaining) [2025-02-06 09:31:10,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (85 of 147 remaining) [2025-02-06 09:31:10,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (84 of 147 remaining) [2025-02-06 09:31:10,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (83 of 147 remaining) [2025-02-06 09:31:10,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (82 of 147 remaining) [2025-02-06 09:31:10,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (81 of 147 remaining) [2025-02-06 09:31:10,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (80 of 147 remaining) [2025-02-06 09:31:10,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err10ASSERT_VIOLATIONDATA_RACE (79 of 147 remaining) [2025-02-06 09:31:10,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err9ASSERT_VIOLATIONDATA_RACE (78 of 147 remaining) [2025-02-06 09:31:10,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err8ASSERT_VIOLATIONDATA_RACE (77 of 147 remaining) [2025-02-06 09:31:10,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err7ASSERT_VIOLATIONDATA_RACE (76 of 147 remaining) [2025-02-06 09:31:10,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err6ASSERT_VIOLATIONDATA_RACE (75 of 147 remaining) [2025-02-06 09:31:10,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err5ASSERT_VIOLATIONDATA_RACE (74 of 147 remaining) [2025-02-06 09:31:10,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (73 of 147 remaining) [2025-02-06 09:31:10,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (72 of 147 remaining) [2025-02-06 09:31:10,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (71 of 147 remaining) [2025-02-06 09:31:10,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (70 of 147 remaining) [2025-02-06 09:31:10,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (69 of 147 remaining) [2025-02-06 09:31:10,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err10ASSERT_VIOLATIONDATA_RACE (68 of 147 remaining) [2025-02-06 09:31:10,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err9ASSERT_VIOLATIONDATA_RACE (67 of 147 remaining) [2025-02-06 09:31:10,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err8ASSERT_VIOLATIONDATA_RACE (66 of 147 remaining) [2025-02-06 09:31:10,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err7ASSERT_VIOLATIONDATA_RACE (65 of 147 remaining) [2025-02-06 09:31:10,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err6ASSERT_VIOLATIONDATA_RACE (64 of 147 remaining) [2025-02-06 09:31:10,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err5ASSERT_VIOLATIONDATA_RACE (63 of 147 remaining) [2025-02-06 09:31:10,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (62 of 147 remaining) [2025-02-06 09:31:10,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (61 of 147 remaining) [2025-02-06 09:31:10,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (60 of 147 remaining) [2025-02-06 09:31:10,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (59 of 147 remaining) [2025-02-06 09:31:10,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (58 of 147 remaining) [2025-02-06 09:31:10,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (57 of 147 remaining) [2025-02-06 09:31:10,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (56 of 147 remaining) [2025-02-06 09:31:10,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (55 of 147 remaining) [2025-02-06 09:31:10,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (54 of 147 remaining) [2025-02-06 09:31:10,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (53 of 147 remaining) [2025-02-06 09:31:10,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork3Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (52 of 147 remaining) [2025-02-06 09:31:10,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork3Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (51 of 147 remaining) [2025-02-06 09:31:10,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (50 of 147 remaining) [2025-02-06 09:31:10,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (49 of 147 remaining) [2025-02-06 09:31:10,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (48 of 147 remaining) [2025-02-06 09:31:10,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (47 of 147 remaining) [2025-02-06 09:31:10,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (46 of 147 remaining) [2025-02-06 09:31:10,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (45 of 147 remaining) [2025-02-06 09:31:10,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (44 of 147 remaining) [2025-02-06 09:31:10,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (43 of 147 remaining) [2025-02-06 09:31:10,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (42 of 147 remaining) [2025-02-06 09:31:10,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (41 of 147 remaining) [2025-02-06 09:31:10,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (40 of 147 remaining) [2025-02-06 09:31:10,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (39 of 147 remaining) [2025-02-06 09:31:10,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (38 of 147 remaining) [2025-02-06 09:31:10,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (37 of 147 remaining) [2025-02-06 09:31:10,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (36 of 147 remaining) [2025-02-06 09:31:10,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (35 of 147 remaining) [2025-02-06 09:31:10,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (34 of 147 remaining) [2025-02-06 09:31:10,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (33 of 147 remaining) [2025-02-06 09:31:10,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (32 of 147 remaining) [2025-02-06 09:31:10,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (31 of 147 remaining) [2025-02-06 09:31:10,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (30 of 147 remaining) [2025-02-06 09:31:10,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (29 of 147 remaining) [2025-02-06 09:31:10,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (28 of 147 remaining) [2025-02-06 09:31:10,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (27 of 147 remaining) [2025-02-06 09:31:10,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (26 of 147 remaining) [2025-02-06 09:31:10,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (25 of 147 remaining) [2025-02-06 09:31:10,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (24 of 147 remaining) [2025-02-06 09:31:10,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 147 remaining) [2025-02-06 09:31:10,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 147 remaining) [2025-02-06 09:31:10,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err10ASSERT_VIOLATIONDATA_RACE (21 of 147 remaining) [2025-02-06 09:31:10,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err9ASSERT_VIOLATIONDATA_RACE (20 of 147 remaining) [2025-02-06 09:31:10,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err8ASSERT_VIOLATIONDATA_RACE (19 of 147 remaining) [2025-02-06 09:31:10,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err7ASSERT_VIOLATIONDATA_RACE (18 of 147 remaining) [2025-02-06 09:31:10,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err6ASSERT_VIOLATIONDATA_RACE (17 of 147 remaining) [2025-02-06 09:31:10,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err5ASSERT_VIOLATIONDATA_RACE (16 of 147 remaining) [2025-02-06 09:31:10,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (15 of 147 remaining) [2025-02-06 09:31:10,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (14 of 147 remaining) [2025-02-06 09:31:10,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (13 of 147 remaining) [2025-02-06 09:31:10,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (12 of 147 remaining) [2025-02-06 09:31:10,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (11 of 147 remaining) [2025-02-06 09:31:10,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err10ASSERT_VIOLATIONDATA_RACE (10 of 147 remaining) [2025-02-06 09:31:10,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err9ASSERT_VIOLATIONDATA_RACE (9 of 147 remaining) [2025-02-06 09:31:10,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err8ASSERT_VIOLATIONDATA_RACE (8 of 147 remaining) [2025-02-06 09:31:10,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err7ASSERT_VIOLATIONDATA_RACE (7 of 147 remaining) [2025-02-06 09:31:10,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err6ASSERT_VIOLATIONDATA_RACE (6 of 147 remaining) [2025-02-06 09:31:10,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err5ASSERT_VIOLATIONDATA_RACE (5 of 147 remaining) [2025-02-06 09:31:10,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (4 of 147 remaining) [2025-02-06 09:31:10,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (3 of 147 remaining) [2025-02-06 09:31:10,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (2 of 147 remaining) [2025-02-06 09:31:10,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (1 of 147 remaining) [2025-02-06 09:31:10,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (0 of 147 remaining) [2025-02-06 09:31:10,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 09:31:10,548 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:10,552 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 09:31:10,552 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 09:31:10,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 09:31:10 BasicIcfg [2025-02-06 09:31:10,557 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 09:31:10,558 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 09:31:10,558 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 09:31:10,558 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 09:31:10,559 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:30:42" (3/4) ... [2025-02-06 09:31:10,560 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 09:31:10,562 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-06 09:31:10,562 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-06 09:31:10,562 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-06 09:31:10,562 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-02-06 09:31:10,562 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread5 [2025-02-06 09:31:10,562 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread6 [2025-02-06 09:31:10,566 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2025-02-06 09:31:10,567 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-06 09:31:10,567 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 09:31:10,567 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 09:31:10,630 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 09:31:10,630 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 09:31:10,630 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 09:31:10,631 INFO L158 Benchmark]: Toolchain (without parser) took 29980.86ms. Allocated memory was 167.8MB in the beginning and 5.9GB in the end (delta: 5.7GB). Free memory was 133.2MB in the beginning and 4.0GB in the end (delta: -3.9GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2025-02-06 09:31:10,631 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:31:10,631 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.35ms. Allocated memory is still 167.8MB. Free memory was 133.2MB in the beginning and 118.9MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 09:31:10,631 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.58ms. Allocated memory is still 167.8MB. Free memory was 118.9MB in the beginning and 114.6MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:31:10,631 INFO L158 Benchmark]: Boogie Preprocessor took 37.39ms. Allocated memory is still 167.8MB. Free memory was 114.6MB in the beginning and 112.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:31:10,632 INFO L158 Benchmark]: IcfgBuilder took 1161.48ms. Allocated memory is still 167.8MB. Free memory was 112.7MB in the beginning and 69.4MB in the end (delta: 43.3MB). Peak memory consumption was 83.4MB. Max. memory is 16.1GB. [2025-02-06 09:31:10,632 INFO L158 Benchmark]: TraceAbstraction took 28481.67ms. Allocated memory was 167.8MB in the beginning and 5.9GB in the end (delta: 5.7GB). Free memory was 68.5MB in the beginning and 4.0GB in the end (delta: -4.0GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2025-02-06 09:31:10,632 INFO L158 Benchmark]: Witness Printer took 72.63ms. Allocated memory is still 5.9GB. Free memory was 4.0GB in the beginning and 4.0GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:31:10,633 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 189.35ms. Allocated memory is still 167.8MB. Free memory was 133.2MB in the beginning and 118.9MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.58ms. Allocated memory is still 167.8MB. Free memory was 118.9MB in the beginning and 114.6MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.39ms. Allocated memory is still 167.8MB. Free memory was 114.6MB in the beginning and 112.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1161.48ms. Allocated memory is still 167.8MB. Free memory was 112.7MB in the beginning and 69.4MB in the end (delta: 43.3MB). Peak memory consumption was 83.4MB. Max. memory is 16.1GB. * TraceAbstraction took 28481.67ms. Allocated memory was 167.8MB in the beginning and 5.9GB in the end (delta: 5.7GB). Free memory was 68.5MB in the beginning and 4.0GB in the end (delta: -4.0GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. * Witness Printer took 72.63ms. Allocated memory is still 5.9GB. Free memory was 4.0GB in the beginning and 4.0GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 143]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 144]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 145]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 146]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 147]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 148]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 149]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 150]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 151]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 152]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 153]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 154]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 155]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 156]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 177]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 156]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 165]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 165]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 13 procedures, 625 locations, 147 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 28.3s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 26.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 591 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 278 mSDsluCounter, 115 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 92 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1616 IncrementalHoareTripleChecker+Invalid, 1708 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 92 mSolverCounterUnsat, 115 mSDtfsCounter, 1616 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=956occurred in iteration=0, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2944 NumberOfCodeBlocks, 2944 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2921 ConstructedInterpolants, 0 QuantifiedInterpolants, 3080 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 83 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 09:31:10,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE