./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-collitem-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-collitem-trans.wvr.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 3e310cbbcaa6ee1bb3c2e05a2a5fb7cb2ddde366fa4283fb7922170dd08986ab --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:13:47,899 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:13:47,984 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-11 17:13:47,990 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:13:47,991 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:13:48,022 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:13:48,023 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:13:48,023 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:13:48,024 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:13:48,026 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:13:48,027 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:13:48,027 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:13:48,027 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:13:48,028 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:13:48,031 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:13:48,031 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:13:48,032 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:13:48,032 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:13:48,032 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:13:48,032 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:13:48,033 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:13:48,033 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:13:48,033 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:13:48,034 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:13:48,034 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:13:48,034 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:13:48,035 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:13:48,035 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:13:48,035 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:13:48,036 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:13:48,036 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:13:48,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:13:48,036 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:13:48,037 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:13:48,037 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:13:48,037 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:13:48,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:13:48,038 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:13:48,038 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:13:48,038 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:13:48,038 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:13:48,039 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-clean/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-clean/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 -> 3e310cbbcaa6ee1bb3c2e05a2a5fb7cb2ddde366fa4283fb7922170dd08986ab [2024-10-11 17:13:48,294 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:13:48,320 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:13:48,324 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:13:48,326 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:13:48,327 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:13:48,328 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-collitem-trans.wvr.c [2024-10-11 17:13:49,964 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:13:50,181 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:13:50,181 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-collitem-trans.wvr.c [2024-10-11 17:13:50,190 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/85ee63054/8c46d2ed0cb5405eaccaa3e34a5b2a29/FLAGa37e1c750 [2024-10-11 17:13:50,205 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/85ee63054/8c46d2ed0cb5405eaccaa3e34a5b2a29 [2024-10-11 17:13:50,208 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:13:50,209 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:13:50,211 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:13:50,211 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:13:50,216 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:13:50,217 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:13:50" (1/1) ... [2024-10-11 17:13:50,218 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c4ca68b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:50, skipping insertion in model container [2024-10-11 17:13:50,218 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:13:50" (1/1) ... [2024-10-11 17:13:50,243 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:13:50,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:13:50,512 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:13:50,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:13:50,579 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:13:50,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:50 WrapperNode [2024-10-11 17:13:50,580 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:13:50,581 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:13:50,581 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:13:50,582 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:13:50,590 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:50" (1/1) ... [2024-10-11 17:13:50,605 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:50" (1/1) ... [2024-10-11 17:13:50,659 INFO L138 Inliner]: procedures = 22, calls = 31, calls flagged for inlining = 18, calls inlined = 40, statements flattened = 541 [2024-10-11 17:13:50,660 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:13:50,664 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:13:50,668 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:13:50,668 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:13:50,682 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:50" (1/1) ... [2024-10-11 17:13:50,683 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:50" (1/1) ... [2024-10-11 17:13:50,692 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:50" (1/1) ... [2024-10-11 17:13:50,692 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:50" (1/1) ... [2024-10-11 17:13:50,703 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:50" (1/1) ... [2024-10-11 17:13:50,707 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:50" (1/1) ... [2024-10-11 17:13:50,709 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:50" (1/1) ... [2024-10-11 17:13:50,712 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:50" (1/1) ... [2024-10-11 17:13:50,716 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:13:50,717 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:13:50,717 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:13:50,717 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:13:50,718 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:50" (1/1) ... [2024-10-11 17:13:50,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:13:50,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:13:50,761 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:13:50,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:13:50,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:13:50,828 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-11 17:13:50,829 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-11 17:13:50,829 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-11 17:13:50,829 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-11 17:13:50,829 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-11 17:13:50,829 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-11 17:13:50,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 17:13:50,830 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 17:13:50,831 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 17:13:50,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:13:50,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:13:50,833 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 17:13:50,964 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:13:50,969 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:13:51,822 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:13:51,822 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:13:52,775 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:13:52,777 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 17:13:52,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:13:52 BoogieIcfgContainer [2024-10-11 17:13:52,777 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:13:52,780 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:13:52,780 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:13:52,784 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:13:52,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:13:50" (1/3) ... [2024-10-11 17:13:52,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2786a71c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:13:52, skipping insertion in model container [2024-10-11 17:13:52,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:50" (2/3) ... [2024-10-11 17:13:52,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2786a71c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:13:52, skipping insertion in model container [2024-10-11 17:13:52,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:13:52" (3/3) ... [2024-10-11 17:13:52,787 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-collitem-trans.wvr.c [2024-10-11 17:13:52,805 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:13:52,807 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 69 error locations. [2024-10-11 17:13:52,807 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:13:52,947 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-11 17:13:52,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 266 places, 259 transitions, 539 flow [2024-10-11 17:13:53,111 INFO L124 PetriNetUnfolderBase]: 3/256 cut-off events. [2024-10-11 17:13:53,111 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 17:13:53,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 256 events. 3/256 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 387 event pairs, 0 based on Foata normal form. 0/184 useless extension candidates. Maximal degree in co-relation 83. Up to 2 conditions per place. [2024-10-11 17:13:53,119 INFO L82 GeneralOperation]: Start removeDead. Operand has 266 places, 259 transitions, 539 flow [2024-10-11 17:13:53,126 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 244 places, 235 transitions, 488 flow [2024-10-11 17:13:53,141 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:13:53,150 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;@999ac2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:13:53,151 INFO L334 AbstractCegarLoop]: Starting to check reachability of 126 error locations. [2024-10-11 17:13:53,159 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:13:53,161 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2024-10-11 17:13:53,161 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:13:53,162 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:53,162 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] [2024-10-11 17:13:53,163 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2024-10-11 17:13:53,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:53,169 INFO L85 PathProgramCache]: Analyzing trace with hash -120604151, now seen corresponding path program 1 times [2024-10-11 17:13:53,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:53,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662407111] [2024-10-11 17:13:53,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:53,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:53,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:53,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:53,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:53,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662407111] [2024-10-11 17:13:53,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662407111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:53,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:53,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:53,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357641994] [2024-10-11 17:13:53,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:53,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:53,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:53,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:53,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:53,433 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 259 [2024-10-11 17:13:53,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 235 transitions, 488 flow. Second operand has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 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-10-11 17:13:53,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:53,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 259 [2024-10-11 17:13:53,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:53,547 INFO L124 PetriNetUnfolderBase]: 16/227 cut-off events. [2024-10-11 17:13:53,549 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-10-11 17:13:53,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 227 events. 16/227 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 221 event pairs, 15 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 183. Up to 40 conditions per place. [2024-10-11 17:13:53,555 INFO L140 encePairwiseOnDemand]: 202/259 looper letters, 12 selfloop transitions, 2 changer transitions 0/180 dead transitions. [2024-10-11 17:13:53,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 180 transitions, 406 flow [2024-10-11 17:13:53,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:53,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:53,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 630 transitions. [2024-10-11 17:13:53,575 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8108108108108109 [2024-10-11 17:13:53,579 INFO L175 Difference]: Start difference. First operand has 244 places, 235 transitions, 488 flow. Second operand 3 states and 630 transitions. [2024-10-11 17:13:53,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 180 transitions, 406 flow [2024-10-11 17:13:53,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 180 transitions, 394 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-11 17:13:53,588 INFO L231 Difference]: Finished difference. Result has 185 places, 180 transitions, 370 flow [2024-10-11 17:13:53,590 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=370, PETRI_PLACES=185, PETRI_TRANSITIONS=180} [2024-10-11 17:13:53,596 INFO L277 CegarLoopForPetriNet]: 244 programPoint places, -59 predicate places. [2024-10-11 17:13:53,596 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 180 transitions, 370 flow [2024-10-11 17:13:53,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 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-10-11 17:13:53,597 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:53,597 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] [2024-10-11 17:13:53,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:13:53,598 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2024-10-11 17:13:53,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:53,599 INFO L85 PathProgramCache]: Analyzing trace with hash 340773378, now seen corresponding path program 1 times [2024-10-11 17:13:53,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:53,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379799419] [2024-10-11 17:13:53,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:53,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:53,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:53,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:53,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:53,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379799419] [2024-10-11 17:13:53,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379799419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:53,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:53,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:53,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273190064] [2024-10-11 17:13:53,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:53,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:53,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:53,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:53,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:53,668 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 259 [2024-10-11 17:13:53,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 180 transitions, 370 flow. Second operand has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 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-10-11 17:13:53,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:53,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 259 [2024-10-11 17:13:53,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:53,762 INFO L124 PetriNetUnfolderBase]: 16/226 cut-off events. [2024-10-11 17:13:53,762 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-11 17:13:53,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 226 events. 16/226 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 221 event pairs, 15 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 239. Up to 40 conditions per place. [2024-10-11 17:13:53,764 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 12 selfloop transitions, 2 changer transitions 0/179 dead transitions. [2024-10-11 17:13:53,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 179 transitions, 396 flow [2024-10-11 17:13:53,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:53,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:53,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 576 transitions. [2024-10-11 17:13:53,769 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7413127413127413 [2024-10-11 17:13:53,770 INFO L175 Difference]: Start difference. First operand has 185 places, 180 transitions, 370 flow. Second operand 3 states and 576 transitions. [2024-10-11 17:13:53,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 179 transitions, 396 flow [2024-10-11 17:13:53,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 179 transitions, 392 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:53,776 INFO L231 Difference]: Finished difference. Result has 184 places, 179 transitions, 368 flow [2024-10-11 17:13:53,777 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=368, PETRI_PLACES=184, PETRI_TRANSITIONS=179} [2024-10-11 17:13:53,778 INFO L277 CegarLoopForPetriNet]: 244 programPoint places, -60 predicate places. [2024-10-11 17:13:53,778 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 179 transitions, 368 flow [2024-10-11 17:13:53,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 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-10-11 17:13:53,779 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:53,780 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] [2024-10-11 17:13:53,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:13:53,780 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2024-10-11 17:13:53,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:53,781 INFO L85 PathProgramCache]: Analyzing trace with hash -848682038, now seen corresponding path program 1 times [2024-10-11 17:13:53,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:53,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461197148] [2024-10-11 17:13:53,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:53,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:53,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:53,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:53,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:53,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461197148] [2024-10-11 17:13:53,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461197148] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:53,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:53,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:53,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402122439] [2024-10-11 17:13:53,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:53,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:53,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:53,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:53,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:53,910 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 259 [2024-10-11 17:13:53,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 179 transitions, 368 flow. Second operand has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 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-10-11 17:13:53,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:53,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 259 [2024-10-11 17:13:53,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:53,991 INFO L124 PetriNetUnfolderBase]: 16/225 cut-off events. [2024-10-11 17:13:53,992 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-11 17:13:53,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 225 events. 16/225 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 218 event pairs, 15 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 230. Up to 40 conditions per place. [2024-10-11 17:13:53,994 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 12 selfloop transitions, 2 changer transitions 0/178 dead transitions. [2024-10-11 17:13:53,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 178 transitions, 394 flow [2024-10-11 17:13:53,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:53,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:53,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 576 transitions. [2024-10-11 17:13:53,997 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7413127413127413 [2024-10-11 17:13:53,997 INFO L175 Difference]: Start difference. First operand has 184 places, 179 transitions, 368 flow. Second operand 3 states and 576 transitions. [2024-10-11 17:13:53,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 178 transitions, 394 flow [2024-10-11 17:13:53,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 178 transitions, 390 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:54,002 INFO L231 Difference]: Finished difference. Result has 183 places, 178 transitions, 366 flow [2024-10-11 17:13:54,005 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=366, PETRI_PLACES=183, PETRI_TRANSITIONS=178} [2024-10-11 17:13:54,006 INFO L277 CegarLoopForPetriNet]: 244 programPoint places, -61 predicate places. [2024-10-11 17:13:54,006 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 178 transitions, 366 flow [2024-10-11 17:13:54,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 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-10-11 17:13:54,006 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:54,007 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-10-11 17:13:54,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:13:54,007 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2024-10-11 17:13:54,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:54,008 INFO L85 PathProgramCache]: Analyzing trace with hash -191002288, now seen corresponding path program 1 times [2024-10-11 17:13:54,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:54,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186889404] [2024-10-11 17:13:54,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:54,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:54,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:54,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:54,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186889404] [2024-10-11 17:13:54,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186889404] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:54,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:54,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:54,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723447687] [2024-10-11 17:13:54,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:54,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:54,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:54,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:54,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:54,101 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 259 [2024-10-11 17:13:54,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 178 transitions, 366 flow. Second operand has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 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-10-11 17:13:54,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:54,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 259 [2024-10-11 17:13:54,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:54,177 INFO L124 PetriNetUnfolderBase]: 16/224 cut-off events. [2024-10-11 17:13:54,177 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-11 17:13:54,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 224 events. 16/224 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 218 event pairs, 15 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 221. Up to 40 conditions per place. [2024-10-11 17:13:54,180 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 12 selfloop transitions, 2 changer transitions 0/177 dead transitions. [2024-10-11 17:13:54,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 177 transitions, 392 flow [2024-10-11 17:13:54,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:54,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:54,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 576 transitions. [2024-10-11 17:13:54,183 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7413127413127413 [2024-10-11 17:13:54,183 INFO L175 Difference]: Start difference. First operand has 183 places, 178 transitions, 366 flow. Second operand 3 states and 576 transitions. [2024-10-11 17:13:54,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 177 transitions, 392 flow [2024-10-11 17:13:54,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 177 transitions, 388 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:54,186 INFO L231 Difference]: Finished difference. Result has 182 places, 177 transitions, 364 flow [2024-10-11 17:13:54,187 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=364, PETRI_PLACES=182, PETRI_TRANSITIONS=177} [2024-10-11 17:13:54,188 INFO L277 CegarLoopForPetriNet]: 244 programPoint places, -62 predicate places. [2024-10-11 17:13:54,188 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 177 transitions, 364 flow [2024-10-11 17:13:54,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 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-10-11 17:13:54,189 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:54,189 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] [2024-10-11 17:13:54,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:13:54,189 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2024-10-11 17:13:54,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:54,190 INFO L85 PathProgramCache]: Analyzing trace with hash -767190318, now seen corresponding path program 1 times [2024-10-11 17:13:54,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:54,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437283055] [2024-10-11 17:13:54,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:54,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:54,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:54,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:54,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:54,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437283055] [2024-10-11 17:13:54,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437283055] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:54,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:54,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:54,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408180737] [2024-10-11 17:13:54,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:54,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:54,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:54,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:54,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:54,273 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 259 [2024-10-11 17:13:54,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 177 transitions, 364 flow. Second operand has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 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-10-11 17:13:54,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:54,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 259 [2024-10-11 17:13:54,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:54,341 INFO L124 PetriNetUnfolderBase]: 16/223 cut-off events. [2024-10-11 17:13:54,345 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-11 17:13:54,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276 conditions, 223 events. 16/223 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 217 event pairs, 15 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 212. Up to 40 conditions per place. [2024-10-11 17:13:54,347 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 12 selfloop transitions, 2 changer transitions 0/176 dead transitions. [2024-10-11 17:13:54,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 176 transitions, 390 flow [2024-10-11 17:13:54,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:54,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:54,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 576 transitions. [2024-10-11 17:13:54,352 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7413127413127413 [2024-10-11 17:13:54,352 INFO L175 Difference]: Start difference. First operand has 182 places, 177 transitions, 364 flow. Second operand 3 states and 576 transitions. [2024-10-11 17:13:54,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 176 transitions, 390 flow [2024-10-11 17:13:54,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 176 transitions, 386 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:54,356 INFO L231 Difference]: Finished difference. Result has 181 places, 176 transitions, 362 flow [2024-10-11 17:13:54,356 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=362, PETRI_PLACES=181, PETRI_TRANSITIONS=176} [2024-10-11 17:13:54,358 INFO L277 CegarLoopForPetriNet]: 244 programPoint places, -63 predicate places. [2024-10-11 17:13:54,359 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 176 transitions, 362 flow [2024-10-11 17:13:54,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 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-10-11 17:13:54,360 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:54,360 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] [2024-10-11 17:13:54,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:13:54,360 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2024-10-11 17:13:54,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:54,361 INFO L85 PathProgramCache]: Analyzing trace with hash 414919141, now seen corresponding path program 1 times [2024-10-11 17:13:54,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:54,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508001009] [2024-10-11 17:13:54,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:54,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:54,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:54,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:54,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:54,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508001009] [2024-10-11 17:13:54,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508001009] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:54,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:54,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:54,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053201474] [2024-10-11 17:13:54,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:54,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:54,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:54,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:54,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:54,456 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 259 [2024-10-11 17:13:54,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 176 transitions, 362 flow. Second operand has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 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-10-11 17:13:54,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:54,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 259 [2024-10-11 17:13:54,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:54,539 INFO L124 PetriNetUnfolderBase]: 16/222 cut-off events. [2024-10-11 17:13:54,540 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-11 17:13:54,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275 conditions, 222 events. 16/222 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 214 event pairs, 15 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 203. Up to 40 conditions per place. [2024-10-11 17:13:54,541 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 12 selfloop transitions, 2 changer transitions 0/175 dead transitions. [2024-10-11 17:13:54,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 175 transitions, 388 flow [2024-10-11 17:13:54,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:54,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:54,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 576 transitions. [2024-10-11 17:13:54,544 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7413127413127413 [2024-10-11 17:13:54,544 INFO L175 Difference]: Start difference. First operand has 181 places, 176 transitions, 362 flow. Second operand 3 states and 576 transitions. [2024-10-11 17:13:54,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 175 transitions, 388 flow [2024-10-11 17:13:54,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 175 transitions, 384 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:54,548 INFO L231 Difference]: Finished difference. Result has 180 places, 175 transitions, 360 flow [2024-10-11 17:13:54,548 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=360, PETRI_PLACES=180, PETRI_TRANSITIONS=175} [2024-10-11 17:13:54,549 INFO L277 CegarLoopForPetriNet]: 244 programPoint places, -64 predicate places. [2024-10-11 17:13:54,549 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 175 transitions, 360 flow [2024-10-11 17:13:54,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 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-10-11 17:13:54,550 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:54,550 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] [2024-10-11 17:13:54,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:13:54,550 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2024-10-11 17:13:54,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:54,551 INFO L85 PathProgramCache]: Analyzing trace with hash 190325145, now seen corresponding path program 1 times [2024-10-11 17:13:54,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:54,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860894293] [2024-10-11 17:13:54,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:54,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:54,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:54,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:54,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:54,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860894293] [2024-10-11 17:13:54,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860894293] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:54,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:54,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:54,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177984034] [2024-10-11 17:13:54,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:54,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:54,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:54,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:54,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:54,603 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 259 [2024-10-11 17:13:54,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 175 transitions, 360 flow. Second operand has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 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-10-11 17:13:54,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:54,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 259 [2024-10-11 17:13:54,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:54,684 INFO L124 PetriNetUnfolderBase]: 16/221 cut-off events. [2024-10-11 17:13:54,684 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-11 17:13:54,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 221 events. 16/221 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 213 event pairs, 15 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 194. Up to 40 conditions per place. [2024-10-11 17:13:54,686 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 12 selfloop transitions, 2 changer transitions 0/174 dead transitions. [2024-10-11 17:13:54,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 174 transitions, 386 flow [2024-10-11 17:13:54,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:54,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:54,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 576 transitions. [2024-10-11 17:13:54,688 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7413127413127413 [2024-10-11 17:13:54,688 INFO L175 Difference]: Start difference. First operand has 180 places, 175 transitions, 360 flow. Second operand 3 states and 576 transitions. [2024-10-11 17:13:54,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 174 transitions, 386 flow [2024-10-11 17:13:54,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 174 transitions, 382 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:54,691 INFO L231 Difference]: Finished difference. Result has 179 places, 174 transitions, 358 flow [2024-10-11 17:13:54,692 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=358, PETRI_PLACES=179, PETRI_TRANSITIONS=174} [2024-10-11 17:13:54,692 INFO L277 CegarLoopForPetriNet]: 244 programPoint places, -65 predicate places. [2024-10-11 17:13:54,692 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 174 transitions, 358 flow [2024-10-11 17:13:54,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 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-10-11 17:13:54,693 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:54,693 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] [2024-10-11 17:13:54,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:13:54,694 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2024-10-11 17:13:54,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:54,694 INFO L85 PathProgramCache]: Analyzing trace with hash -386714039, now seen corresponding path program 1 times [2024-10-11 17:13:54,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:54,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188833131] [2024-10-11 17:13:54,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:54,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:54,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:54,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:54,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:54,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188833131] [2024-10-11 17:13:54,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188833131] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:54,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:54,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:54,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53999161] [2024-10-11 17:13:54,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:54,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:54,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:54,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:54,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:54,753 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 259 [2024-10-11 17:13:54,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 174 transitions, 358 flow. Second operand has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 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-10-11 17:13:54,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:54,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 259 [2024-10-11 17:13:54,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:54,823 INFO L124 PetriNetUnfolderBase]: 16/220 cut-off events. [2024-10-11 17:13:54,824 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-11 17:13:54,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 220 events. 16/220 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 212 event pairs, 15 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 185. Up to 40 conditions per place. [2024-10-11 17:13:54,825 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 12 selfloop transitions, 2 changer transitions 0/173 dead transitions. [2024-10-11 17:13:54,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 173 transitions, 384 flow [2024-10-11 17:13:54,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:54,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:54,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 576 transitions. [2024-10-11 17:13:54,828 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7413127413127413 [2024-10-11 17:13:54,828 INFO L175 Difference]: Start difference. First operand has 179 places, 174 transitions, 358 flow. Second operand 3 states and 576 transitions. [2024-10-11 17:13:54,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 173 transitions, 384 flow [2024-10-11 17:13:54,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 173 transitions, 380 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:54,831 INFO L231 Difference]: Finished difference. Result has 178 places, 173 transitions, 356 flow [2024-10-11 17:13:54,831 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=356, PETRI_PLACES=178, PETRI_TRANSITIONS=173} [2024-10-11 17:13:54,832 INFO L277 CegarLoopForPetriNet]: 244 programPoint places, -66 predicate places. [2024-10-11 17:13:54,832 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 173 transitions, 356 flow [2024-10-11 17:13:54,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 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-10-11 17:13:54,833 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:54,833 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] [2024-10-11 17:13:54,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:13:54,833 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2024-10-11 17:13:54,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:54,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1808249474, now seen corresponding path program 1 times [2024-10-11 17:13:54,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:54,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138786304] [2024-10-11 17:13:54,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:54,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:54,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:54,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:54,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:54,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138786304] [2024-10-11 17:13:54,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138786304] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:54,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:54,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:54,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315325680] [2024-10-11 17:13:54,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:54,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:54,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:54,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:54,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:54,903 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 259 [2024-10-11 17:13:54,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 173 transitions, 356 flow. Second operand has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 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-10-11 17:13:54,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:54,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 259 [2024-10-11 17:13:54,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:54,993 INFO L124 PetriNetUnfolderBase]: 16/219 cut-off events. [2024-10-11 17:13:54,993 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-11 17:13:54,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 219 events. 16/219 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 214 event pairs, 15 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 176. Up to 40 conditions per place. [2024-10-11 17:13:54,995 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 12 selfloop transitions, 2 changer transitions 0/172 dead transitions. [2024-10-11 17:13:54,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 172 transitions, 382 flow [2024-10-11 17:13:54,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:54,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:54,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 576 transitions. [2024-10-11 17:13:54,997 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7413127413127413 [2024-10-11 17:13:54,997 INFO L175 Difference]: Start difference. First operand has 178 places, 173 transitions, 356 flow. Second operand 3 states and 576 transitions. [2024-10-11 17:13:54,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 172 transitions, 382 flow [2024-10-11 17:13:54,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 172 transitions, 378 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:55,000 INFO L231 Difference]: Finished difference. Result has 177 places, 172 transitions, 354 flow [2024-10-11 17:13:55,001 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=354, PETRI_PLACES=177, PETRI_TRANSITIONS=172} [2024-10-11 17:13:55,002 INFO L277 CegarLoopForPetriNet]: 244 programPoint places, -67 predicate places. [2024-10-11 17:13:55,002 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 172 transitions, 354 flow [2024-10-11 17:13:55,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 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-10-11 17:13:55,003 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:55,003 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] [2024-10-11 17:13:55,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:13:55,004 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2024-10-11 17:13:55,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:55,004 INFO L85 PathProgramCache]: Analyzing trace with hash 150126939, now seen corresponding path program 1 times [2024-10-11 17:13:55,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:55,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065250399] [2024-10-11 17:13:55,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:55,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:55,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:55,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:55,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:55,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065250399] [2024-10-11 17:13:55,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065250399] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:55,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:55,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:55,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709673359] [2024-10-11 17:13:55,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:55,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:55,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:55,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:55,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:55,086 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 259 [2024-10-11 17:13:55,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 172 transitions, 354 flow. Second operand has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 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-10-11 17:13:55,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:55,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 259 [2024-10-11 17:13:55,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:55,150 INFO L124 PetriNetUnfolderBase]: 16/218 cut-off events. [2024-10-11 17:13:55,150 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-11 17:13:55,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271 conditions, 218 events. 16/218 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 213 event pairs, 15 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 167. Up to 40 conditions per place. [2024-10-11 17:13:55,153 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 12 selfloop transitions, 2 changer transitions 0/171 dead transitions. [2024-10-11 17:13:55,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 171 transitions, 380 flow [2024-10-11 17:13:55,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:55,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:55,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 576 transitions. [2024-10-11 17:13:55,155 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7413127413127413 [2024-10-11 17:13:55,156 INFO L175 Difference]: Start difference. First operand has 177 places, 172 transitions, 354 flow. Second operand 3 states and 576 transitions. [2024-10-11 17:13:55,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 171 transitions, 380 flow [2024-10-11 17:13:55,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 171 transitions, 376 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:55,159 INFO L231 Difference]: Finished difference. Result has 176 places, 171 transitions, 352 flow [2024-10-11 17:13:55,159 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=352, PETRI_PLACES=176, PETRI_TRANSITIONS=171} [2024-10-11 17:13:55,160 INFO L277 CegarLoopForPetriNet]: 244 programPoint places, -68 predicate places. [2024-10-11 17:13:55,160 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 171 transitions, 352 flow [2024-10-11 17:13:55,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 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-10-11 17:13:55,161 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:55,161 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] [2024-10-11 17:13:55,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:13:55,161 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2024-10-11 17:13:55,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:55,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1006448256, now seen corresponding path program 1 times [2024-10-11 17:13:55,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:55,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449894595] [2024-10-11 17:13:55,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:55,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:55,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:55,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:55,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:55,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449894595] [2024-10-11 17:13:55,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449894595] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:55,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:55,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:55,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937092617] [2024-10-11 17:13:55,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:55,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:55,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:55,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:55,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:55,217 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 259 [2024-10-11 17:13:55,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 171 transitions, 352 flow. Second operand has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 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-10-11 17:13:55,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:55,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 259 [2024-10-11 17:13:55,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:55,282 INFO L124 PetriNetUnfolderBase]: 16/217 cut-off events. [2024-10-11 17:13:55,282 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-11 17:13:55,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 270 conditions, 217 events. 16/217 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 212 event pairs, 15 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 158. Up to 40 conditions per place. [2024-10-11 17:13:55,284 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 12 selfloop transitions, 2 changer transitions 0/170 dead transitions. [2024-10-11 17:13:55,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 170 transitions, 378 flow [2024-10-11 17:13:55,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:55,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:55,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 576 transitions. [2024-10-11 17:13:55,286 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7413127413127413 [2024-10-11 17:13:55,286 INFO L175 Difference]: Start difference. First operand has 176 places, 171 transitions, 352 flow. Second operand 3 states and 576 transitions. [2024-10-11 17:13:55,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 170 transitions, 378 flow [2024-10-11 17:13:55,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 170 transitions, 374 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:55,289 INFO L231 Difference]: Finished difference. Result has 175 places, 170 transitions, 350 flow [2024-10-11 17:13:55,289 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=350, PETRI_PLACES=175, PETRI_TRANSITIONS=170} [2024-10-11 17:13:55,290 INFO L277 CegarLoopForPetriNet]: 244 programPoint places, -69 predicate places. [2024-10-11 17:13:55,290 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 170 transitions, 350 flow [2024-10-11 17:13:55,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 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-10-11 17:13:55,291 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:55,291 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] [2024-10-11 17:13:55,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:13:55,291 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2024-10-11 17:13:55,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:55,292 INFO L85 PathProgramCache]: Analyzing trace with hash -305922832, now seen corresponding path program 1 times [2024-10-11 17:13:55,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:55,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023345951] [2024-10-11 17:13:55,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:55,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:55,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:55,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:55,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:55,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023345951] [2024-10-11 17:13:55,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023345951] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:55,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:55,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:55,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032939146] [2024-10-11 17:13:55,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:55,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:55,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:55,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:55,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:55,339 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 259 [2024-10-11 17:13:55,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 170 transitions, 350 flow. Second operand has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 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-10-11 17:13:55,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:55,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 259 [2024-10-11 17:13:55,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:55,400 INFO L124 PetriNetUnfolderBase]: 16/216 cut-off events. [2024-10-11 17:13:55,401 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-11 17:13:55,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 216 events. 16/216 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 206 event pairs, 15 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 149. Up to 40 conditions per place. [2024-10-11 17:13:55,402 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 12 selfloop transitions, 2 changer transitions 0/169 dead transitions. [2024-10-11 17:13:55,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 169 transitions, 376 flow [2024-10-11 17:13:55,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:55,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:55,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 576 transitions. [2024-10-11 17:13:55,404 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7413127413127413 [2024-10-11 17:13:55,404 INFO L175 Difference]: Start difference. First operand has 175 places, 170 transitions, 350 flow. Second operand 3 states and 576 transitions. [2024-10-11 17:13:55,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 169 transitions, 376 flow [2024-10-11 17:13:55,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 169 transitions, 372 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:55,407 INFO L231 Difference]: Finished difference. Result has 174 places, 169 transitions, 348 flow [2024-10-11 17:13:55,407 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=348, PETRI_PLACES=174, PETRI_TRANSITIONS=169} [2024-10-11 17:13:55,408 INFO L277 CegarLoopForPetriNet]: 244 programPoint places, -70 predicate places. [2024-10-11 17:13:55,409 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 169 transitions, 348 flow [2024-10-11 17:13:55,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 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-10-11 17:13:55,410 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:55,410 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] [2024-10-11 17:13:55,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:13:55,411 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2024-10-11 17:13:55,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:55,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1027410097, now seen corresponding path program 1 times [2024-10-11 17:13:55,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:55,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454014579] [2024-10-11 17:13:55,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:55,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:55,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:55,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:55,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:55,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454014579] [2024-10-11 17:13:55,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454014579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:55,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:55,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:55,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228189249] [2024-10-11 17:13:55,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:55,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:55,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:55,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:55,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:55,534 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 259 [2024-10-11 17:13:55,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 169 transitions, 348 flow. Second operand has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 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-10-11 17:13:55,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:55,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 259 [2024-10-11 17:13:55,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:55,608 INFO L124 PetriNetUnfolderBase]: 16/215 cut-off events. [2024-10-11 17:13:55,608 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-11 17:13:55,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 215 events. 16/215 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 205 event pairs, 15 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 138. Up to 37 conditions per place. [2024-10-11 17:13:55,609 INFO L140 encePairwiseOnDemand]: 257/259 looper letters, 10 selfloop transitions, 1 changer transitions 0/168 dead transitions. [2024-10-11 17:13:55,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 168 transitions, 368 flow [2024-10-11 17:13:55,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:55,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:55,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 585 transitions. [2024-10-11 17:13:55,612 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.752895752895753 [2024-10-11 17:13:55,612 INFO L175 Difference]: Start difference. First operand has 174 places, 169 transitions, 348 flow. Second operand 3 states and 585 transitions. [2024-10-11 17:13:55,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 168 transitions, 368 flow [2024-10-11 17:13:55,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 168 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:55,615 INFO L231 Difference]: Finished difference. Result has 173 places, 168 transitions, 344 flow [2024-10-11 17:13:55,615 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=173, PETRI_TRANSITIONS=168} [2024-10-11 17:13:55,616 INFO L277 CegarLoopForPetriNet]: 244 programPoint places, -71 predicate places. [2024-10-11 17:13:55,617 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 168 transitions, 344 flow [2024-10-11 17:13:55,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 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-10-11 17:13:55,617 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:55,618 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] [2024-10-11 17:13:55,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:13:55,618 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2024-10-11 17:13:55,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:55,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1142487411, now seen corresponding path program 1 times [2024-10-11 17:13:55,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:55,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343671394] [2024-10-11 17:13:55,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:55,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:55,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:55,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:55,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:55,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343671394] [2024-10-11 17:13:55,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343671394] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:55,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:55,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:55,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370396928] [2024-10-11 17:13:55,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:55,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:55,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:55,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:55,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:55,745 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 259 [2024-10-11 17:13:55,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 168 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 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-10-11 17:13:55,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:55,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 259 [2024-10-11 17:13:55,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:55,803 INFO L124 PetriNetUnfolderBase]: 15/218 cut-off events. [2024-10-11 17:13:55,804 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-11 17:13:55,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267 conditions, 218 events. 15/218 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 205 event pairs, 15 based on Foata normal form. 0/213 useless extension candidates. Maximal degree in co-relation 245. Up to 37 conditions per place. [2024-10-11 17:13:55,805 INFO L140 encePairwiseOnDemand]: 257/259 looper letters, 10 selfloop transitions, 1 changer transitions 0/167 dead transitions. [2024-10-11 17:13:55,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 167 transitions, 364 flow [2024-10-11 17:13:55,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:55,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:55,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 585 transitions. [2024-10-11 17:13:55,807 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.752895752895753 [2024-10-11 17:13:55,807 INFO L175 Difference]: Start difference. First operand has 173 places, 168 transitions, 344 flow. Second operand 3 states and 585 transitions. [2024-10-11 17:13:55,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 167 transitions, 364 flow [2024-10-11 17:13:55,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 167 transitions, 363 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:13:55,810 INFO L231 Difference]: Finished difference. Result has 173 places, 167 transitions, 343 flow [2024-10-11 17:13:55,810 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=343, PETRI_PLACES=173, PETRI_TRANSITIONS=167} [2024-10-11 17:13:55,811 INFO L277 CegarLoopForPetriNet]: 244 programPoint places, -71 predicate places. [2024-10-11 17:13:55,811 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 167 transitions, 343 flow [2024-10-11 17:13:55,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 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-10-11 17:13:55,812 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:55,812 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] [2024-10-11 17:13:55,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:13:55,812 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2024-10-11 17:13:55,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:55,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1642471173, now seen corresponding path program 1 times [2024-10-11 17:13:55,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:55,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642388662] [2024-10-11 17:13:55,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:55,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:55,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:55,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:55,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:55,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642388662] [2024-10-11 17:13:55,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642388662] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:55,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:55,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:55,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617855317] [2024-10-11 17:13:55,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:55,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:55,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:55,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:55,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:55,901 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 259 [2024-10-11 17:13:55,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 167 transitions, 343 flow. Second operand has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 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-10-11 17:13:55,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:55,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 259 [2024-10-11 17:13:55,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:55,956 INFO L124 PetriNetUnfolderBase]: 15/216 cut-off events. [2024-10-11 17:13:55,957 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-11 17:13:55,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 216 events. 15/216 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 203 event pairs, 15 based on Foata normal form. 2/213 useless extension candidates. Maximal degree in co-relation 255. Up to 37 conditions per place. [2024-10-11 17:13:55,957 INFO L140 encePairwiseOnDemand]: 257/259 looper letters, 0 selfloop transitions, 0 changer transitions 166/166 dead transitions. [2024-10-11 17:13:55,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 166 transitions, 361 flow [2024-10-11 17:13:55,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:55,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:55,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 584 transitions. [2024-10-11 17:13:55,960 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7516087516087516 [2024-10-11 17:13:55,960 INFO L175 Difference]: Start difference. First operand has 173 places, 167 transitions, 343 flow. Second operand 3 states and 584 transitions. [2024-10-11 17:13:55,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 166 transitions, 361 flow [2024-10-11 17:13:55,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 166 transitions, 360 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:13:55,962 INFO L231 Difference]: Finished difference. Result has 173 places, 0 transitions, 0 flow [2024-10-11 17:13:55,962 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=173, PETRI_TRANSITIONS=0} [2024-10-11 17:13:55,963 INFO L277 CegarLoopForPetriNet]: 244 programPoint places, -71 predicate places. [2024-10-11 17:13:55,963 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 0 transitions, 0 flow [2024-10-11 17:13:55,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 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-10-11 17:13:55,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (125 of 126 remaining) [2024-10-11 17:13:55,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (124 of 126 remaining) [2024-10-11 17:13:55,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (123 of 126 remaining) [2024-10-11 17:13:55,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (122 of 126 remaining) [2024-10-11 17:13:55,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (121 of 126 remaining) [2024-10-11 17:13:55,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (120 of 126 remaining) [2024-10-11 17:13:55,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (119 of 126 remaining) [2024-10-11 17:13:55,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (118 of 126 remaining) [2024-10-11 17:13:55,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (117 of 126 remaining) [2024-10-11 17:13:55,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (116 of 126 remaining) [2024-10-11 17:13:55,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (115 of 126 remaining) [2024-10-11 17:13:55,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (114 of 126 remaining) [2024-10-11 17:13:55,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (113 of 126 remaining) [2024-10-11 17:13:55,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (112 of 126 remaining) [2024-10-11 17:13:55,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (111 of 126 remaining) [2024-10-11 17:13:55,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (110 of 126 remaining) [2024-10-11 17:13:55,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (109 of 126 remaining) [2024-10-11 17:13:55,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (108 of 126 remaining) [2024-10-11 17:13:55,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (107 of 126 remaining) [2024-10-11 17:13:55,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (106 of 126 remaining) [2024-10-11 17:13:55,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (105 of 126 remaining) [2024-10-11 17:13:55,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (104 of 126 remaining) [2024-10-11 17:13:55,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (103 of 126 remaining) [2024-10-11 17:13:55,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (102 of 126 remaining) [2024-10-11 17:13:55,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (101 of 126 remaining) [2024-10-11 17:13:55,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (100 of 126 remaining) [2024-10-11 17:13:55,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (99 of 126 remaining) [2024-10-11 17:13:55,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (98 of 126 remaining) [2024-10-11 17:13:55,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (97 of 126 remaining) [2024-10-11 17:13:55,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (96 of 126 remaining) [2024-10-11 17:13:55,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (95 of 126 remaining) [2024-10-11 17:13:55,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (94 of 126 remaining) [2024-10-11 17:13:55,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (93 of 126 remaining) [2024-10-11 17:13:55,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (92 of 126 remaining) [2024-10-11 17:13:55,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (91 of 126 remaining) [2024-10-11 17:13:55,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (90 of 126 remaining) [2024-10-11 17:13:55,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (89 of 126 remaining) [2024-10-11 17:13:55,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (88 of 126 remaining) [2024-10-11 17:13:55,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (87 of 126 remaining) [2024-10-11 17:13:55,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (86 of 126 remaining) [2024-10-11 17:13:55,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (85 of 126 remaining) [2024-10-11 17:13:55,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (84 of 126 remaining) [2024-10-11 17:13:55,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (83 of 126 remaining) [2024-10-11 17:13:55,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (82 of 126 remaining) [2024-10-11 17:13:55,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (81 of 126 remaining) [2024-10-11 17:13:55,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (80 of 126 remaining) [2024-10-11 17:13:55,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (79 of 126 remaining) [2024-10-11 17:13:55,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (78 of 126 remaining) [2024-10-11 17:13:55,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (77 of 126 remaining) [2024-10-11 17:13:55,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (76 of 126 remaining) [2024-10-11 17:13:55,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (75 of 126 remaining) [2024-10-11 17:13:55,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (74 of 126 remaining) [2024-10-11 17:13:55,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (73 of 126 remaining) [2024-10-11 17:13:55,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (72 of 126 remaining) [2024-10-11 17:13:55,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (71 of 126 remaining) [2024-10-11 17:13:55,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (70 of 126 remaining) [2024-10-11 17:13:55,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (69 of 126 remaining) [2024-10-11 17:13:55,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (68 of 126 remaining) [2024-10-11 17:13:55,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (67 of 126 remaining) [2024-10-11 17:13:55,975 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (66 of 126 remaining) [2024-10-11 17:13:55,975 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (65 of 126 remaining) [2024-10-11 17:13:55,975 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (64 of 126 remaining) [2024-10-11 17:13:55,975 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (63 of 126 remaining) [2024-10-11 17:13:55,975 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (62 of 126 remaining) [2024-10-11 17:13:55,975 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (61 of 126 remaining) [2024-10-11 17:13:55,976 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (60 of 126 remaining) [2024-10-11 17:13:55,976 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (59 of 126 remaining) [2024-10-11 17:13:55,976 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (58 of 126 remaining) [2024-10-11 17:13:55,976 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (57 of 126 remaining) [2024-10-11 17:13:55,976 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (56 of 126 remaining) [2024-10-11 17:13:55,976 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (55 of 126 remaining) [2024-10-11 17:13:55,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (54 of 126 remaining) [2024-10-11 17:13:55,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (53 of 126 remaining) [2024-10-11 17:13:55,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (52 of 126 remaining) [2024-10-11 17:13:55,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (51 of 126 remaining) [2024-10-11 17:13:55,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (50 of 126 remaining) [2024-10-11 17:13:55,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (49 of 126 remaining) [2024-10-11 17:13:55,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (48 of 126 remaining) [2024-10-11 17:13:55,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (47 of 126 remaining) [2024-10-11 17:13:55,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (46 of 126 remaining) [2024-10-11 17:13:55,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (45 of 126 remaining) [2024-10-11 17:13:55,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (44 of 126 remaining) [2024-10-11 17:13:55,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (43 of 126 remaining) [2024-10-11 17:13:55,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (42 of 126 remaining) [2024-10-11 17:13:55,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (41 of 126 remaining) [2024-10-11 17:13:55,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (40 of 126 remaining) [2024-10-11 17:13:55,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (39 of 126 remaining) [2024-10-11 17:13:55,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (38 of 126 remaining) [2024-10-11 17:13:55,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (37 of 126 remaining) [2024-10-11 17:13:55,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (36 of 126 remaining) [2024-10-11 17:13:55,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (35 of 126 remaining) [2024-10-11 17:13:55,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (34 of 126 remaining) [2024-10-11 17:13:55,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (33 of 126 remaining) [2024-10-11 17:13:55,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (32 of 126 remaining) [2024-10-11 17:13:55,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (31 of 126 remaining) [2024-10-11 17:13:55,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (30 of 126 remaining) [2024-10-11 17:13:55,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (29 of 126 remaining) [2024-10-11 17:13:55,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (28 of 126 remaining) [2024-10-11 17:13:55,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (27 of 126 remaining) [2024-10-11 17:13:55,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (26 of 126 remaining) [2024-10-11 17:13:55,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (25 of 126 remaining) [2024-10-11 17:13:55,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (24 of 126 remaining) [2024-10-11 17:13:55,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (23 of 126 remaining) [2024-10-11 17:13:55,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (22 of 126 remaining) [2024-10-11 17:13:55,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (21 of 126 remaining) [2024-10-11 17:13:55,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (20 of 126 remaining) [2024-10-11 17:13:55,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (19 of 126 remaining) [2024-10-11 17:13:55,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (18 of 126 remaining) [2024-10-11 17:13:55,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (17 of 126 remaining) [2024-10-11 17:13:55,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (16 of 126 remaining) [2024-10-11 17:13:55,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (15 of 126 remaining) [2024-10-11 17:13:55,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (14 of 126 remaining) [2024-10-11 17:13:55,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (13 of 126 remaining) [2024-10-11 17:13:55,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (12 of 126 remaining) [2024-10-11 17:13:55,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (11 of 126 remaining) [2024-10-11 17:13:55,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (10 of 126 remaining) [2024-10-11 17:13:55,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (9 of 126 remaining) [2024-10-11 17:13:55,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (8 of 126 remaining) [2024-10-11 17:13:55,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (7 of 126 remaining) [2024-10-11 17:13:55,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (6 of 126 remaining) [2024-10-11 17:13:55,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (5 of 126 remaining) [2024-10-11 17:13:55,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (4 of 126 remaining) [2024-10-11 17:13:55,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (3 of 126 remaining) [2024-10-11 17:13:55,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (2 of 126 remaining) [2024-10-11 17:13:55,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (1 of 126 remaining) [2024-10-11 17:13:55,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (0 of 126 remaining) [2024-10-11 17:13:55,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:13:55,992 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:56,001 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 17:13:56,001 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 17:13:56,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:13:56 BasicIcfg [2024-10-11 17:13:56,009 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 17:13:56,009 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 17:13:56,009 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 17:13:56,010 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 17:13:56,010 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:13:52" (3/4) ... [2024-10-11 17:13:56,012 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 17:13:56,014 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-11 17:13:56,015 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-11 17:13:56,015 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-10-11 17:13:56,020 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-11 17:13:56,021 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 17:13:56,022 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 17:13:56,023 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 17:13:56,127 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 17:13:56,128 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 17:13:56,128 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 17:13:56,128 INFO L158 Benchmark]: Toolchain (without parser) took 5918.92ms. Allocated memory was 153.1MB in the beginning and 295.7MB in the end (delta: 142.6MB). Free memory was 99.0MB in the beginning and 241.5MB in the end (delta: -142.4MB). Peak memory consumption was 2.3MB. Max. memory is 16.1GB. [2024-10-11 17:13:56,129 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 153.1MB. Free memory is still 114.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:13:56,129 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.95ms. Allocated memory is still 153.1MB. Free memory was 98.7MB in the beginning and 84.5MB in the end (delta: 14.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 17:13:56,129 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.91ms. Allocated memory is still 153.1MB. Free memory was 84.5MB in the beginning and 80.7MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 17:13:56,129 INFO L158 Benchmark]: Boogie Preprocessor took 52.17ms. Allocated memory is still 153.1MB. Free memory was 80.7MB in the beginning and 78.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:13:56,129 INFO L158 Benchmark]: RCFGBuilder took 2060.64ms. Allocated memory was 153.1MB in the beginning and 224.4MB in the end (delta: 71.3MB). Free memory was 78.3MB in the beginning and 83.7MB in the end (delta: -5.4MB). Peak memory consumption was 97.6MB. Max. memory is 16.1GB. [2024-10-11 17:13:56,130 INFO L158 Benchmark]: TraceAbstraction took 3228.97ms. Allocated memory was 224.4MB in the beginning and 295.7MB in the end (delta: 71.3MB). Free memory was 82.7MB in the beginning and 247.8MB in the end (delta: -165.1MB). Peak memory consumption was 82.4MB. Max. memory is 16.1GB. [2024-10-11 17:13:56,130 INFO L158 Benchmark]: Witness Printer took 118.63ms. Allocated memory is still 295.7MB. Free memory was 247.8MB in the beginning and 241.5MB in the end (delta: 6.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 17:13:56,131 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.28ms. Allocated memory is still 153.1MB. Free memory is still 114.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 369.95ms. Allocated memory is still 153.1MB. Free memory was 98.7MB in the beginning and 84.5MB in the end (delta: 14.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.91ms. Allocated memory is still 153.1MB. Free memory was 84.5MB in the beginning and 80.7MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.17ms. Allocated memory is still 153.1MB. Free memory was 80.7MB in the beginning and 78.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 2060.64ms. Allocated memory was 153.1MB in the beginning and 224.4MB in the end (delta: 71.3MB). Free memory was 78.3MB in the beginning and 83.7MB in the end (delta: -5.4MB). Peak memory consumption was 97.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3228.97ms. Allocated memory was 224.4MB in the beginning and 295.7MB in the end (delta: 71.3MB). Free memory was 82.7MB in the beginning and 247.8MB in the end (delta: -165.1MB). Peak memory consumption was 82.4MB. Max. memory is 16.1GB. * Witness Printer took 118.63ms. Allocated memory is still 295.7MB. Free memory was 247.8MB in the beginning and 241.5MB in the end (delta: 6.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: 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: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: 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: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: 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: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: 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, 329 locations, 126 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: 3.0s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 70 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 20 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 366 IncrementalHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 20 mSDtfsCounter, 366 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=488occurred in iteration=0, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1393 NumberOfCodeBlocks, 1393 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1378 ConstructedInterpolants, 0 QuantifiedInterpolants, 1408 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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 69 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-11 17:13:56,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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