./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-commit-1.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-commit-1.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 73c55a951ef2b92a665c2c32d76e33a5a03bdbde67ee3c8e6748faf493088c7e --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:01:40,920 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:01:40,982 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-09 07:01:40,988 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:01:40,990 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:01:41,019 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:01:41,021 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:01:41,022 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:01:41,023 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:01:41,025 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:01:41,025 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:01:41,026 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:01:41,026 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:01:41,026 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:01:41,028 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 07:01:41,028 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:01:41,029 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:01:41,029 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:01:41,029 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:01:41,029 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 07:01:41,030 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:01:41,030 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 07:01:41,031 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-09 07:01:41,031 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:01:41,031 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:01:41,031 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:01:41,032 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 07:01:41,032 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:01:41,032 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:01:41,033 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:01:41,033 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:01:41,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:01:41,034 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:01:41,034 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:01:41,034 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 07:01:41,035 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:01:41,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:01:41,036 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:01:41,036 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:01:41,036 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:01:41,036 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:01:41,037 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/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 -> 73c55a951ef2b92a665c2c32d76e33a5a03bdbde67ee3c8e6748faf493088c7e [2024-11-09 07:01:41,347 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:01:41,372 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:01:41,376 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:01:41,377 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:01:41,378 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:01:41,379 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-commit-1.wvr.c [2024-11-09 07:01:42,876 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:01:43,092 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:01:43,093 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-commit-1.wvr.c [2024-11-09 07:01:43,101 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03351725a/4c9763904d2d4df0b513e5eb21db87f4/FLAG22718d1e8 [2024-11-09 07:01:43,117 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03351725a/4c9763904d2d4df0b513e5eb21db87f4 [2024-11-09 07:01:43,120 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:01:43,121 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:01:43,123 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:01:43,123 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:01:43,131 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:01:43,132 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:01:43" (1/1) ... [2024-11-09 07:01:43,133 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58119ca7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:43, skipping insertion in model container [2024-11-09 07:01:43,134 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:01:43" (1/1) ... [2024-11-09 07:01:43,162 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:01:43,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:01:43,394 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:01:43,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:01:43,468 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:01:43,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:43 WrapperNode [2024-11-09 07:01:43,469 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:01:43,469 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:01:43,470 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:01:43,470 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:01:43,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:43" (1/1) ... [2024-11-09 07:01:43,490 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:43" (1/1) ... [2024-11-09 07:01:43,532 INFO L138 Inliner]: procedures = 24, calls = 54, calls flagged for inlining = 21, calls inlined = 25, statements flattened = 706 [2024-11-09 07:01:43,533 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:01:43,533 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:01:43,534 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:01:43,537 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:01:43,546 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:43" (1/1) ... [2024-11-09 07:01:43,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:43" (1/1) ... [2024-11-09 07:01:43,555 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:43" (1/1) ... [2024-11-09 07:01:43,555 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:43" (1/1) ... [2024-11-09 07:01:43,586 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:43" (1/1) ... [2024-11-09 07:01:43,596 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:43" (1/1) ... [2024-11-09 07:01:43,602 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:43" (1/1) ... [2024-11-09 07:01:43,604 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:43" (1/1) ... [2024-11-09 07:01:43,609 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:01:43,610 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:01:43,610 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:01:43,611 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:01:43,613 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:43" (1/1) ... [2024-11-09 07:01:43,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:01:43,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:01:43,648 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 07:01:43,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 07:01:43,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:01:43,703 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-09 07:01:43,703 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-09 07:01:43,704 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-09 07:01:43,704 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-09 07:01:43,704 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-09 07:01:43,704 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-09 07:01:43,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 07:01:43,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 07:01:43,704 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-09 07:01:43,704 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-09 07:01:43,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:01:43,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:01:43,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:01:43,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 07:01:43,709 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 07:01:43,959 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:01:43,961 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:01:44,941 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 07:01:44,942 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:01:45,841 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:01:45,842 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-09 07:01:45,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:01:45 BoogieIcfgContainer [2024-11-09 07:01:45,843 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:01:45,845 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:01:45,845 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:01:45,849 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:01:45,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:01:43" (1/3) ... [2024-11-09 07:01:45,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@540e9856 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:01:45, skipping insertion in model container [2024-11-09 07:01:45,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:43" (2/3) ... [2024-11-09 07:01:45,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@540e9856 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:01:45, skipping insertion in model container [2024-11-09 07:01:45,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:01:45" (3/3) ... [2024-11-09 07:01:45,853 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-commit-1.wvr.c [2024-11-09 07:01:45,871 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:01:45,872 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 113 error locations. [2024-11-09 07:01:45,873 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 07:01:46,039 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-09 07:01:46,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 462 places, 471 transitions, 963 flow [2024-11-09 07:01:46,267 INFO L124 PetriNetUnfolderBase]: 19/468 cut-off events. [2024-11-09 07:01:46,268 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-09 07:01:46,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 481 conditions, 468 events. 19/468 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 764 event pairs, 0 based on Foata normal form. 0/336 useless extension candidates. Maximal degree in co-relation 413. Up to 2 conditions per place. [2024-11-09 07:01:46,281 INFO L82 GeneralOperation]: Start removeDead. Operand has 462 places, 471 transitions, 963 flow [2024-11-09 07:01:46,293 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 443 places, 451 transitions, 920 flow [2024-11-09 07:01:46,304 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:01:46,313 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;@3e407875, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:01:46,314 INFO L334 AbstractCegarLoop]: Starting to check reachability of 204 error locations. [2024-11-09 07:01:46,350 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 07:01:46,350 INFO L124 PetriNetUnfolderBase]: 0/29 cut-off events. [2024-11-09 07:01:46,351 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 07:01:46,351 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:46,352 INFO L204 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] [2024-11-09 07:01:46,353 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2024-11-09 07:01:46,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:46,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1916066657, now seen corresponding path program 1 times [2024-11-09 07:01:46,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:46,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509891806] [2024-11-09 07:01:46,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:46,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:46,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:46,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:46,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:46,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509891806] [2024-11-09 07:01:46,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509891806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:46,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:46,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:46,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167913854] [2024-11-09 07:01:46,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:46,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:46,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:46,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:46,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:46,667 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 471 [2024-11-09 07:01:46,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 451 transitions, 920 flow. Second operand has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 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) [2024-11-09 07:01:46,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:46,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 471 [2024-11-09 07:01:46,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:47,112 INFO L124 PetriNetUnfolderBase]: 153/856 cut-off events. [2024-11-09 07:01:47,113 INFO L125 PetriNetUnfolderBase]: For 83/83 co-relation queries the response was YES. [2024-11-09 07:01:47,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1151 conditions, 856 events. 153/856 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3595 event pairs, 82 based on Foata normal form. 108/876 useless extension candidates. Maximal degree in co-relation 690. Up to 228 conditions per place. [2024-11-09 07:01:47,123 INFO L140 encePairwiseOnDemand]: 368/471 looper letters, 18 selfloop transitions, 2 changer transitions 6/350 dead transitions. [2024-11-09 07:01:47,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 350 transitions, 758 flow [2024-11-09 07:01:47,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:47,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:47,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1162 transitions. [2024-11-09 07:01:47,144 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8223637650389243 [2024-11-09 07:01:47,149 INFO L175 Difference]: Start difference. First operand has 443 places, 451 transitions, 920 flow. Second operand 3 states and 1162 transitions. [2024-11-09 07:01:47,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 350 transitions, 758 flow [2024-11-09 07:01:47,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 350 transitions, 746 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-09 07:01:47,165 INFO L231 Difference]: Finished difference. Result has 350 places, 344 transitions, 698 flow [2024-11-09 07:01:47,169 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=706, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=698, PETRI_PLACES=350, PETRI_TRANSITIONS=344} [2024-11-09 07:01:47,175 INFO L277 CegarLoopForPetriNet]: 443 programPoint places, -93 predicate places. [2024-11-09 07:01:47,176 INFO L471 AbstractCegarLoop]: Abstraction has has 350 places, 344 transitions, 698 flow [2024-11-09 07:01:47,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 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) [2024-11-09 07:01:47,177 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:47,177 INFO L204 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] [2024-11-09 07:01:47,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:01:47,178 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2024-11-09 07:01:47,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:47,179 INFO L85 PathProgramCache]: Analyzing trace with hash -362855725, now seen corresponding path program 1 times [2024-11-09 07:01:47,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:47,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898645667] [2024-11-09 07:01:47,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:47,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:47,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:47,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:47,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:47,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898645667] [2024-11-09 07:01:47,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898645667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:47,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:47,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:47,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114704235] [2024-11-09 07:01:47,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:47,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:47,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:47,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:47,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:47,295 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 471 [2024-11-09 07:01:47,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 344 transitions, 698 flow. Second operand has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 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) [2024-11-09 07:01:47,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:47,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 471 [2024-11-09 07:01:47,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:47,543 INFO L124 PetriNetUnfolderBase]: 153/849 cut-off events. [2024-11-09 07:01:47,544 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-11-09 07:01:47,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1101 conditions, 849 events. 153/849 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3591 event pairs, 82 based on Foata normal form. 0/768 useless extension candidates. Maximal degree in co-relation 1064. Up to 228 conditions per place. [2024-11-09 07:01:47,551 INFO L140 encePairwiseOnDemand]: 468/471 looper letters, 18 selfloop transitions, 2 changer transitions 0/343 dead transitions. [2024-11-09 07:01:47,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 343 transitions, 736 flow [2024-11-09 07:01:47,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:47,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:47,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1062 transitions. [2024-11-09 07:01:47,555 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7515923566878981 [2024-11-09 07:01:47,555 INFO L175 Difference]: Start difference. First operand has 350 places, 344 transitions, 698 flow. Second operand 3 states and 1062 transitions. [2024-11-09 07:01:47,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 343 transitions, 736 flow [2024-11-09 07:01:47,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 343 transitions, 732 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:47,562 INFO L231 Difference]: Finished difference. Result has 343 places, 343 transitions, 696 flow [2024-11-09 07:01:47,563 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=696, PETRI_PLACES=343, PETRI_TRANSITIONS=343} [2024-11-09 07:01:47,563 INFO L277 CegarLoopForPetriNet]: 443 programPoint places, -100 predicate places. [2024-11-09 07:01:47,564 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 343 transitions, 696 flow [2024-11-09 07:01:47,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 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) [2024-11-09 07:01:47,564 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:47,565 INFO L204 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] [2024-11-09 07:01:47,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:01:47,565 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2024-11-09 07:01:47,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:47,566 INFO L85 PathProgramCache]: Analyzing trace with hash -7007153, now seen corresponding path program 1 times [2024-11-09 07:01:47,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:47,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278081633] [2024-11-09 07:01:47,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:47,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:47,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:47,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:47,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278081633] [2024-11-09 07:01:47,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278081633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:47,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:47,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:47,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757849838] [2024-11-09 07:01:47,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:47,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:47,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:47,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:47,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:47,657 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 471 [2024-11-09 07:01:47,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 343 transitions, 696 flow. Second operand has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 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) [2024-11-09 07:01:47,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:47,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 471 [2024-11-09 07:01:47,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:47,904 INFO L124 PetriNetUnfolderBase]: 153/848 cut-off events. [2024-11-09 07:01:47,905 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-11-09 07:01:47,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1100 conditions, 848 events. 153/848 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3591 event pairs, 82 based on Foata normal form. 0/768 useless extension candidates. Maximal degree in co-relation 1055. Up to 228 conditions per place. [2024-11-09 07:01:47,909 INFO L140 encePairwiseOnDemand]: 468/471 looper letters, 18 selfloop transitions, 2 changer transitions 0/342 dead transitions. [2024-11-09 07:01:47,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 342 transitions, 734 flow [2024-11-09 07:01:47,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:47,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:47,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1062 transitions. [2024-11-09 07:01:47,913 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7515923566878981 [2024-11-09 07:01:47,913 INFO L175 Difference]: Start difference. First operand has 343 places, 343 transitions, 696 flow. Second operand 3 states and 1062 transitions. [2024-11-09 07:01:47,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 342 transitions, 734 flow [2024-11-09 07:01:47,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 342 transitions, 730 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:47,919 INFO L231 Difference]: Finished difference. Result has 342 places, 342 transitions, 694 flow [2024-11-09 07:01:47,920 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=694, PETRI_PLACES=342, PETRI_TRANSITIONS=342} [2024-11-09 07:01:47,921 INFO L277 CegarLoopForPetriNet]: 443 programPoint places, -101 predicate places. [2024-11-09 07:01:47,922 INFO L471 AbstractCegarLoop]: Abstraction has has 342 places, 342 transitions, 694 flow [2024-11-09 07:01:47,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 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) [2024-11-09 07:01:47,923 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:47,923 INFO L204 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] [2024-11-09 07:01:47,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:01:47,924 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2024-11-09 07:01:47,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:47,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1337951056, now seen corresponding path program 1 times [2024-11-09 07:01:47,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:47,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418220727] [2024-11-09 07:01:47,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:47,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:47,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:47,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:47,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418220727] [2024-11-09 07:01:47,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418220727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:47,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:47,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:47,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888685454] [2024-11-09 07:01:47,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:47,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:47,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:47,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:47,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:48,006 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 471 [2024-11-09 07:01:48,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 342 transitions, 694 flow. Second operand has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 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) [2024-11-09 07:01:48,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:48,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 471 [2024-11-09 07:01:48,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:48,235 INFO L124 PetriNetUnfolderBase]: 174/813 cut-off events. [2024-11-09 07:01:48,235 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-11-09 07:01:48,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1101 conditions, 813 events. 174/813 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3163 event pairs, 25 based on Foata normal form. 0/755 useless extension candidates. Maximal degree in co-relation 1048. Up to 203 conditions per place. [2024-11-09 07:01:48,241 INFO L140 encePairwiseOnDemand]: 468/471 looper letters, 25 selfloop transitions, 2 changer transitions 0/351 dead transitions. [2024-11-09 07:01:48,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 351 transitions, 771 flow [2024-11-09 07:01:48,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:48,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:48,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1081 transitions. [2024-11-09 07:01:48,244 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7650389242745931 [2024-11-09 07:01:48,244 INFO L175 Difference]: Start difference. First operand has 342 places, 342 transitions, 694 flow. Second operand 3 states and 1081 transitions. [2024-11-09 07:01:48,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 351 transitions, 771 flow [2024-11-09 07:01:48,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 351 transitions, 767 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:48,251 INFO L231 Difference]: Finished difference. Result has 342 places, 342 transitions, 698 flow [2024-11-09 07:01:48,252 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=698, PETRI_PLACES=342, PETRI_TRANSITIONS=342} [2024-11-09 07:01:48,253 INFO L277 CegarLoopForPetriNet]: 443 programPoint places, -101 predicate places. [2024-11-09 07:01:48,253 INFO L471 AbstractCegarLoop]: Abstraction has has 342 places, 342 transitions, 698 flow [2024-11-09 07:01:48,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 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) [2024-11-09 07:01:48,254 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:48,254 INFO L204 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] [2024-11-09 07:01:48,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:01:48,255 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2024-11-09 07:01:48,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:48,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1760817996, now seen corresponding path program 1 times [2024-11-09 07:01:48,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:48,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864674769] [2024-11-09 07:01:48,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:48,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:48,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:48,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:48,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:48,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864674769] [2024-11-09 07:01:48,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864674769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:48,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:48,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:48,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561903940] [2024-11-09 07:01:48,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:48,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:48,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:48,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:48,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:48,344 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 471 [2024-11-09 07:01:48,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 342 transitions, 698 flow. Second operand has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 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) [2024-11-09 07:01:48,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:48,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 471 [2024-11-09 07:01:48,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:48,625 INFO L124 PetriNetUnfolderBase]: 174/924 cut-off events. [2024-11-09 07:01:48,625 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2024-11-09 07:01:48,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1249 conditions, 924 events. 174/924 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4172 event pairs, 101 based on Foata normal form. 0/847 useless extension candidates. Maximal degree in co-relation 524. Up to 264 conditions per place. [2024-11-09 07:01:48,633 INFO L140 encePairwiseOnDemand]: 468/471 looper letters, 18 selfloop transitions, 2 changer transitions 0/341 dead transitions. [2024-11-09 07:01:48,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 341 transitions, 736 flow [2024-11-09 07:01:48,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:48,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:48,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1064 transitions. [2024-11-09 07:01:48,636 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7530077848549186 [2024-11-09 07:01:48,636 INFO L175 Difference]: Start difference. First operand has 342 places, 342 transitions, 698 flow. Second operand 3 states and 1064 transitions. [2024-11-09 07:01:48,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 341 transitions, 736 flow [2024-11-09 07:01:48,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 341 transitions, 734 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:01:48,642 INFO L231 Difference]: Finished difference. Result has 342 places, 341 transitions, 698 flow [2024-11-09 07:01:48,642 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=698, PETRI_PLACES=342, PETRI_TRANSITIONS=341} [2024-11-09 07:01:48,643 INFO L277 CegarLoopForPetriNet]: 443 programPoint places, -101 predicate places. [2024-11-09 07:01:48,643 INFO L471 AbstractCegarLoop]: Abstraction has has 342 places, 341 transitions, 698 flow [2024-11-09 07:01:48,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 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) [2024-11-09 07:01:48,644 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:48,645 INFO L204 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] [2024-11-09 07:01:48,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:01:48,645 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2024-11-09 07:01:48,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:48,646 INFO L85 PathProgramCache]: Analyzing trace with hash -2091035582, now seen corresponding path program 1 times [2024-11-09 07:01:48,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:48,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490560621] [2024-11-09 07:01:48,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:48,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:48,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:48,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:48,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:48,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490560621] [2024-11-09 07:01:48,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490560621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:48,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:48,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:48,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299975544] [2024-11-09 07:01:48,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:48,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:48,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:48,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:48,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:48,709 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 471 [2024-11-09 07:01:48,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 341 transitions, 698 flow. Second operand has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 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) [2024-11-09 07:01:48,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:48,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 471 [2024-11-09 07:01:48,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:48,922 INFO L124 PetriNetUnfolderBase]: 174/923 cut-off events. [2024-11-09 07:01:48,922 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-09 07:01:48,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1237 conditions, 923 events. 174/923 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4204 event pairs, 101 based on Foata normal form. 0/847 useless extension candidates. Maximal degree in co-relation 1175. Up to 262 conditions per place. [2024-11-09 07:01:48,927 INFO L140 encePairwiseOnDemand]: 469/471 looper letters, 17 selfloop transitions, 1 changer transitions 0/340 dead transitions. [2024-11-09 07:01:48,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 340 transitions, 732 flow [2024-11-09 07:01:48,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:48,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:48,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1071 transitions. [2024-11-09 07:01:48,931 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7579617834394905 [2024-11-09 07:01:48,931 INFO L175 Difference]: Start difference. First operand has 342 places, 341 transitions, 698 flow. Second operand 3 states and 1071 transitions. [2024-11-09 07:01:48,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 340 transitions, 732 flow [2024-11-09 07:01:48,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 340 transitions, 728 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:48,937 INFO L231 Difference]: Finished difference. Result has 341 places, 340 transitions, 694 flow [2024-11-09 07:01:48,937 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=694, PETRI_PLACES=341, PETRI_TRANSITIONS=340} [2024-11-09 07:01:48,938 INFO L277 CegarLoopForPetriNet]: 443 programPoint places, -102 predicate places. [2024-11-09 07:01:48,938 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 340 transitions, 694 flow [2024-11-09 07:01:48,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 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) [2024-11-09 07:01:48,939 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:48,939 INFO L204 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] [2024-11-09 07:01:48,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:01:48,940 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2024-11-09 07:01:48,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:48,940 INFO L85 PathProgramCache]: Analyzing trace with hash 596313926, now seen corresponding path program 1 times [2024-11-09 07:01:48,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:48,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363012472] [2024-11-09 07:01:48,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:48,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:49,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:49,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:49,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363012472] [2024-11-09 07:01:49,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363012472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:49,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:49,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:49,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258327757] [2024-11-09 07:01:49,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:49,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:49,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:49,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:49,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:49,032 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 471 [2024-11-09 07:01:49,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 340 transitions, 694 flow. Second operand has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 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) [2024-11-09 07:01:49,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:49,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 471 [2024-11-09 07:01:49,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:49,240 INFO L124 PetriNetUnfolderBase]: 174/922 cut-off events. [2024-11-09 07:01:49,243 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-09 07:01:49,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1237 conditions, 922 events. 174/922 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4199 event pairs, 101 based on Foata normal form. 0/847 useless extension candidates. Maximal degree in co-relation 1175. Up to 264 conditions per place. [2024-11-09 07:01:49,250 INFO L140 encePairwiseOnDemand]: 468/471 looper letters, 18 selfloop transitions, 2 changer transitions 0/339 dead transitions. [2024-11-09 07:01:49,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 339 transitions, 732 flow [2024-11-09 07:01:49,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:49,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:49,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1064 transitions. [2024-11-09 07:01:49,253 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7530077848549186 [2024-11-09 07:01:49,253 INFO L175 Difference]: Start difference. First operand has 341 places, 340 transitions, 694 flow. Second operand 3 states and 1064 transitions. [2024-11-09 07:01:49,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 339 transitions, 732 flow [2024-11-09 07:01:49,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 339 transitions, 731 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:01:49,260 INFO L231 Difference]: Finished difference. Result has 341 places, 339 transitions, 695 flow [2024-11-09 07:01:49,260 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=695, PETRI_PLACES=341, PETRI_TRANSITIONS=339} [2024-11-09 07:01:49,262 INFO L277 CegarLoopForPetriNet]: 443 programPoint places, -102 predicate places. [2024-11-09 07:01:49,262 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 339 transitions, 695 flow [2024-11-09 07:01:49,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 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) [2024-11-09 07:01:49,263 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:49,264 INFO L204 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] [2024-11-09 07:01:49,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:01:49,264 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2024-11-09 07:01:49,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:49,265 INFO L85 PathProgramCache]: Analyzing trace with hash 295907908, now seen corresponding path program 1 times [2024-11-09 07:01:49,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:49,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633541114] [2024-11-09 07:01:49,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:49,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:49,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:49,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:49,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:49,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633541114] [2024-11-09 07:01:49,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633541114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:49,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:49,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:01:49,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114700660] [2024-11-09 07:01:49,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:49,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:01:49,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:49,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:01:49,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:01:49,979 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 471 [2024-11-09 07:01:49,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 339 transitions, 695 flow. Second operand has 6 states, 6 states have (on average 314.5) internal successors, (1887), 6 states have internal predecessors, (1887), 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) [2024-11-09 07:01:49,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:49,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 471 [2024-11-09 07:01:49,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:50,221 INFO L124 PetriNetUnfolderBase]: 174/919 cut-off events. [2024-11-09 07:01:50,221 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-09 07:01:50,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1270 conditions, 919 events. 174/919 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4187 event pairs, 101 based on Foata normal form. 0/847 useless extension candidates. Maximal degree in co-relation 1209. Up to 285 conditions per place. [2024-11-09 07:01:50,228 INFO L140 encePairwiseOnDemand]: 453/471 looper letters, 39 selfloop transitions, 15 changer transitions 0/336 dead transitions. [2024-11-09 07:01:50,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 336 transitions, 797 flow [2024-11-09 07:01:50,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:01:50,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:01:50,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1934 transitions. [2024-11-09 07:01:50,233 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6843595187544232 [2024-11-09 07:01:50,233 INFO L175 Difference]: Start difference. First operand has 341 places, 339 transitions, 695 flow. Second operand 6 states and 1934 transitions. [2024-11-09 07:01:50,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 336 transitions, 797 flow [2024-11-09 07:01:50,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 336 transitions, 793 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:50,239 INFO L231 Difference]: Finished difference. Result has 341 places, 336 transitions, 715 flow [2024-11-09 07:01:50,240 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=715, PETRI_PLACES=341, PETRI_TRANSITIONS=336} [2024-11-09 07:01:50,243 INFO L277 CegarLoopForPetriNet]: 443 programPoint places, -102 predicate places. [2024-11-09 07:01:50,243 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 336 transitions, 715 flow [2024-11-09 07:01:50,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 314.5) internal successors, (1887), 6 states have internal predecessors, (1887), 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) [2024-11-09 07:01:50,245 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:50,245 INFO L204 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] [2024-11-09 07:01:50,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:01:50,246 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2024-11-09 07:01:50,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:50,246 INFO L85 PathProgramCache]: Analyzing trace with hash -442327680, now seen corresponding path program 1 times [2024-11-09 07:01:50,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:50,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748513331] [2024-11-09 07:01:50,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:50,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:50,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:50,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:50,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:50,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748513331] [2024-11-09 07:01:50,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748513331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:50,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:50,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:50,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505823857] [2024-11-09 07:01:50,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:50,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:50,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:50,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:50,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:50,322 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 471 [2024-11-09 07:01:50,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 336 transitions, 715 flow. Second operand has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 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) [2024-11-09 07:01:50,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:50,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 471 [2024-11-09 07:01:50,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:50,512 INFO L124 PetriNetUnfolderBase]: 174/918 cut-off events. [2024-11-09 07:01:50,512 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-09 07:01:50,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1249 conditions, 918 events. 174/918 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4188 event pairs, 101 based on Foata normal form. 0/847 useless extension candidates. Maximal degree in co-relation 1200. Up to 265 conditions per place. [2024-11-09 07:01:50,519 INFO L140 encePairwiseOnDemand]: 468/471 looper letters, 19 selfloop transitions, 2 changer transitions 0/335 dead transitions. [2024-11-09 07:01:50,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 335 transitions, 755 flow [2024-11-09 07:01:50,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:50,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:50,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1062 transitions. [2024-11-09 07:01:50,523 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7515923566878981 [2024-11-09 07:01:50,523 INFO L175 Difference]: Start difference. First operand has 341 places, 336 transitions, 715 flow. Second operand 3 states and 1062 transitions. [2024-11-09 07:01:50,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 335 transitions, 755 flow [2024-11-09 07:01:50,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 335 transitions, 725 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 07:01:50,529 INFO L231 Difference]: Finished difference. Result has 337 places, 335 transitions, 687 flow [2024-11-09 07:01:50,529 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=687, PETRI_PLACES=337, PETRI_TRANSITIONS=335} [2024-11-09 07:01:50,530 INFO L277 CegarLoopForPetriNet]: 443 programPoint places, -106 predicate places. [2024-11-09 07:01:50,530 INFO L471 AbstractCegarLoop]: Abstraction has has 337 places, 335 transitions, 687 flow [2024-11-09 07:01:50,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 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) [2024-11-09 07:01:50,531 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:50,531 INFO L204 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] [2024-11-09 07:01:50,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:01:50,532 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2024-11-09 07:01:50,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:50,532 INFO L85 PathProgramCache]: Analyzing trace with hash -200455728, now seen corresponding path program 1 times [2024-11-09 07:01:50,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:50,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621768129] [2024-11-09 07:01:50,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:50,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:50,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:50,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:50,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:50,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621768129] [2024-11-09 07:01:50,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621768129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:50,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:50,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:50,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105645197] [2024-11-09 07:01:50,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:50,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:50,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:50,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:50,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:50,596 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 471 [2024-11-09 07:01:50,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 335 transitions, 687 flow. Second operand has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 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) [2024-11-09 07:01:50,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:50,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 471 [2024-11-09 07:01:50,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:50,876 INFO L124 PetriNetUnfolderBase]: 221/1018 cut-off events. [2024-11-09 07:01:50,876 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2024-11-09 07:01:50,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1413 conditions, 1018 events. 221/1018 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4993 event pairs, 70 based on Foata normal form. 0/954 useless extension candidates. Maximal degree in co-relation 1352. Up to 172 conditions per place. [2024-11-09 07:01:50,884 INFO L140 encePairwiseOnDemand]: 468/471 looper letters, 28 selfloop transitions, 2 changer transitions 0/346 dead transitions. [2024-11-09 07:01:50,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 346 transitions, 776 flow [2024-11-09 07:01:50,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:50,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:50,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1082 transitions. [2024-11-09 07:01:50,887 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7657466383581033 [2024-11-09 07:01:50,887 INFO L175 Difference]: Start difference. First operand has 337 places, 335 transitions, 687 flow. Second operand 3 states and 1082 transitions. [2024-11-09 07:01:50,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 346 transitions, 776 flow [2024-11-09 07:01:50,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 346 transitions, 772 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:50,893 INFO L231 Difference]: Finished difference. Result has 337 places, 335 transitions, 691 flow [2024-11-09 07:01:50,894 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=681, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=691, PETRI_PLACES=337, PETRI_TRANSITIONS=335} [2024-11-09 07:01:50,895 INFO L277 CegarLoopForPetriNet]: 443 programPoint places, -106 predicate places. [2024-11-09 07:01:50,895 INFO L471 AbstractCegarLoop]: Abstraction has has 337 places, 335 transitions, 691 flow [2024-11-09 07:01:50,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 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) [2024-11-09 07:01:50,897 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:50,897 INFO L204 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] [2024-11-09 07:01:50,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 07:01:50,897 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2024-11-09 07:01:50,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:50,898 INFO L85 PathProgramCache]: Analyzing trace with hash 971814713, now seen corresponding path program 1 times [2024-11-09 07:01:50,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:50,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8529190] [2024-11-09 07:01:50,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:50,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:50,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:50,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:50,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:50,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8529190] [2024-11-09 07:01:50,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8529190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:50,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:50,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:50,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247537406] [2024-11-09 07:01:50,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:50,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:50,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:50,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:50,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:50,946 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 471 [2024-11-09 07:01:50,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 335 transitions, 691 flow. Second operand has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 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) [2024-11-09 07:01:50,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:50,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 471 [2024-11-09 07:01:50,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:51,186 INFO L124 PetriNetUnfolderBase]: 221/1001 cut-off events. [2024-11-09 07:01:51,186 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2024-11-09 07:01:51,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1467 conditions, 1001 events. 221/1001 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4851 event pairs, 138 based on Foata normal form. 0/931 useless extension candidates. Maximal degree in co-relation 1404. Up to 337 conditions per place. [2024-11-09 07:01:51,192 INFO L140 encePairwiseOnDemand]: 468/471 looper letters, 19 selfloop transitions, 2 changer transitions 0/334 dead transitions. [2024-11-09 07:01:51,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 334 transitions, 731 flow [2024-11-09 07:01:51,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:51,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:51,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1064 transitions. [2024-11-09 07:01:51,195 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7530077848549186 [2024-11-09 07:01:51,195 INFO L175 Difference]: Start difference. First operand has 337 places, 335 transitions, 691 flow. Second operand 3 states and 1064 transitions. [2024-11-09 07:01:51,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 334 transitions, 731 flow [2024-11-09 07:01:51,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 334 transitions, 729 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:01:51,201 INFO L231 Difference]: Finished difference. Result has 337 places, 334 transitions, 691 flow [2024-11-09 07:01:51,202 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=691, PETRI_PLACES=337, PETRI_TRANSITIONS=334} [2024-11-09 07:01:51,202 INFO L277 CegarLoopForPetriNet]: 443 programPoint places, -106 predicate places. [2024-11-09 07:01:51,202 INFO L471 AbstractCegarLoop]: Abstraction has has 337 places, 334 transitions, 691 flow [2024-11-09 07:01:51,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 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) [2024-11-09 07:01:51,203 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:51,203 INFO L204 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] [2024-11-09 07:01:51,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 07:01:51,204 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2024-11-09 07:01:51,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:51,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1663307383, now seen corresponding path program 1 times [2024-11-09 07:01:51,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:51,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271807684] [2024-11-09 07:01:51,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:51,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:51,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:51,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:51,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:51,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271807684] [2024-11-09 07:01:51,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271807684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:51,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:51,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:51,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201860543] [2024-11-09 07:01:51,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:51,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:51,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:51,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:51,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:51,257 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 471 [2024-11-09 07:01:51,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 334 transitions, 691 flow. Second operand has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 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) [2024-11-09 07:01:51,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:51,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 471 [2024-11-09 07:01:51,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:51,477 INFO L124 PetriNetUnfolderBase]: 221/1000 cut-off events. [2024-11-09 07:01:51,478 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2024-11-09 07:01:51,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1446 conditions, 1000 events. 221/1000 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4847 event pairs, 138 based on Foata normal form. 0/931 useless extension candidates. Maximal degree in co-relation 1383. Up to 338 conditions per place. [2024-11-09 07:01:51,485 INFO L140 encePairwiseOnDemand]: 468/471 looper letters, 20 selfloop transitions, 2 changer transitions 0/333 dead transitions. [2024-11-09 07:01:51,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 333 transitions, 733 flow [2024-11-09 07:01:51,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:51,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:51,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1062 transitions. [2024-11-09 07:01:51,488 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7515923566878981 [2024-11-09 07:01:51,488 INFO L175 Difference]: Start difference. First operand has 337 places, 334 transitions, 691 flow. Second operand 3 states and 1062 transitions. [2024-11-09 07:01:51,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 333 transitions, 733 flow [2024-11-09 07:01:51,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 333 transitions, 729 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:51,494 INFO L231 Difference]: Finished difference. Result has 336 places, 333 transitions, 689 flow [2024-11-09 07:01:51,495 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=689, PETRI_PLACES=336, PETRI_TRANSITIONS=333} [2024-11-09 07:01:51,495 INFO L277 CegarLoopForPetriNet]: 443 programPoint places, -107 predicate places. [2024-11-09 07:01:51,495 INFO L471 AbstractCegarLoop]: Abstraction has has 336 places, 333 transitions, 689 flow [2024-11-09 07:01:51,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 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) [2024-11-09 07:01:51,496 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:51,497 INFO L204 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] [2024-11-09 07:01:51,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 07:01:51,497 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2024-11-09 07:01:51,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:51,497 INFO L85 PathProgramCache]: Analyzing trace with hash 21585552, now seen corresponding path program 1 times [2024-11-09 07:01:51,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:51,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123052657] [2024-11-09 07:01:51,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:51,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:51,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:51,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:51,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:51,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123052657] [2024-11-09 07:01:51,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123052657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:51,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:51,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:51,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897853192] [2024-11-09 07:01:51,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:51,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:51,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:51,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:51,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:51,552 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 471 [2024-11-09 07:01:51,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 333 transitions, 689 flow. Second operand has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 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) [2024-11-09 07:01:51,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:51,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 471 [2024-11-09 07:01:51,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:51,758 INFO L124 PetriNetUnfolderBase]: 221/999 cut-off events. [2024-11-09 07:01:51,758 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2024-11-09 07:01:51,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1442 conditions, 999 events. 221/999 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4819 event pairs, 138 based on Foata normal form. 0/931 useless extension candidates. Maximal degree in co-relation 1380. Up to 335 conditions per place. [2024-11-09 07:01:51,767 INFO L140 encePairwiseOnDemand]: 469/471 looper letters, 18 selfloop transitions, 1 changer transitions 0/332 dead transitions. [2024-11-09 07:01:51,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 332 transitions, 725 flow [2024-11-09 07:01:51,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:51,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:51,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1071 transitions. [2024-11-09 07:01:51,770 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7579617834394905 [2024-11-09 07:01:51,770 INFO L175 Difference]: Start difference. First operand has 336 places, 333 transitions, 689 flow. Second operand 3 states and 1071 transitions. [2024-11-09 07:01:51,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 332 transitions, 725 flow [2024-11-09 07:01:51,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 332 transitions, 721 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:51,777 INFO L231 Difference]: Finished difference. Result has 335 places, 332 transitions, 685 flow [2024-11-09 07:01:51,777 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=685, PETRI_PLACES=335, PETRI_TRANSITIONS=332} [2024-11-09 07:01:51,778 INFO L277 CegarLoopForPetriNet]: 443 programPoint places, -108 predicate places. [2024-11-09 07:01:51,778 INFO L471 AbstractCegarLoop]: Abstraction has has 335 places, 332 transitions, 685 flow [2024-11-09 07:01:51,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 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) [2024-11-09 07:01:51,779 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:51,779 INFO L204 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] [2024-11-09 07:01:51,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 07:01:51,780 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2024-11-09 07:01:51,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:51,780 INFO L85 PathProgramCache]: Analyzing trace with hash -254688891, now seen corresponding path program 1 times [2024-11-09 07:01:51,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:51,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334610810] [2024-11-09 07:01:51,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:51,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:51,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:51,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:51,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334610810] [2024-11-09 07:01:51,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334610810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:51,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:51,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:51,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113577870] [2024-11-09 07:01:51,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:51,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:51,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:51,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:51,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:51,837 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 471 [2024-11-09 07:01:51,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 332 transitions, 685 flow. Second operand has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 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) [2024-11-09 07:01:51,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:51,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 471 [2024-11-09 07:01:51,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:52,068 INFO L124 PetriNetUnfolderBase]: 221/998 cut-off events. [2024-11-09 07:01:52,069 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2024-11-09 07:01:52,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1442 conditions, 998 events. 221/998 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4868 event pairs, 138 based on Foata normal form. 0/931 useless extension candidates. Maximal degree in co-relation 1379. Up to 337 conditions per place. [2024-11-09 07:01:52,075 INFO L140 encePairwiseOnDemand]: 468/471 looper letters, 19 selfloop transitions, 2 changer transitions 0/331 dead transitions. [2024-11-09 07:01:52,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 331 transitions, 725 flow [2024-11-09 07:01:52,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:52,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:52,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1064 transitions. [2024-11-09 07:01:52,079 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7530077848549186 [2024-11-09 07:01:52,079 INFO L175 Difference]: Start difference. First operand has 335 places, 332 transitions, 685 flow. Second operand 3 states and 1064 transitions. [2024-11-09 07:01:52,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 331 transitions, 725 flow [2024-11-09 07:01:52,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 331 transitions, 724 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:01:52,085 INFO L231 Difference]: Finished difference. Result has 335 places, 331 transitions, 686 flow [2024-11-09 07:01:52,086 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=686, PETRI_PLACES=335, PETRI_TRANSITIONS=331} [2024-11-09 07:01:52,086 INFO L277 CegarLoopForPetriNet]: 443 programPoint places, -108 predicate places. [2024-11-09 07:01:52,087 INFO L471 AbstractCegarLoop]: Abstraction has has 335 places, 331 transitions, 686 flow [2024-11-09 07:01:52,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 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) [2024-11-09 07:01:52,087 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:52,088 INFO L204 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] [2024-11-09 07:01:52,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 07:01:52,088 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2024-11-09 07:01:52,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:52,088 INFO L85 PathProgramCache]: Analyzing trace with hash -609205263, now seen corresponding path program 1 times [2024-11-09 07:01:52,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:52,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899005054] [2024-11-09 07:01:52,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:52,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:52,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:52,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:52,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:52,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899005054] [2024-11-09 07:01:52,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899005054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:52,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:52,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:52,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739495609] [2024-11-09 07:01:52,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:52,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:52,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:52,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:52,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:52,152 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 471 [2024-11-09 07:01:52,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 331 transitions, 686 flow. Second operand has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 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) [2024-11-09 07:01:52,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:52,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 471 [2024-11-09 07:01:52,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:52,375 INFO L124 PetriNetUnfolderBase]: 221/997 cut-off events. [2024-11-09 07:01:52,375 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2024-11-09 07:01:52,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1444 conditions, 997 events. 221/997 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4866 event pairs, 138 based on Foata normal form. 0/931 useless extension candidates. Maximal degree in co-relation 1381. Up to 338 conditions per place. [2024-11-09 07:01:52,383 INFO L140 encePairwiseOnDemand]: 468/471 looper letters, 20 selfloop transitions, 2 changer transitions 0/330 dead transitions. [2024-11-09 07:01:52,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 330 transitions, 728 flow [2024-11-09 07:01:52,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:52,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:52,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1062 transitions. [2024-11-09 07:01:52,386 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7515923566878981 [2024-11-09 07:01:52,386 INFO L175 Difference]: Start difference. First operand has 335 places, 331 transitions, 686 flow. Second operand 3 states and 1062 transitions. [2024-11-09 07:01:52,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 330 transitions, 728 flow [2024-11-09 07:01:52,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 330 transitions, 724 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:52,392 INFO L231 Difference]: Finished difference. Result has 334 places, 330 transitions, 684 flow [2024-11-09 07:01:52,393 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=684, PETRI_PLACES=334, PETRI_TRANSITIONS=330} [2024-11-09 07:01:52,393 INFO L277 CegarLoopForPetriNet]: 443 programPoint places, -109 predicate places. [2024-11-09 07:01:52,393 INFO L471 AbstractCegarLoop]: Abstraction has has 334 places, 330 transitions, 684 flow [2024-11-09 07:01:52,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 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) [2024-11-09 07:01:52,394 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:52,394 INFO L204 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] [2024-11-09 07:01:52,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 07:01:52,394 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2024-11-09 07:01:52,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:52,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1158746889, now seen corresponding path program 1 times [2024-11-09 07:01:52,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:52,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342700831] [2024-11-09 07:01:52,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:52,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:52,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:52,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:52,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:52,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342700831] [2024-11-09 07:01:52,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342700831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:52,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:52,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:52,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843731485] [2024-11-09 07:01:52,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:52,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:52,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:52,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:52,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:52,467 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 471 [2024-11-09 07:01:52,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 330 transitions, 684 flow. Second operand has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 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) [2024-11-09 07:01:52,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:52,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 471 [2024-11-09 07:01:52,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:52,730 INFO L124 PetriNetUnfolderBase]: 223/1027 cut-off events. [2024-11-09 07:01:52,730 INFO L125 PetriNetUnfolderBase]: For 111/111 co-relation queries the response was YES. [2024-11-09 07:01:52,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1492 conditions, 1027 events. 223/1027 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5027 event pairs, 32 based on Foata normal form. 0/969 useless extension candidates. Maximal degree in co-relation 1430. Up to 253 conditions per place. [2024-11-09 07:01:52,739 INFO L140 encePairwiseOnDemand]: 468/471 looper letters, 30 selfloop transitions, 2 changer transitions 0/342 dead transitions. [2024-11-09 07:01:52,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 342 transitions, 784 flow [2024-11-09 07:01:52,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:52,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:52,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1082 transitions. [2024-11-09 07:01:52,742 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7657466383581033 [2024-11-09 07:01:52,742 INFO L175 Difference]: Start difference. First operand has 334 places, 330 transitions, 684 flow. Second operand 3 states and 1082 transitions. [2024-11-09 07:01:52,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 342 transitions, 784 flow [2024-11-09 07:01:52,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 342 transitions, 780 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:52,749 INFO L231 Difference]: Finished difference. Result has 334 places, 330 transitions, 688 flow [2024-11-09 07:01:52,749 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=688, PETRI_PLACES=334, PETRI_TRANSITIONS=330} [2024-11-09 07:01:52,750 INFO L277 CegarLoopForPetriNet]: 443 programPoint places, -109 predicate places. [2024-11-09 07:01:52,750 INFO L471 AbstractCegarLoop]: Abstraction has has 334 places, 330 transitions, 688 flow [2024-11-09 07:01:52,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 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) [2024-11-09 07:01:52,752 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:52,752 INFO L204 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] [2024-11-09 07:01:52,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 07:01:52,752 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2024-11-09 07:01:52,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:52,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1691488632, now seen corresponding path program 1 times [2024-11-09 07:01:52,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:52,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18962524] [2024-11-09 07:01:52,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:52,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:52,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:52,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:52,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:52,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18962524] [2024-11-09 07:01:52,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18962524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:52,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:52,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:52,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679149815] [2024-11-09 07:01:52,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:52,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:52,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:52,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:52,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:52,816 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 471 [2024-11-09 07:01:52,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 330 transitions, 688 flow. Second operand has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 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) [2024-11-09 07:01:52,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:52,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 471 [2024-11-09 07:01:52,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:53,063 INFO L124 PetriNetUnfolderBase]: 223/1042 cut-off events. [2024-11-09 07:01:53,063 INFO L125 PetriNetUnfolderBase]: For 162/162 co-relation queries the response was YES. [2024-11-09 07:01:53,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1608 conditions, 1042 events. 223/1042 cut-off events. For 162/162 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5233 event pairs, 146 based on Foata normal form. 0/975 useless extension candidates. Maximal degree in co-relation 1544. Up to 352 conditions per place. [2024-11-09 07:01:53,069 INFO L140 encePairwiseOnDemand]: 468/471 looper letters, 20 selfloop transitions, 2 changer transitions 0/329 dead transitions. [2024-11-09 07:01:53,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 329 transitions, 730 flow [2024-11-09 07:01:53,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:53,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:53,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1064 transitions. [2024-11-09 07:01:53,071 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7530077848549186 [2024-11-09 07:01:53,072 INFO L175 Difference]: Start difference. First operand has 334 places, 330 transitions, 688 flow. Second operand 3 states and 1064 transitions. [2024-11-09 07:01:53,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 329 transitions, 730 flow [2024-11-09 07:01:53,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 329 transitions, 728 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:01:53,077 INFO L231 Difference]: Finished difference. Result has 334 places, 329 transitions, 688 flow [2024-11-09 07:01:53,078 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=688, PETRI_PLACES=334, PETRI_TRANSITIONS=329} [2024-11-09 07:01:53,078 INFO L277 CegarLoopForPetriNet]: 443 programPoint places, -109 predicate places. [2024-11-09 07:01:53,078 INFO L471 AbstractCegarLoop]: Abstraction has has 334 places, 329 transitions, 688 flow [2024-11-09 07:01:53,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 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) [2024-11-09 07:01:53,079 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:53,079 INFO L204 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] [2024-11-09 07:01:53,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 07:01:53,079 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2024-11-09 07:01:53,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:53,080 INFO L85 PathProgramCache]: Analyzing trace with hash -917002043, now seen corresponding path program 1 times [2024-11-09 07:01:53,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:53,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872506099] [2024-11-09 07:01:53,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:53,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:53,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:53,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:53,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:53,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872506099] [2024-11-09 07:01:53,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872506099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:53,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:53,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:53,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913482788] [2024-11-09 07:01:53,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:53,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:53,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:53,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:53,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:53,139 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 471 [2024-11-09 07:01:53,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 329 transitions, 688 flow. Second operand has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 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) [2024-11-09 07:01:53,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:53,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 471 [2024-11-09 07:01:53,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:53,355 INFO L124 PetriNetUnfolderBase]: 223/1041 cut-off events. [2024-11-09 07:01:53,356 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2024-11-09 07:01:53,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1577 conditions, 1041 events. 223/1041 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5231 event pairs, 146 based on Foata normal form. 0/975 useless extension candidates. Maximal degree in co-relation 1513. Up to 353 conditions per place. [2024-11-09 07:01:53,363 INFO L140 encePairwiseOnDemand]: 468/471 looper letters, 21 selfloop transitions, 2 changer transitions 0/328 dead transitions. [2024-11-09 07:01:53,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 328 transitions, 732 flow [2024-11-09 07:01:53,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:53,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:53,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1062 transitions. [2024-11-09 07:01:53,366 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7515923566878981 [2024-11-09 07:01:53,366 INFO L175 Difference]: Start difference. First operand has 334 places, 329 transitions, 688 flow. Second operand 3 states and 1062 transitions. [2024-11-09 07:01:53,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 328 transitions, 732 flow [2024-11-09 07:01:53,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 328 transitions, 728 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:53,372 INFO L231 Difference]: Finished difference. Result has 333 places, 328 transitions, 686 flow [2024-11-09 07:01:53,373 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=686, PETRI_PLACES=333, PETRI_TRANSITIONS=328} [2024-11-09 07:01:53,373 INFO L277 CegarLoopForPetriNet]: 443 programPoint places, -110 predicate places. [2024-11-09 07:01:53,373 INFO L471 AbstractCegarLoop]: Abstraction has has 333 places, 328 transitions, 686 flow [2024-11-09 07:01:53,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 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) [2024-11-09 07:01:53,374 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:53,374 INFO L204 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] [2024-11-09 07:01:53,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 07:01:53,375 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2024-11-09 07:01:53,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:53,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1805416777, now seen corresponding path program 1 times [2024-11-09 07:01:53,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:53,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644886645] [2024-11-09 07:01:53,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:53,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:53,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:53,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:53,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:53,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644886645] [2024-11-09 07:01:53,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644886645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:53,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:53,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:53,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154636103] [2024-11-09 07:01:53,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:53,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:53,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:53,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:53,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:53,436 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 471 [2024-11-09 07:01:53,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 328 transitions, 686 flow. Second operand has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 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) [2024-11-09 07:01:53,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:53,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 471 [2024-11-09 07:01:53,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:53,656 INFO L124 PetriNetUnfolderBase]: 223/1065 cut-off events. [2024-11-09 07:01:53,657 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2024-11-09 07:01:53,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1598 conditions, 1065 events. 223/1065 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5410 event pairs, 146 based on Foata normal form. 0/989 useless extension candidates. Maximal degree in co-relation 1535. Up to 350 conditions per place. [2024-11-09 07:01:53,663 INFO L140 encePairwiseOnDemand]: 469/471 looper letters, 19 selfloop transitions, 1 changer transitions 0/327 dead transitions. [2024-11-09 07:01:53,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 327 transitions, 724 flow [2024-11-09 07:01:53,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:53,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:53,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1071 transitions. [2024-11-09 07:01:53,666 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7579617834394905 [2024-11-09 07:01:53,666 INFO L175 Difference]: Start difference. First operand has 333 places, 328 transitions, 686 flow. Second operand 3 states and 1071 transitions. [2024-11-09 07:01:53,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 327 transitions, 724 flow [2024-11-09 07:01:53,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 327 transitions, 720 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:53,672 INFO L231 Difference]: Finished difference. Result has 332 places, 327 transitions, 682 flow [2024-11-09 07:01:53,673 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=682, PETRI_PLACES=332, PETRI_TRANSITIONS=327} [2024-11-09 07:01:53,673 INFO L277 CegarLoopForPetriNet]: 443 programPoint places, -111 predicate places. [2024-11-09 07:01:53,673 INFO L471 AbstractCegarLoop]: Abstraction has has 332 places, 327 transitions, 682 flow [2024-11-09 07:01:53,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 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) [2024-11-09 07:01:53,674 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:53,674 INFO L204 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] [2024-11-09 07:01:53,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 07:01:53,674 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2024-11-09 07:01:53,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:53,675 INFO L85 PathProgramCache]: Analyzing trace with hash 426294863, now seen corresponding path program 1 times [2024-11-09 07:01:53,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:53,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79697219] [2024-11-09 07:01:53,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:53,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:53,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:53,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:53,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:53,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79697219] [2024-11-09 07:01:53,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79697219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:53,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:53,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:53,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132137019] [2024-11-09 07:01:53,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:53,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:53,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:53,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:53,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:53,745 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 471 [2024-11-09 07:01:53,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 327 transitions, 682 flow. Second operand has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 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) [2024-11-09 07:01:53,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:53,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 471 [2024-11-09 07:01:53,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:53,968 INFO L124 PetriNetUnfolderBase]: 223/1064 cut-off events. [2024-11-09 07:01:53,968 INFO L125 PetriNetUnfolderBase]: For 160/160 co-relation queries the response was YES. [2024-11-09 07:01:53,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1598 conditions, 1064 events. 223/1064 cut-off events. For 160/160 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5405 event pairs, 146 based on Foata normal form. 0/989 useless extension candidates. Maximal degree in co-relation 1534. Up to 352 conditions per place. [2024-11-09 07:01:53,976 INFO L140 encePairwiseOnDemand]: 468/471 looper letters, 20 selfloop transitions, 2 changer transitions 0/326 dead transitions. [2024-11-09 07:01:53,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 326 transitions, 724 flow [2024-11-09 07:01:53,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:53,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:53,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1064 transitions. [2024-11-09 07:01:53,978 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7530077848549186 [2024-11-09 07:01:53,979 INFO L175 Difference]: Start difference. First operand has 332 places, 327 transitions, 682 flow. Second operand 3 states and 1064 transitions. [2024-11-09 07:01:53,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 326 transitions, 724 flow [2024-11-09 07:01:53,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 326 transitions, 723 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:01:53,984 INFO L231 Difference]: Finished difference. Result has 332 places, 326 transitions, 683 flow [2024-11-09 07:01:53,984 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=683, PETRI_PLACES=332, PETRI_TRANSITIONS=326} [2024-11-09 07:01:53,985 INFO L277 CegarLoopForPetriNet]: 443 programPoint places, -111 predicate places. [2024-11-09 07:01:53,985 INFO L471 AbstractCegarLoop]: Abstraction has has 332 places, 326 transitions, 683 flow [2024-11-09 07:01:53,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 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) [2024-11-09 07:01:53,986 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:53,986 INFO L204 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] [2024-11-09 07:01:53,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 07:01:53,986 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2024-11-09 07:01:53,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:53,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1837716179, now seen corresponding path program 1 times [2024-11-09 07:01:53,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:53,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175808690] [2024-11-09 07:01:53,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:53,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:54,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:54,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:54,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175808690] [2024-11-09 07:01:54,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175808690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:54,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:54,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:54,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740533150] [2024-11-09 07:01:54,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:54,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:54,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:54,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:54,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:54,063 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 471 [2024-11-09 07:01:54,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 326 transitions, 683 flow. Second operand has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 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) [2024-11-09 07:01:54,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:54,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 471 [2024-11-09 07:01:54,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:54,278 INFO L124 PetriNetUnfolderBase]: 223/1063 cut-off events. [2024-11-09 07:01:54,278 INFO L125 PetriNetUnfolderBase]: For 160/160 co-relation queries the response was YES. [2024-11-09 07:01:54,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1599 conditions, 1063 events. 223/1063 cut-off events. For 160/160 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5358 event pairs, 146 based on Foata normal form. 0/989 useless extension candidates. Maximal degree in co-relation 1535. Up to 352 conditions per place. [2024-11-09 07:01:54,285 INFO L140 encePairwiseOnDemand]: 468/471 looper letters, 20 selfloop transitions, 2 changer transitions 0/325 dead transitions. [2024-11-09 07:01:54,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 325 transitions, 725 flow [2024-11-09 07:01:54,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:54,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:54,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1064 transitions. [2024-11-09 07:01:54,288 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7530077848549186 [2024-11-09 07:01:54,288 INFO L175 Difference]: Start difference. First operand has 332 places, 326 transitions, 683 flow. Second operand 3 states and 1064 transitions. [2024-11-09 07:01:54,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 325 transitions, 725 flow [2024-11-09 07:01:54,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 325 transitions, 721 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:54,293 INFO L231 Difference]: Finished difference. Result has 331 places, 325 transitions, 681 flow [2024-11-09 07:01:54,294 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=677, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=681, PETRI_PLACES=331, PETRI_TRANSITIONS=325} [2024-11-09 07:01:54,294 INFO L277 CegarLoopForPetriNet]: 443 programPoint places, -112 predicate places. [2024-11-09 07:01:54,294 INFO L471 AbstractCegarLoop]: Abstraction has has 331 places, 325 transitions, 681 flow [2024-11-09 07:01:54,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 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) [2024-11-09 07:01:54,295 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:54,295 INFO L204 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] [2024-11-09 07:01:54,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 07:01:54,296 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2024-11-09 07:01:54,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:54,296 INFO L85 PathProgramCache]: Analyzing trace with hash 301228695, now seen corresponding path program 1 times [2024-11-09 07:01:54,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:54,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667513336] [2024-11-09 07:01:54,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:54,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:54,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:54,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:54,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:54,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667513336] [2024-11-09 07:01:54,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667513336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:54,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:54,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:54,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751268128] [2024-11-09 07:01:54,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:54,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:54,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:54,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:54,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:54,361 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 471 [2024-11-09 07:01:54,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 325 transitions, 681 flow. Second operand has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 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) [2024-11-09 07:01:54,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:54,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 471 [2024-11-09 07:01:54,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:54,646 INFO L124 PetriNetUnfolderBase]: 223/1062 cut-off events. [2024-11-09 07:01:54,646 INFO L125 PetriNetUnfolderBase]: For 160/160 co-relation queries the response was YES. [2024-11-09 07:01:54,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1598 conditions, 1062 events. 223/1062 cut-off events. For 160/160 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5382 event pairs, 146 based on Foata normal form. 0/989 useless extension candidates. Maximal degree in co-relation 1534. Up to 352 conditions per place. [2024-11-09 07:01:54,657 INFO L140 encePairwiseOnDemand]: 468/471 looper letters, 20 selfloop transitions, 2 changer transitions 0/324 dead transitions. [2024-11-09 07:01:54,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 324 transitions, 723 flow [2024-11-09 07:01:54,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:54,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:54,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1064 transitions. [2024-11-09 07:01:54,661 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7530077848549186 [2024-11-09 07:01:54,661 INFO L175 Difference]: Start difference. First operand has 331 places, 325 transitions, 681 flow. Second operand 3 states and 1064 transitions. [2024-11-09 07:01:54,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 324 transitions, 723 flow [2024-11-09 07:01:54,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 324 transitions, 719 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:54,668 INFO L231 Difference]: Finished difference. Result has 330 places, 324 transitions, 679 flow [2024-11-09 07:01:54,668 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=679, PETRI_PLACES=330, PETRI_TRANSITIONS=324} [2024-11-09 07:01:54,669 INFO L277 CegarLoopForPetriNet]: 443 programPoint places, -113 predicate places. [2024-11-09 07:01:54,669 INFO L471 AbstractCegarLoop]: Abstraction has has 330 places, 324 transitions, 679 flow [2024-11-09 07:01:54,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 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) [2024-11-09 07:01:54,669 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:54,670 INFO L204 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] [2024-11-09 07:01:54,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 07:01:54,670 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2024-11-09 07:01:54,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:54,671 INFO L85 PathProgramCache]: Analyzing trace with hash 739196395, now seen corresponding path program 1 times [2024-11-09 07:01:54,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:54,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973211609] [2024-11-09 07:01:54,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:54,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:54,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:54,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:54,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:54,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973211609] [2024-11-09 07:01:54,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973211609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:54,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:54,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:54,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249331400] [2024-11-09 07:01:54,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:54,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:54,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:54,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:54,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:54,771 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 471 [2024-11-09 07:01:54,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 324 transitions, 679 flow. Second operand has 3 states, 3 states have (on average 354.0) internal successors, (1062), 3 states have internal predecessors, (1062), 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) [2024-11-09 07:01:54,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:54,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 471 [2024-11-09 07:01:54,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:55,019 INFO L124 PetriNetUnfolderBase]: 223/1054 cut-off events. [2024-11-09 07:01:55,019 INFO L125 PetriNetUnfolderBase]: For 160/160 co-relation queries the response was YES. [2024-11-09 07:01:55,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1594 conditions, 1054 events. 223/1054 cut-off events. For 160/160 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5295 event pairs, 146 based on Foata normal form. 8/989 useless extension candidates. Maximal degree in co-relation 1530. Up to 350 conditions per place. [2024-11-09 07:01:55,025 INFO L140 encePairwiseOnDemand]: 469/471 looper letters, 0 selfloop transitions, 0 changer transitions 323/323 dead transitions. [2024-11-09 07:01:55,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 323 transitions, 715 flow [2024-11-09 07:01:55,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:55,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:55,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1070 transitions. [2024-11-09 07:01:55,028 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7572540693559802 [2024-11-09 07:01:55,028 INFO L175 Difference]: Start difference. First operand has 330 places, 324 transitions, 679 flow. Second operand 3 states and 1070 transitions. [2024-11-09 07:01:55,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 323 transitions, 715 flow [2024-11-09 07:01:55,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 323 transitions, 711 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:55,033 INFO L231 Difference]: Finished difference. Result has 329 places, 0 transitions, 0 flow [2024-11-09 07:01:55,033 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=329, PETRI_TRANSITIONS=0} [2024-11-09 07:01:55,034 INFO L277 CegarLoopForPetriNet]: 443 programPoint places, -114 predicate places. [2024-11-09 07:01:55,034 INFO L471 AbstractCegarLoop]: Abstraction has has 329 places, 0 transitions, 0 flow [2024-11-09 07:01:55,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 354.0) internal successors, (1062), 3 states have internal predecessors, (1062), 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) [2024-11-09 07:01:55,039 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (203 of 204 remaining) [2024-11-09 07:01:55,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (202 of 204 remaining) [2024-11-09 07:01:55,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (201 of 204 remaining) [2024-11-09 07:01:55,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (200 of 204 remaining) [2024-11-09 07:01:55,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (199 of 204 remaining) [2024-11-09 07:01:55,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (198 of 204 remaining) [2024-11-09 07:01:55,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (197 of 204 remaining) [2024-11-09 07:01:55,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (196 of 204 remaining) [2024-11-09 07:01:55,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (195 of 204 remaining) [2024-11-09 07:01:55,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (194 of 204 remaining) [2024-11-09 07:01:55,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (193 of 204 remaining) [2024-11-09 07:01:55,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (192 of 204 remaining) [2024-11-09 07:01:55,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (191 of 204 remaining) [2024-11-09 07:01:55,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (190 of 204 remaining) [2024-11-09 07:01:55,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (189 of 204 remaining) [2024-11-09 07:01:55,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (188 of 204 remaining) [2024-11-09 07:01:55,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (187 of 204 remaining) [2024-11-09 07:01:55,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (186 of 204 remaining) [2024-11-09 07:01:55,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (185 of 204 remaining) [2024-11-09 07:01:55,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (184 of 204 remaining) [2024-11-09 07:01:55,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (183 of 204 remaining) [2024-11-09 07:01:55,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (182 of 204 remaining) [2024-11-09 07:01:55,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (181 of 204 remaining) [2024-11-09 07:01:55,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (180 of 204 remaining) [2024-11-09 07:01:55,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (179 of 204 remaining) [2024-11-09 07:01:55,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (178 of 204 remaining) [2024-11-09 07:01:55,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (177 of 204 remaining) [2024-11-09 07:01:55,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (176 of 204 remaining) [2024-11-09 07:01:55,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (175 of 204 remaining) [2024-11-09 07:01:55,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (174 of 204 remaining) [2024-11-09 07:01:55,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (173 of 204 remaining) [2024-11-09 07:01:55,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (172 of 204 remaining) [2024-11-09 07:01:55,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err32ASSERT_VIOLATIONDATA_RACE (171 of 204 remaining) [2024-11-09 07:01:55,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err33ASSERT_VIOLATIONDATA_RACE (170 of 204 remaining) [2024-11-09 07:01:55,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err34ASSERT_VIOLATIONDATA_RACE (169 of 204 remaining) [2024-11-09 07:01:55,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err35ASSERT_VIOLATIONDATA_RACE (168 of 204 remaining) [2024-11-09 07:01:55,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err36ASSERT_VIOLATIONDATA_RACE (167 of 204 remaining) [2024-11-09 07:01:55,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err37ASSERT_VIOLATIONDATA_RACE (166 of 204 remaining) [2024-11-09 07:01:55,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err38ASSERT_VIOLATIONDATA_RACE (165 of 204 remaining) [2024-11-09 07:01:55,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err39ASSERT_VIOLATIONDATA_RACE (164 of 204 remaining) [2024-11-09 07:01:55,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err40ASSERT_VIOLATIONDATA_RACE (163 of 204 remaining) [2024-11-09 07:01:55,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err41ASSERT_VIOLATIONDATA_RACE (162 of 204 remaining) [2024-11-09 07:01:55,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err42ASSERT_VIOLATIONDATA_RACE (161 of 204 remaining) [2024-11-09 07:01:55,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err43ASSERT_VIOLATIONDATA_RACE (160 of 204 remaining) [2024-11-09 07:01:55,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (159 of 204 remaining) [2024-11-09 07:01:55,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (158 of 204 remaining) [2024-11-09 07:01:55,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (157 of 204 remaining) [2024-11-09 07:01:55,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (156 of 204 remaining) [2024-11-09 07:01:55,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (155 of 204 remaining) [2024-11-09 07:01:55,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (154 of 204 remaining) [2024-11-09 07:01:55,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (153 of 204 remaining) [2024-11-09 07:01:55,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (152 of 204 remaining) [2024-11-09 07:01:55,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (151 of 204 remaining) [2024-11-09 07:01:55,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (150 of 204 remaining) [2024-11-09 07:01:55,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (149 of 204 remaining) [2024-11-09 07:01:55,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (148 of 204 remaining) [2024-11-09 07:01:55,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (147 of 204 remaining) [2024-11-09 07:01:55,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (146 of 204 remaining) [2024-11-09 07:01:55,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (145 of 204 remaining) [2024-11-09 07:01:55,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (144 of 204 remaining) [2024-11-09 07:01:55,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (143 of 204 remaining) [2024-11-09 07:01:55,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (142 of 204 remaining) [2024-11-09 07:01:55,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (141 of 204 remaining) [2024-11-09 07:01:55,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (140 of 204 remaining) [2024-11-09 07:01:55,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (139 of 204 remaining) [2024-11-09 07:01:55,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (138 of 204 remaining) [2024-11-09 07:01:55,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (137 of 204 remaining) [2024-11-09 07:01:55,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (136 of 204 remaining) [2024-11-09 07:01:55,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (135 of 204 remaining) [2024-11-09 07:01:55,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (134 of 204 remaining) [2024-11-09 07:01:55,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (133 of 204 remaining) [2024-11-09 07:01:55,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (132 of 204 remaining) [2024-11-09 07:01:55,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (131 of 204 remaining) [2024-11-09 07:01:55,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (130 of 204 remaining) [2024-11-09 07:01:55,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (129 of 204 remaining) [2024-11-09 07:01:55,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (128 of 204 remaining) [2024-11-09 07:01:55,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (127 of 204 remaining) [2024-11-09 07:01:55,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (126 of 204 remaining) [2024-11-09 07:01:55,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (125 of 204 remaining) [2024-11-09 07:01:55,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (124 of 204 remaining) [2024-11-09 07:01:55,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (123 of 204 remaining) [2024-11-09 07:01:55,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (122 of 204 remaining) [2024-11-09 07:01:55,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (121 of 204 remaining) [2024-11-09 07:01:55,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (120 of 204 remaining) [2024-11-09 07:01:55,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (119 of 204 remaining) [2024-11-09 07:01:55,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (118 of 204 remaining) [2024-11-09 07:01:55,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (117 of 204 remaining) [2024-11-09 07:01:55,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (116 of 204 remaining) [2024-11-09 07:01:55,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (115 of 204 remaining) [2024-11-09 07:01:55,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (114 of 204 remaining) [2024-11-09 07:01:55,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (113 of 204 remaining) [2024-11-09 07:01:55,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (112 of 204 remaining) [2024-11-09 07:01:55,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (111 of 204 remaining) [2024-11-09 07:01:55,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (110 of 204 remaining) [2024-11-09 07:01:55,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (109 of 204 remaining) [2024-11-09 07:01:55,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (108 of 204 remaining) [2024-11-09 07:01:55,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (107 of 204 remaining) [2024-11-09 07:01:55,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (106 of 204 remaining) [2024-11-09 07:01:55,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (105 of 204 remaining) [2024-11-09 07:01:55,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (104 of 204 remaining) [2024-11-09 07:01:55,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (103 of 204 remaining) [2024-11-09 07:01:55,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (102 of 204 remaining) [2024-11-09 07:01:55,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (101 of 204 remaining) [2024-11-09 07:01:55,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (100 of 204 remaining) [2024-11-09 07:01:55,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (99 of 204 remaining) [2024-11-09 07:01:55,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (98 of 204 remaining) [2024-11-09 07:01:55,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (97 of 204 remaining) [2024-11-09 07:01:55,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (96 of 204 remaining) [2024-11-09 07:01:55,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (95 of 204 remaining) [2024-11-09 07:01:55,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (94 of 204 remaining) [2024-11-09 07:01:55,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (93 of 204 remaining) [2024-11-09 07:01:55,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (92 of 204 remaining) [2024-11-09 07:01:55,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (91 of 204 remaining) [2024-11-09 07:01:55,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (90 of 204 remaining) [2024-11-09 07:01:55,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (89 of 204 remaining) [2024-11-09 07:01:55,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (88 of 204 remaining) [2024-11-09 07:01:55,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (87 of 204 remaining) [2024-11-09 07:01:55,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (86 of 204 remaining) [2024-11-09 07:01:55,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (85 of 204 remaining) [2024-11-09 07:01:55,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (84 of 204 remaining) [2024-11-09 07:01:55,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (83 of 204 remaining) [2024-11-09 07:01:55,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (82 of 204 remaining) [2024-11-09 07:01:55,056 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (81 of 204 remaining) [2024-11-09 07:01:55,056 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (80 of 204 remaining) [2024-11-09 07:01:55,056 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (79 of 204 remaining) [2024-11-09 07:01:55,056 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (78 of 204 remaining) [2024-11-09 07:01:55,056 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (77 of 204 remaining) [2024-11-09 07:01:55,056 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (76 of 204 remaining) [2024-11-09 07:01:55,056 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (75 of 204 remaining) [2024-11-09 07:01:55,056 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (74 of 204 remaining) [2024-11-09 07:01:55,056 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (73 of 204 remaining) [2024-11-09 07:01:55,056 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (72 of 204 remaining) [2024-11-09 07:01:55,056 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (71 of 204 remaining) [2024-11-09 07:01:55,056 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (70 of 204 remaining) [2024-11-09 07:01:55,057 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (69 of 204 remaining) [2024-11-09 07:01:55,057 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (68 of 204 remaining) [2024-11-09 07:01:55,057 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (67 of 204 remaining) [2024-11-09 07:01:55,057 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (66 of 204 remaining) [2024-11-09 07:01:55,057 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (65 of 204 remaining) [2024-11-09 07:01:55,057 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (64 of 204 remaining) [2024-11-09 07:01:55,057 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (63 of 204 remaining) [2024-11-09 07:01:55,058 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (62 of 204 remaining) [2024-11-09 07:01:55,058 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (61 of 204 remaining) [2024-11-09 07:01:55,058 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (60 of 204 remaining) [2024-11-09 07:01:55,058 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (59 of 204 remaining) [2024-11-09 07:01:55,058 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (58 of 204 remaining) [2024-11-09 07:01:55,058 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (57 of 204 remaining) [2024-11-09 07:01:55,058 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (56 of 204 remaining) [2024-11-09 07:01:55,059 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err32ASSERT_VIOLATIONDATA_RACE (55 of 204 remaining) [2024-11-09 07:01:55,059 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err33ASSERT_VIOLATIONDATA_RACE (54 of 204 remaining) [2024-11-09 07:01:55,059 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err34ASSERT_VIOLATIONDATA_RACE (53 of 204 remaining) [2024-11-09 07:01:55,059 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err35ASSERT_VIOLATIONDATA_RACE (52 of 204 remaining) [2024-11-09 07:01:55,059 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err36ASSERT_VIOLATIONDATA_RACE (51 of 204 remaining) [2024-11-09 07:01:55,059 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err37ASSERT_VIOLATIONDATA_RACE (50 of 204 remaining) [2024-11-09 07:01:55,059 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err38ASSERT_VIOLATIONDATA_RACE (49 of 204 remaining) [2024-11-09 07:01:55,059 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err39ASSERT_VIOLATIONDATA_RACE (48 of 204 remaining) [2024-11-09 07:01:55,060 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err40ASSERT_VIOLATIONDATA_RACE (47 of 204 remaining) [2024-11-09 07:01:55,060 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err41ASSERT_VIOLATIONDATA_RACE (46 of 204 remaining) [2024-11-09 07:01:55,060 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err42ASSERT_VIOLATIONDATA_RACE (45 of 204 remaining) [2024-11-09 07:01:55,060 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err43ASSERT_VIOLATIONDATA_RACE (44 of 204 remaining) [2024-11-09 07:01:55,060 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (43 of 204 remaining) [2024-11-09 07:01:55,060 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (42 of 204 remaining) [2024-11-09 07:01:55,060 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (41 of 204 remaining) [2024-11-09 07:01:55,060 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (40 of 204 remaining) [2024-11-09 07:01:55,061 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (39 of 204 remaining) [2024-11-09 07:01:55,061 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (38 of 204 remaining) [2024-11-09 07:01:55,061 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (37 of 204 remaining) [2024-11-09 07:01:55,061 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (36 of 204 remaining) [2024-11-09 07:01:55,061 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (35 of 204 remaining) [2024-11-09 07:01:55,061 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (34 of 204 remaining) [2024-11-09 07:01:55,061 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (33 of 204 remaining) [2024-11-09 07:01:55,062 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (32 of 204 remaining) [2024-11-09 07:01:55,062 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (31 of 204 remaining) [2024-11-09 07:01:55,062 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (30 of 204 remaining) [2024-11-09 07:01:55,062 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (29 of 204 remaining) [2024-11-09 07:01:55,062 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (28 of 204 remaining) [2024-11-09 07:01:55,062 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (27 of 204 remaining) [2024-11-09 07:01:55,062 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (26 of 204 remaining) [2024-11-09 07:01:55,062 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (25 of 204 remaining) [2024-11-09 07:01:55,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (24 of 204 remaining) [2024-11-09 07:01:55,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (23 of 204 remaining) [2024-11-09 07:01:55,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (22 of 204 remaining) [2024-11-09 07:01:55,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (21 of 204 remaining) [2024-11-09 07:01:55,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (20 of 204 remaining) [2024-11-09 07:01:55,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (19 of 204 remaining) [2024-11-09 07:01:55,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (18 of 204 remaining) [2024-11-09 07:01:55,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (17 of 204 remaining) [2024-11-09 07:01:55,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (16 of 204 remaining) [2024-11-09 07:01:55,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (15 of 204 remaining) [2024-11-09 07:01:55,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (14 of 204 remaining) [2024-11-09 07:01:55,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (13 of 204 remaining) [2024-11-09 07:01:55,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (12 of 204 remaining) [2024-11-09 07:01:55,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (11 of 204 remaining) [2024-11-09 07:01:55,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (10 of 204 remaining) [2024-11-09 07:01:55,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (9 of 204 remaining) [2024-11-09 07:01:55,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (8 of 204 remaining) [2024-11-09 07:01:55,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (7 of 204 remaining) [2024-11-09 07:01:55,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (6 of 204 remaining) [2024-11-09 07:01:55,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (5 of 204 remaining) [2024-11-09 07:01:55,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (4 of 204 remaining) [2024-11-09 07:01:55,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (3 of 204 remaining) [2024-11-09 07:01:55,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (2 of 204 remaining) [2024-11-09 07:01:55,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (1 of 204 remaining) [2024-11-09 07:01:55,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (0 of 204 remaining) [2024-11-09 07:01:55,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 07:01:55,067 INFO L407 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] [2024-11-09 07:01:55,076 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 07:01:55,076 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 07:01:55,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:01:55 BasicIcfg [2024-11-09 07:01:55,084 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 07:01:55,085 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 07:01:55,085 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 07:01:55,085 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 07:01:55,086 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:01:45" (3/4) ... [2024-11-09 07:01:55,088 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 07:01:55,091 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-09 07:01:55,091 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-09 07:01:55,091 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-09 07:01:55,101 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2024-11-09 07:01:55,102 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 07:01:55,103 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 07:01:55,103 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 07:01:55,210 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 07:01:55,210 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 07:01:55,210 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 07:01:55,211 INFO L158 Benchmark]: Toolchain (without parser) took 12089.67ms. Allocated memory was 144.7MB in the beginning and 601.9MB in the end (delta: 457.2MB). Free memory was 108.3MB in the beginning and 290.8MB in the end (delta: -182.4MB). Peak memory consumption was 275.6MB. Max. memory is 16.1GB. [2024-11-09 07:01:55,212 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 144.7MB. Free memory is still 113.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:01:55,212 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.28ms. Allocated memory is still 144.7MB. Free memory was 108.3MB in the beginning and 92.2MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 07:01:55,212 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.38ms. Allocated memory is still 144.7MB. Free memory was 92.2MB in the beginning and 87.3MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 07:01:55,213 INFO L158 Benchmark]: Boogie Preprocessor took 76.07ms. Allocated memory is still 144.7MB. Free memory was 87.3MB in the beginning and 83.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 07:01:55,213 INFO L158 Benchmark]: RCFGBuilder took 2232.44ms. Allocated memory was 144.7MB in the beginning and 186.6MB in the end (delta: 41.9MB). Free memory was 83.2MB in the beginning and 120.0MB in the end (delta: -36.9MB). Peak memory consumption was 72.0MB. Max. memory is 16.1GB. [2024-11-09 07:01:55,213 INFO L158 Benchmark]: TraceAbstraction took 9239.69ms. Allocated memory was 186.6MB in the beginning and 601.9MB in the end (delta: 415.2MB). Free memory was 120.0MB in the beginning and 299.1MB in the end (delta: -179.1MB). Peak memory consumption was 237.2MB. Max. memory is 16.1GB. [2024-11-09 07:01:55,213 INFO L158 Benchmark]: Witness Printer took 125.50ms. Allocated memory is still 601.9MB. Free memory was 299.1MB in the beginning and 290.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 07:01:55,215 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.23ms. Allocated memory is still 144.7MB. Free memory is still 113.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 346.28ms. Allocated memory is still 144.7MB. Free memory was 108.3MB in the beginning and 92.2MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.38ms. Allocated memory is still 144.7MB. Free memory was 92.2MB in the beginning and 87.3MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.07ms. Allocated memory is still 144.7MB. Free memory was 87.3MB in the beginning and 83.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 2232.44ms. Allocated memory was 144.7MB in the beginning and 186.6MB in the end (delta: 41.9MB). Free memory was 83.2MB in the beginning and 120.0MB in the end (delta: -36.9MB). Peak memory consumption was 72.0MB. Max. memory is 16.1GB. * TraceAbstraction took 9239.69ms. Allocated memory was 186.6MB in the beginning and 601.9MB in the end (delta: 415.2MB). Free memory was 120.0MB in the beginning and 299.1MB in the end (delta: -179.1MB). Peak memory consumption was 237.2MB. Max. memory is 16.1GB. * Witness Printer took 125.50ms. Allocated memory is still 601.9MB. Free memory was 299.1MB in the beginning and 290.8MB 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: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: 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: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: 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: 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: 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: 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: 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: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: 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: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: 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: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 122]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 123]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 123]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 159]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 126]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 159]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: 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: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: 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: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 159]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 579 locations, 204 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: 9.0s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 452 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 172 mSDsluCounter, 159 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 71 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1061 IncrementalHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 71 mSolverCounterUnsat, 159 mSDtfsCounter, 1061 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=920occurred 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2788 NumberOfCodeBlocks, 2788 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2765 ConstructedInterpolants, 0 QuantifiedInterpolants, 2924 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 - AllSpecificationsHoldResult: All specifications hold 113 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-09 07:01:55,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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